Applying quantitative semantics to higher-order quantum computing
From MaRDI portal
Abstract: Finding a denotational semantics for higher order quantum computation is a long-standing problem in the semantics of quantum programming languages. Most past approaches to this problem fell short in one way or another, either limiting the language to an unusably small finitary fragment, or giving up important features of quantum physics such as entanglement. In this paper, we propose a denotational semantics for a quantum lambda calculus with recursion and an infinite data type, using constructions from quantitative semantics of linear logic.
Recommendations
Cited in
(41)- Semantics for a quantum programming language by operator algebras
- Classical control and quantum circuits in enriched category theory
- Semantics of quantum programming languages: Classical control, quantum control
- Quantum programming with inductive datatypes: causality and affine type theory
- A logic for quantum register measurements
- QPCF: higher-order languages and quantum circuits
- A concrete categorical semantics of lambda-\(\mathcal{S}\)
- Complete positivity and natural representation of quantum computations
- Game semantics for quantum data
- Towards a quantum calculus (work in progress, extended abstract)
- \textsc{qPCF}: a language for quantum circuit computations
- Reasoning about Entanglement and Separability in Quantum Higher-Order Functions
- scientific article; zbMATH DE number 5667324 (Why is no real title available?)
- Semantics of higher-order quantum computation via geometry of interaction
- Mackey-complete spaces and power series -- a topological model of differential linear logic
- Geometry of resource interaction and Taylor-Ehrhard-Regnier expansion: \textit{a minimalist approach}
- Presheaf models of quantum computation: an outline
- LNL-FPC: the linear/non-linear fixpoint calculus
- Semantics for a quantum programming language by operator algebras
- Infinite-Dimensionality in Quantum Foundations: W*-algebras as Presheaves over Matrix Algebras
- Unordered tuples in quantum computation
- Geometry of resource interaction -- \textit{a minimalist approach}
- Quantum programming made easy
- Computational adequacy for substructural lambda calculi
- Typing Quantum Superpositions and Measurement
- A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls
- Classical control, quantum circuits and linear logic in enriched category theory
- Concurrent quantum strategies
- Game semantics for quantum stores
- Biproducts in monoidal categories
- Monoidal reverse differential categories
- A concrete model for a typed linear algebraic lambda calculus
- Quantum CPOs
- Linear-algebraic models of linear logic as categories of modules over \(\Sigma \)-semirings
- Semantics for a Turing-complete reversible programming language with inductive types
- Combining quantum and classical control: syntax, semantics and adequacy
- An analysis of symmetry in quantitative semantics
- The sup connective in IMALL: a categorical semantics
- Categories of quantum cpos
- A rewriting theory for quantum -calculus
- Compositional and holistic quantum computational semantics
This page was built for publication: Applying quantitative semantics to higher-order quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408456)
