BQP and the polynomial hierarchy
Author:
Open Access
- 5 June 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 141-150
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- The complexity of computing a Nash equilibriumCommunications of the ACM, 2009
- A Simple Proof of Bazzi’s TheoremACM Transactions on Computation Theory, 2009
- Exponential Separation of Quantum and Classical One-Way Communication ComplexitySIAM Journal on Computing, 2008
- Sharp Quantum versus Classical Query Complexity SeparationsAlgorithmica, 2002
- Quantum lower bounds by polynomialsJournal of the ACM, 2001
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Constant depth circuits, Fourier transform, and learnabilityJournal of the ACM, 1993
- IP = PSPACEJournal of the ACM, 1992
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984