Quantum Interactive Proofs with Competing Provers
<|reference_start|>Quantum Interactive Proofs with Competing Provers: This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other that tries to convince the verifier to reject. We prove that every language having an ordinary quantum interactive proof system also has a quantum refereed game in which the verifier exchanges just one round of messages with each prover. A key part of our proof is the fact that there exists a single quantum measurement that reliably distinguishes between mixed states chosen arbitrarily from disjoint convex sets having large minimal trace distance from one another. We also show how to reduce the probability of error for some classes of quantum refereed games.<|reference_end|>
@article{gutoski2004quantum,
    title={Quantum Interactive Proofs with Competing Provers},
    author={Gus Gutoski and John Watrous},
    journal={Proceedings of STACS 2005, LNCS vol. 3404, pages 605-616},
    year={2004},
    doi={10.1007/978-3-540-31856-9_50},
    archivePrefix={arXiv},
    eprint={cs/0412102},
    primaryClass={cs.CC quant-ph}
}