On quantum lambda calculi: a foundational perspective
From MaRDI portal
Publication:2973238
DOI10.1017/S0960129514000425zbMath1364.68208MaRDI QIDQ2973238
Publication date: 3 April 2017
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Combinatory logic and lambda calculus (03B40)
Related Items (16)
On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem ⋮ Typing Quantum Superpositions and Measurement ⋮ A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls ⋮ A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations ⋮ A concrete model for a typed linear algebraic lambda calculus ⋮ Unnamed Item ⋮ $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations ⋮ A class of recursive permutations which is primitive recursive complete ⋮ A new connective in natural deduction, and its application to quantum computing ⋮ A new connective in natural deduction, and its application to quantum computing ⋮ A logic for quantum register measurements ⋮ A Certified Study of a Reversible Programming Language ⋮ QPCF: higher-order languages and quantum circuits ⋮ Formalization of metatheory of the Quipper quantum programming language in a linear logic ⋮ Formal meta-level analysis framework for quantum programming languages ⋮ A concrete categorical semantics of lambda-\(\mathcal{S}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Light logics and optimal reduction: completeness and complexity
- Quantum implicit computational complexity
- Bounded linear logic: A modular approach to polynomial-time computability
- Trends in logic. 50 years of Studia Logica
- Quantum computing.
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Soft linear logic and polynomial time
- Quantum computation by measurement and quantum memory
- \(\lambda\)-definability and recursiveness
- Game Semantics for Quantum Data
- An Overview of QML With a Concrete Implementation in Haskell
- Quantum Patterns and Types for Entanglement and Separability
- Probabilistic operational semantics for the lambda calculus
- Quantum State Transformations and Branching Distributed Temporal Logic
- Quantum computation and quantum information†
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- On a measurement-free quantum lambda calculus with classical control
- The algebraic lambda calculus
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Complexity Theory
- Machines, Logic and Quantum Physics
- A Lambda Calculus for Quantum Computation
- Towards a quantum programming language
- Computational Complexity
- A single quantum cannot be cloned
- Quantum Computing
- Classically controlled quantum computation
- A lambda calculus for quantum computation with classical control
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
This page was built for publication: On quantum lambda calculi: a foundational perspective
