Semantics of higher-order quantum computation via geometry of interaction
From MaRDI portal
Publication:345711
DOI10.1016/j.apal.2016.10.010zbMath1422.68161arXiv1605.05079OpenAlexW2533990420MaRDI QIDQ345711
Publication date: 2 December 2016
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.05079
quantum computationdenotational semanticsprogramming languagecategorical semanticsgeometry of interactionhigher-order computation
Quantum computation (81P68) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50) Eilenberg-Moore and Kleisli constructions for monads (18C20)
Related Items
Semantics for a quantum programming language by operator algebras ⋮ Unnamed Item ⋮ Quantum programming with inductive datatypes: causality and affine type theory ⋮ Quantum computation: from a programmer's perspective ⋮ $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations ⋮ Universal Constructions for (Co)Relations: categories, monoidal categories, and props ⋮ Unnamed Item ⋮ QPCF: higher-order languages and quantum circuits
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum computation: from a programmer's perspective
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Linear realizability and full completeness for typed lambda-calculi
- On the final sequence of a finitary set functor
- Notions of computation and monads
- States, effects, and operations. Fundamental notions of quantum theory. Lectures in mathematical physics at the University of Texas at Austin. Ed. by A. Böhm, J. D. Dollard and W. H. Wootters
- Realizability. An introduction to its categorical side
- Normal functors, power series and \(\lambda\)-calculus
- The geometry of tensor calculus. I
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Reversible, irreversible and optimal \(\lambda\)-machines
- Universal coalgebra: A theory of systems
- Linearly distributive functors
- Category seminar. Proceedings Sydney category theory seminar 1972/1973
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Relating computational effects by \(\top \top \)-lifting
- An Overview of QML With a Concrete Implementation in Haskell
- Confluence Results for a Quantum Lambda Calculus with Measurements
- On a Fully Abstract Model for a Quantum Linear Functional Language
- From Coalgebraic to Monoidal Traces
- States of Convex Sets
- Traces for coalgebraic components
- Geometry of Synthesis II: From Games to Delay-Insensitive Circuits
- PSEUDO-TELEPATHY: INPUT CARDINALITY AND BELL-TYPE INEQUALITIES
- Linear Realizability
- Functorial Boxes in String Diagrams
- On traced monoidal closed categories
- The Category-Theoretic Solution of Recursive Domain Equations
- Categories for Types
- [top [top ]-closed relations and admissibility]
- The geometry of synchronization
- Memoryful geometry of interaction
- Parallelism and Synchronization in an Infinitary Context
- A Lambda Calculus for Quantum Computation
- Programming as a Discipline of Mathematical Nature
- Geometry of Interaction and linear combinatory algebras
- Towards a quantum programming language
- Traced monoidal categories
- Geometry of synthesis iv
- Applying quantitative semantics to higher-order quantum computing
- Geometry of synthesis III
- Measurements in Proof Nets as Higher-Order Quantum Circuits
- Game Semantics for Quantum Stores
- Generic Trace Semantics via Coinduction
- An axiomatic basis for computer programming
- Finiteness spaces
- Term Rewriting and Applications
- Two applications of analytic functors
