An algebra of pure quantum programming
From MaRDI portal
Abstract: We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previously-developed denotational semantics of QML. The completeness proof also gives rise to a normalisation algorithm following the normalisation by evaluation approach. The current work focuses on the pure fragment of QML omitting measurements.
Recommendations
- Algebraic effects, linearity, and quantum programming languages
- Semantics for a quantum programming language by operator algebras
- Semantics for a quantum programming language by operator algebras
- scientific article; zbMATH DE number 1612487
- An Algebraic Language for Distributed Quantum Computing
- A programming language characterizing quantum polynomial time
- Towards a quantum programming language
- Quantum Programs as Kleisli Maps
- Quantum register algebra: the mathematical language for quantum computing
Cites work
Cited in
(13)- QPCF: higher-order languages and quantum circuits
- An Algebraic Language for Distributed Quantum Computing
- An overview of QML with a concrete implementation in Haskell
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- Can a quantum computer run the von Neumann architecture?
- Scalar System F for linear-algebraic -calculus: towards a quantum physical logic
- FJQuantum. A quantum object oriented language
- The Arrow Calculus as a Quantum Programming Language
- Algebraic effects, linearity, and quantum programming languages
- Quantum Programs as Kleisli Maps
- Reasoning about general quantum programs over mixed states
- scientific article; zbMATH DE number 6712184 (Why is no real title available?)
- Measurements and confluence in quantum lambda calculi with explicit qubits
This page was built for publication: An algebra of pure quantum programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864167)