Limitations of quantum advice and one-way communication

@article{Aaronson2004LimitationsOQ,
  title={Limitations of quantum advice and one-way communication},
  author={Scott Aaronson},
  journal={Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.},
  year={2004},
  pages={320-332}
}
  • S. Aaronson
  • Published 14 February 2004
  • Computer Science
  • Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accessed. This paper shows in three settings that quantum messages have only limited advantages over classical ones. First, we show that BQP/qpoly /spl sube/ PP/poly, where BQP/qpoly is the class of problems solvable in quantum polynomial time, given a polynomial-size "quantum advice state " that depends only on the input length. This… 
View on IEEE
theoryofcomputing.org
112 Citations
Highly Influential Citations
17
Background Citations
37
Methods Citations
20
Results Citations
7

112 Citations

Quantum versus Classical Proofs and Advice
  • S. Aaronson, G. Kuperberg
  • Mathematics, Computer Science
    Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
  • 2007
TLDR
This paper shows that any quantum algorithm needs Omega (radic2n-m+1) queries to find an n-qubit "marked state"Psi rang, and gives an explicit QCMA protocol that nearly achieves this lower bound.
Limits of quantum one-way communication by matrix Hypercontractive Inequality
TLDR
It is proved that for larger values of k, the quantum complexities of those problems increase exponentially from O(log n) to Ω(n1−2/k), which is almost tight and renders any super-polynomial quantum-classical gaps impossible.
On the need for large Quantum depth
TLDR
The results show that relative to oracles, doubling the quantum circuit depth indeed gives the hybrid model more power, and this cannot be traded by classical computation.
Exponential separation of quantum and classical one-way communication complexity
TLDR
The Hidden Matching Problem HMn is defined and it is proved that any randomized linear one-way protocol with bounded error for this problem requires Ω(√[3] n log n) bits of communication.
QMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols
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 numberof bits into a…
Quantum Information and the PCP Theorem
  • R. Raz
  • Computer Science, Mathematics
    46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
  • 2005
TLDR
The main result is that the membership x∈SAT can be proved by a logarithmic-size quantum state, together with a polynomial-size classical proof consisting of blocks of length polylog(n) bits each, such that after measuring the state |Ψ〉 the verifier only needs to read one block of the classical proof.
QMA/qpoly /spl sube/ PSPACE/poly: de-Merlinizing quantum protocols
  • S. Aaronson
  • Mathematics
    21st Annual IEEE Conference on Computational Complexity (CCC'06)
  • 2006
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…
QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols
  • S. Aaronson
  • Mathematics
    Electron. Colloquium Comput. Complex.
  • 2005
TLDR
A new technique for removing existential quantifiers over quantum states is introduced, and it is shown 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 polymouthsize quantum witness.
Simultaneous Communication Protocols with Quantum and Classical Messages
TLDR
The results imply that quantum-classical protocols need to send ( p n/logn) bits/qubits to compute Equality on n-bit strings, and hence are not significantly better than classical- classical protocols (and are much worse than quantum-quantum protocols such as quantum fingerprinting).
Quantum lower bounds for approximate counting via laurent polynomials
  • S. Aaronson
  • Computer Science, Mathematics
    Electron. Colloquium Comput. Complex.
  • 2018
TLDR
The complexity of approximate counting, the problem of multiplicatively estimating the size of a nonempty set S ⊆ [N], is resolved in two natural generalizations of quantum query complexity.
...
...

References

SHOWING 1-10 OF 100 REFERENCES
Exponential separation of quantum and classical one-way communication complexity
TLDR
The Hidden Matching Problem HMn is defined and it is proved that any randomized linear one-way protocol with bounded error for this problem requires Ω(√[3] n log n) bits of communication.
Quantum lower bounds by polynomials
TLDR
This work examines the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}/sup N/ in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings.
Complexity limitations on quantum computation
  • L. Fortnow, J. Rogers
  • Computer Science
    Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247)
  • 1998
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…
Quantum Communication Complexity
TLDR
It is well known that entanglement on its own is useless for the transmission of information, but there are distributed tasks that cannot be accomplished at all in a classical world when communication is not allowed, but that become possible if the non-communicating parties share prior entanglements.
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.
Dense quantum coding and a lower bound for 1-way quantum automata
TLDR
An exponential lower bound on the size of 1-way quantum finite automata for a family of languages accepted by linear sized deterministic finite automaton is proved.
Quantum and classical message identification via quantum channels
  • A. Winter
  • Computer Science
    Quantum Inf. Comput.
  • 2005
TLDR
It is shown that the identification capacity of a discrete memoryless quantum channel for classical information can be larger than that for transmission; this is in contrast to all previously considered models, where it turns out to equal the common randomness capacity.
Both Toffoli and controlled-NOT need little help to do universal quantum computing
TLDR
It is proved that Controlled-NOT plus any single-qubit real gate that does not preserve the computational basis and is not Hadamard (or its alike) are universal for quantum computing.
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.
Optimal lower bounds for quantum automata and random access codes
  • A. Nayak
  • Computer Science
    40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
  • 1999
TLDR
Holevo's theorem is turned to, and it is shown that in typical situations, it may be replaced by a tighter and more transparent in-probability bound.
...
...