Applying quantitative semantics to higher-order quantum computing
From MaRDI portal
Publication:5408456
DOI10.1145/2535838.2535879zbMath1284.68271arXiv1311.2290OpenAlexW2059456146MaRDI QIDQ5408456
Benoît Valiron, Michele Pagani, Peter Selinger
Publication date: 10 April 2014
Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.2290
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
Monoidal reverse differential categories, Classical control and quantum circuits in enriched category theory, Typing Quantum Superpositions and Measurement, A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls, Semantics of higher-order quantum computation via geometry of interaction, Semantics of quantum programming languages: Classical control, quantum control, Semantics for a quantum programming language by operator algebras, Unnamed Item, Infinite-Dimensionality in Quantum Foundations: W*-algebras as Presheaves over Matrix Algebras, Unordered Tuples in Quantum Computation, Unnamed Item, A concrete model for a typed linear algebraic lambda calculus, Quantum programming with inductive datatypes: causality and affine type theory, Mackey-complete spaces and power series – a topological model of differential linear logic, Unnamed Item, Unnamed Item, Unnamed Item, $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations, Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach, Unnamed Item, Complete positivity and natural representation of quantum computations, A logic for quantum register measurements, Concurrent Quantum Strategies, QPCF: higher-order languages and quantum circuits, A concrete categorical semantics of lambda-\(\mathcal{S}\)
