An axiomatic basis for computer programming
Communications of the ACM
Types and programming languages
Types and programming languages
Quantum computation and quantum information
Quantum computation and quantum information
A Lambda Calculus for Quantum Computation
SIAM Journal on Computing
A Functional Quantum Programming Language
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A logical analysis of aliasing in imperative higher-order functions
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Quantum Patterns and Types for Entanglement and Separability
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantum Entanglement Analysis Based on Abstract Interpretation
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Reasoning About Imperative Quantum Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
A lambda calculus for quantum computation with classical control
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Taming non-compositionality using new binders
UC'07 Proceedings of the 6th international conference on Unconventional Computation
| Hi-index | 0.00 |
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of aliasing for imperative functional programs. Both analyses share similarities notably because they are highly non-compositional. Nevertheless, the intrisic non determinism of quantum computation has a large impact on the definitions of the semantics and the validity of logical assertions. To the knowledge of the authors, it is the first proposal of an entanglement/separability analysis for a functional quantum programming language with higher-order functions.