scientific article
From MaRDI portal
Publication:2980972
DOI10.23638/LMCS-13(1:8)2017zbMath1448.68206arXivquant-ph/0612199MaRDI QIDQ2980972
Publication date: 8 May 2017
Full work available at URL: https://arxiv.org/abs/quant-ph/0612199
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)
Related Items (15)
Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model ⋮ Typing Quantum Superpositions and Measurement ⋮ A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls ⋮ Semantics of quantum programming languages: Classical control, quantum control ⋮ Extensional proofs in a propositional logic modulo isomorphisms ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ A concrete model for a typed linear algebraic lambda calculus ⋮ Linear-algebraic λ-calculus: higher-order, encodings, and confluence. ⋮ The vectorial \(\lambda\)-calculus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A categorical construction for the computational definition of vector spaces ⋮ 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 concrete categorical semantics of lambda-\(\mathcal{S}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new universal and fault-tolerant quantum basis
- Linear logic
- Computational interpretations of linear logic
- Typed lambda calculi and applications. 9th international conference, TLCA 2009, Brasilia, Brazil, July 1--3, 2009. Proceedings
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- Adding algebraic rewriting to the untyped lambda calculus
- Lambda-calculi for (strict) parallel functions
- The differential lambda-calculus
- On theories with a combinatorial definition of 'equivalence'
- An Algebra of Pure Quantum Programming
- Probabilistic -calculus and Quantitative Program Analysis
- Reasoning about Entanglement and Separability in Quantum Higher-Order Functions
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- Quantum Entanglement Analysis Based on Abstract Interpretation
- Completion of a Set of Rules Modulo a Set of Equations
- Complete Sets of Reductions for Some Equational Theories
- Rapid solution of problems by quantum computation
- Quantum computations: algorithms and error correction
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Computability
- The one-way quantum computer--a non-network model of quantum computation
- A Lambda Calculus for Quantum Computation
- Towards a quantum programming language
- Quantum complexity theory
- On Linear Combinations of λ-Terms
- Quantum programming languages: survey and bibliography
- A lambda calculus for quantum computation with classical control
- Finiteness spaces
This page was built for publication:
