QIP = PSPACE

@article{Jain2011QIPP,
  title={QIP = PSPACE},
  author={Rahul Jain and Zhengfeng Ji and Sarvagya Upadhyay and John Watrous},
  journal={J. ACM},
  year={2011},
  volume={58},
  pages={30:1-30:27}
}
This work considers the quantum interactive proof system model of computation, which is the (classical) interactive proof system model’s natural quantum computational analogue. An exact characterization of the expressive power of quantum interactive proof systems is obtained: the collection of computational problems having quantum interactive proof systems consists precisely of those problems solvable by deterministic Turing machines that use at most a polynomial amount of space (or, more… 

Figures from this paper

Space-efficient Simulations of Quantum Interactive Proofs
TLDR
This thesis studies the quantum-enhanced version of interactive proof systems, in which each party has access to quantum computing resources and proves a PSPACE upper bound for a variant of QMA(2) that is to date the most general one known in PSPACE.
Quantum interactive proofs with weak error bounds
This paper proves that the computational power of quantum interactive proof systems, with a double-exponentially small gap in acceptance probability between the completeness and soundness cases, is
Quantum Proofs
TLDR
An overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complexity classes they define is provided.
Quantum Information and Variants of Interactive Proof Systems
TLDR
The expressive power of quantum interactiveProof systems is exactly PSPACE, the class of problems that can be solved by a polynomial-space deterministic Turing machines and that also admit a classical interactive proof systems, and both the models are equivalent in terms of complexity-theoretic characterization.
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
TLDR
It is proved that any problem in QMA has a two-message quantum interactive proof system with perfect completeness and constant soundness error, where the verifier has only to send a constant number of halves of EPR pairs, and this improves the previous construction due to Kitaev and Watrous.
Two-Message Quantum Interactive Proofs and the Quantum Separability Problem
TLDR
The quantum separability problem constitutes the first nontrivial promise problem decidable by a two-message quantum interactive proof system while being hard for both NP and QSZK.
Interactive Proofs for Synthesizing Quantum States and Unitaries
TLDR
This work defines models of interactive proofs for synthesizing quantum states and unitaries, where a polynomial-time quantum verifier interacts with an untrusted quantum prover, and a verifier who accepts also outputs an approximation of the target state or the result of thetarget unitary applied to the input state.
QMIP = MIP*
TLDR
The results show that the entire power of quantum information in multi-prover interactive proof systems is captured by the shared entanglement and not by the quantum communication.
Approximation, Proof Systems, and Correlations in a Quantum World
TLDR
A polynomial-time (classical) approximation algorithm for dense instances of the canonical QMA-complete quantum constraint satisfaction problem, the local Hamiltonian problem, and two novel schemes for quantifying non-classicality are proposed.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 97 REFERENCES
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
TLDR
It is proved that any polynomial-round quan tum interactiveProof system with two-sided bounded error can be parallelized to a quantum interactive proof system with exponentially small one-sided error, in which the prover and verifier exchange only 3 messages.
PSPACE has constant-round quantum interactive proof systems
  • J. Watrous
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2003
PSPACE has constant-round quantum interactive proof systems
  • J. Watrous
  • Computer Science, Mathematics
    40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
  • 1999
TLDR
It is proved that every language in PSPACE has a quantum interactive proof system that requires a total of only three messages to be sent between the prover and verifier and has exponentially small (one-sided) probability of error.
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
TLDR
It is proved that the class of languages having quantum multi-prover interactive proof systems is necessarily contained in NEXP, under the assumption that provers are allowed to share at most polynomially many prior-entangled qubits.
Using Entanglement in Quantum Multi-Prover Interactive Proofs
TLDR
Positive aspects of prior entanglement are studied for the first time and it is shown how it can be used to parallelize any multi-prover quantum interactive proof system to a one-round system with perfect completeness, soundness bounded away from one by an inverse-polynomial in the input size, and one extra prover.
Quantum vs. classical communication and computation
TLDR
A simple and general simulation technique is presented that transforms any black-box quantum algorithm to a quantum communication protocol for a related problem, in a way that fully exploits the quantum parallelism, to obtain new positive and negative results.
Non-deterministic exponential time has two-prover interactive protocols
TLDR
It is shown that the class of languages having tow-prover interactive proof systems is nondeterministic exponential time and that to prove membership in languages inEXP, the honest provers need the power ofEXP only.
Non-deterministic exponential time has two-prover interactive protocols
TLDR
It is shown that the class of languages having tow-prover interactive proof systems is nondeterministic exponential time and that to prove membership in languages inEXP, the honest provers need the power ofEXP only.
Exponential separation of quantum and classical communication complexity
  • R. Raz
  • Computer Science
    STOC '99
  • 1999
TLDR
It is shown that for certain communication complezity problems quantum communication protocols are exponentially faster than classical ores and an ezponential gap between quantum communication complexity and classical probabilistic communication complexity is given.
Toward a general theory of quantum games
TLDR
A representation of quantum strategies is focused on that generalizes the Choi-Jamiolkowski representations of quantum, with respect to which each strategy is described by a single operations.
...
1
2
3
4
5
...