Quantum Alternation: Prospects and Problems
arXiv:1511.01567 · doi:10.4204/EPTCS.195.3
Abstract
We propose a notion of quantum control in a quantum programming language which permits the superposition of finitely many quantum operations without performing a measurement. This notion takes the form of a conditional construct similar to the IF statement in classical programming languages. We show that adding such a quantum IF statement to the QPL programming language simplifies the presentation of several quantum algorithms. This motivates the possibility of extending the denotational semantics of QPL to include this form of quantum alternation. We give a denotational semantics for this extension of QPL based on Kraus decompositions rather than on superoperators. Finally, we clarify the relation between quantum alternation and recursion, and discuss the possibility of lifting the semantics defined by Kraus operators to the superoperator semantics defined by Selinger.
arXiv commentIn Proceedings QPL 2015, arXiv:1511.01181
References in corpus (4)
Cited by in corpus (10)
- Qunity: A Unified Language for Quantum and Classical Computing (Extended Version)
- Paschke Dilations
- Realizability in the Unitary Sphere
- Weakly measured while loops: peeking at quantum states
- A lambda calculus for density matrices with classical and probabilistic controls
- Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
- From Symmetric Pattern-Matching to Quantum Control (Extended Version)
- Reasoning about Recursive Quantum Programs
- Quantum Circuits Are Just a Phase
- Compositional Quantum Control Flow with Efficient Compilation in Qunity