Quantum interactive proofs with weak error bounds

  title={Quantum interactive proofs with weak error bounds},
  author={Tsuyoshi Ito and Hirotada Kobayashi and John Watrous},
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 precisely characterized by EXP, the class of problems solvable in exponential time by deterministic Turing machines. This fact, and our proof of it, has implications concerning quantum and classical interactive proof systems in the setting of unbounded error that include the following: • Quantum… CONTINUE READING