Structural complexity 1
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the degree of Boolean functions as real polynomials
Computational Complexity - Special issue on circuit complexity
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Relativized worlds with an infinite hierarchy
Information Processing Letters
Complexity limitations on Quantum computation
Journal of Computer and System Sciences
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Determining Acceptance Possibility for a Quantum Computation is Hard for PH
Determining Acceptance Possibility for a Quantum Computation is Hard for PH
On the counting functions
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
A common algebraic description for probabilistic and quantum computations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Revisiting a limit on efficient quantum computation
Proceedings of the 44th annual Southeast regional conference
Universality and programmability of quantum computers
Theoretical Computer Science
On the solution of trivalent decision problems by quantum state identification
Natural Computing: an international journal
| Hi-index | 0.00 |
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools of computational complexity theory should come to bear on these important questions.Quantum computing often scares away many potential researchers in computer science because of the apparent background need in quantum mechanics and the alien looking notation used in papers on the topic.This paper will give an overview of quantum computation from the point of view of a complexity theorist. We will see that one can think of BQP as yet another complexity class and study its power without focusing on the physical aspects behind it.