Quantum implicit computational complexity
In: Theoretical Computer Science, Jg. 411 (2010-01-02), Heft 2, S. 377-409
academicJournal
Zugriff:
Abstract: 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. [Copyright &y& Elsevier]
Titel: |
Quantum implicit computational complexity
|
---|---|
Autor/in / Beteiligte Person: | Dal Lago, Ugo ; Masini, Andrea ; Zorzi, Margherita |
Zeitschrift: | Theoretical Computer Science, Jg. 411 (2010-01-02), Heft 2, S. 377-409 |
Veröffentlichung: | 2010 |
Medientyp: | academicJournal |
ISSN: | 0304-3975 (print) |
DOI: | 10.1016/j.tcs.2009.07.045 |
Schlagwort: |
|
Sonstiges: |
|