ArXiv.org · 2005 · 16 citations · 11 references
ComputingComputer ScienceMathematicsDiscrete MathematicsQuantum ComputingTheory Of ComputationProof ComplexityQuantum AlgorithmsQuantum BitsQuantum Complexity TheoryQuantum ComputationQuantum StatesBqpQcmaQipQmaQuantum Advice ComplexityQuantum Complexity Classes
This paper introduces a new technique for removing existential quantifiers over quantum states. Using this technique, we show that there is no way to pack an exponential number of bits into a polynomial-size quantum state, in such a way that the value of any one of those bits can later be proven with the help of a polynomial-size quantum witness. We also show that any problem in QMA with polynomial-size quantum advice, is also in PSPACE with polynomial-size classical advice. This builds on our earlier result that BQP/qpoly is contained in PP/poly, and offers an intriguing counterpoint to the recent discovery of Raz that QIP/qpoly = ALL. Finally, we show that QCMA/qpoly is contained in PP/poly and that QMA/rpoly = QMA/poly.
11
<i>Quantum Computation and Quantum Information</i>
Michael A. Nielsen, Isaac L. Chuang, Lov K. Grover · American Journal of Physics · 2002 · 22.7K citations
Chris Marriott, John Watrous · Computational Complexity · 2005 · 253 citations · Full text