Complexity limitations on quantum computation

@article{Fortnow1998ComplexityLO,
  title={Complexity limitations on quantum computation},
  author={Lance Fortnow and John D. Rogers},
  journal={Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247)},
  year={1998},
  pages={202-209}
}
  • L. Fortnow, J. Rogers
  • Published 15 June 1998
  • Computer Science
  • Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247)
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. BQP is low for PP, i.e., PP/sup BQP/=PP. There exists a relativized world where P=BQP and the polynomial-time hierarchy is infinite. There exists a relativized world where BQP does not have complete sets. There exists a relativized world where P=BQP but P/spl ne/UP/spl cap/coUP and one… 
Revisiting a limit on efficient quantum computation
TLDR
This paper offers an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP is contained in the classical counting class PP (Probabilistic Polynomial time).
Quantum computing, postselection, and probabilistic polynomial-time
  • S. Aaronson
  • Computer Science
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2005
TLDR
It is shown that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently, or probabilistic polynomial-time, and implies, as an easy corollary, a celebrated theorem of Beigel, Reingold and Spielman that PP is closed under intersection.
Approximate Counting and Quantum Computation
TLDR
A form of additive approximation which can be used to simulate a function in BQP is introduced and it is shown that all functions in the classes #P and GapP have such an approximation scheme under certain natural normalizations.
Oracle Separations for Quantum Statistical Zero-Knowledge
TLDR
These proofs rely on a bound on output state discrimination for relativized quantum circuits based on the quantum adversary method of Ambainis, following a technique similar to one used by Ben-David and Kothari to prove limitations on a query complexity variant of quantum statistical zero-knowledge.
Complexity of Quantum Computers
TLDR
It is shown that quantum computers can e fficiently solve a few problems known to be in the complexity class BQP, which cannot be ge n ralized to all algorithms, and quantum computers only give a quadratic improvement for NP-complet e problems.
Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
TLDR
It is shown that the complexity class NQP (a quantum analogue of NP) of Adleman, Demarrais and Huang, is equal to the counting class coC=P.
Quantum Complexity Classes
TLDR
Inspired by BQP, new complexity classes are defined that incorporate the current important quantum algorithms and the importance of the unitarity constraint given by quantum mechanics is revealed.
The Acrobatics of BQP
TLDR
It is shown that, in the black-box setting, the behavior of quantum polynomial-time ( BQP ) can be remarkably decoupled from that of classical complexity classes like NP .
Nondeterministic Quantum Query and Quantum Communication Complexities
TLDR
The nondeterministic quantum algorithms for Boolean functions f have positive acceptance probability on input x iff f(x)=1, which implies that the quantum communication complexities of the equality and disjointness functions are n+1 if the authors do not allow any error probability.
...
...

References

SHOWING 1-10 OF 33 REFERENCES
Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
TLDR
It is shown that the complexity class NQP (a quantum analogue of NP) of Adleman, Demarrais and Huang, is equal to the counting class coC=P.
Quantum Computability
TLDR
It is shown that when quantum Turing machines are restricted to have transition amplitudes which are algebraic numbers, BQP, EQP, and nondeterministic quantum polynomial time (NQP) are all contained in PP, hence in P and PSPACE.
On the power of quantum computation
  • Daniel R. Simon
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
TLDR
This work presents here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class.
Quantum complexity theory
TLDR
This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.
Quantum computation
TLDR
This article gives an introduc tion to quantum computing and briefly looks at a few results in quantum computation, not the least of which is Shor's polynomial-time factoring algorithm.
Relationships between quantum and classical space-bounded complexity classes
  • J. Watrous
  • Computer Science
    Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247)
  • 1998
TLDR
It follows that unbounded error, space O(s) bounded quantum Turing machines and probabilistic Turing machines are equivalent in power, which implies that any space s QTM can be simulated deterministically in space O (s/sup 2/), and further that any (unbounded-error) QTM running in log-space can be simulation in NC/Sup 2/.
Strengths and Weaknesses of Quantum Computing
TLDR
It is proved that relative to an oracle chosen uniformly at random with probability 1 the class $\NP$ cannot be solved on a quantum Turing machine (QTM) in time $o(2^{n/2})$.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  • P. Shor
  • Computer Science
    SIAM Rev.
  • 1999
TLDR
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.
A fast quantum mechanical algorithm for database search
TLDR
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
Limits on the provable consequences of one-way permutations
TLDR
It is shown that no technique which relativizes can prove that secret exchange can be based on any one-way permutation, and a general framework for proving statements of the form, “Cryptographic application X is not likely possible based solely on complexity assumption Y” is presented.
...
...