A new recursion-theoretic characterization of the polytime functions
Computational Complexity
SIAM Journal on Computing
Information and Computation
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
Quantum computation and quantum information
Quantum computation and quantum information
Computational complexity of uniform quantum circuit families and quantum Turing machines
Theoretical Computer Science
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
A Lambda Calculus for Quantum Computation
SIAM Journal on Computing
Towards a quantum programming language
Mathematical Structures in Computer Science
An arithmetic for polynomial-time computation
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
A lambda calculus for quantum computation with classical control
Mathematical Structures in Computer Science
Quantum programming languages: survey and bibliography
Mathematical Structures in Computer Science
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
On a measurement-free quantum lambda calculus with classical control
Mathematical Structures in Computer Science
A feasible algorithm for typing in elementary affine logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A higher-order characterization of probabilistic polynomial time
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
| Hi-index | 5.23 |
We introduce a quantum lambda calculus inspired by Lafont's Soft Linear Logic and capturing the polynomial quantum complexity classes EQP, BQP and ZQP. The calculus is based on the ''classical control and quantum data'' paradigm. This is the first example of a formal system capturing quantum complexity classes in the spirit of implicit computational complexity - it is machine-free and no explicit bound (e.g., polynomials) appears in its syntax.