Gap-definable counting classes
Journal of Computer and System Sciences
SIAM Journal on Computing
On the Power of Quantum Computation
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
SIAM Journal on Computing
Complexity limitations on Quantum computation
Journal of Computer and System Sciences
Introduction to the Theory of Computation: Preliminary Edition
Introduction to the Theory of Computation: Preliminary Edition
One complexity theorist's view of quantum computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Classical and Quantum Computation
Classical and Quantum Computation
| Hi-index | 0.00 |
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomial time) is contained in the classical counting class PP (Probabilistic Polynomial time). Our proof follows the one given by Fortnow and Rogers that relates quantum computing to counting complexity classes by way of GapP functions. The contribution of this paper is an exposition of an important result that assumes a minimal background in computational complexity theory and no knowledge of quantum mechanics.