Reasoning about Entanglement and Separability in Quantum Higher-Order Functions

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.

• Type: Conference
• Year: 2009
• Where: UC
• Authors: Frédéric Prost, Chaouki Zerrari
• Keywords: Applied Computing, Functional Quantum, Functional Quantum Computation, Quantum Computation, UC 2009