Quantum implicit computational complexity


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 systemcapturing quantumcomplexity classes in the spirit of implicit computational… (More)
DOI: 10.1016/j.tcs.2009.07.045


2 Figures and Tables


Citations per Year

Citation Velocity: 6

Averaging 6 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.