On a measurement-free quantum lambda calculus with classical control
From MaRDI portal
Publication:3625676
DOI10.1017/S096012950800741XzbMath1166.68016MaRDI QIDQ3625676
Margherita Zorzi, Ugo Dal Lago, Andrea Masini
Publication date: 6 May 2009
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations ⋮ On quantum lambda calculi: a foundational perspective ⋮ Unnamed Item ⋮ $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations ⋮ Confluence Results for a Quantum Lambda Calculus with Measurements ⋮ Quantum implicit computational complexity ⋮ QPCF: higher-order languages and quantum circuits ⋮ Formalization of metatheory of the Quipper quantum programming language in a linear logic
Cites Work
- Unnamed Item
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- \(\lambda\)-definability and recursiveness
- Quantum Patterns and Types for Entanglement and Separability
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- The measurement calculus
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Complexity Theory
- A Lambda Calculus for Quantum Computation
- Towards a quantum programming language
- A lambda calculus for quantum computation with classical control
This page was built for publication: On a measurement-free quantum lambda calculus with classical control
