Quantum Computational Complexity
Author:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 1-40
Abstract
No abstract availableKeywords
All Related Versions
This publication has 65 references indexed in Scilit:
- The PCP theorem by gap amplificationJournal of the ACM, 2007
- Quantum lower bounds for the collision and the element distinctness problemsJournal of the ACM, 2004
- A complete problem for statistical zero knowledgeJournal of the ACM, 2003
- Space-Bounded Quantum ComplexityJournal of Computer and System Sciences, 1999
- Complexity Limitations on Quantum ComputationJournal of Computer and System Sciences, 1999
- PP Is Closed under IntersectionJournal of Computer and System Sciences, 1995
- Gap-definable counting classesJournal of Computer and System Sciences, 1994
- IP = PSPACEJournal of the ACM, 1992
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988