Sciweavers

UC
2009
Springer

Reasoning about Entanglement and Separability in Quantum Higher-Order Functions

14 years 29 days ago
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.
Frédéric Prost, Chaouki Zerrari
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where UC
Authors Frédéric Prost, Chaouki Zerrari
Comments (0)