Constant-space quantum interactive proofs against multiple provers

  title={Constant-space quantum interactive proofs against multiple provers},
  author={Tomoyuki Yamakami},
  journal={Inf. Process. Lett.},
We present upper and lower bounds of the computational complexity of the two-way communication model of multiple-prover quantum interactive proof systems whose verifiers are limited to measure-many two-way quantum finite automata. We prove that (i) the languages recognized by those multiple-prover systems running in expected polynomial time are exactly the ones in NEXP, the nondeterministic exponential-time complexity class, (ii) if we further require verifiers to be one-way quantum finite… CONTINUE READING


Publications citing this paper.