Complexity Limitations on Quantum Computation
Authors:
- Lance FortnowLFLance Fortnow
- John RogersJRJohn Rogers
- 1 October 1999
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 59 (2) , 240-252
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Strengths and Weaknesses of Quantum ComputingSIAM Journal on Computing, 1997
- Quantum Complexity TheorySIAM Journal on Computing, 1997
- Quantum ComputabilitySIAM Journal on Computing, 1997
- Quantum Computation1997
- A fast quantum mechanical algorithm for database search1996
- Perceptrons, PP, and the polynomial hierarchycomputational complexity, 1994
- Gap-definable counting classesJournal of Computer and System Sciences, 1994
- Complexity Measures for Public-Key CryptosystemsSIAM Journal on Computing, 1988
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977