Skip to main content
SpringerLink
Log in

On the Power of Quantum, One Round, Two Prover Interactive Proof Systems

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

We analyze quantum two prover one round interactive proof systems, in which noninteracting provers can share unlimited entanglement. The maximum acceptance probability is characterized as a superoperator norm. We get some partial results and in particular we analyze the “rank one” case.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. K Aravind. Arxiv preprint quant-ph/0206070 (2002).

  2. Babai L.,Fortnow L., Lund C. (1991) Comput. Complex. 1:3

    Article  MATH  MathSciNet  Google Scholar 

  3. Bennett C.H., Bernstein H.J., Popescu S., Schumacher B. (1996) Phys. Rev. A 53(4):2046

    Article  ADS  Google Scholar 

  4. Bennett C.H., Brassard G., Crepeau C., Jozsa R., Peres A., Wootters W.K. (1993) Phys. Rev. Lett. 70(13):1895

    Article  MATH  ADS  MathSciNet  Google Scholar 

  5. Bennett C.H., Wiesner S.J. (1992) Phys. Rev. Lett. 69(20):2881

    Article  MATH  ADS  MathSciNet  Google Scholar 

  6. R. Cleve, P. Hoyer, B. Toner, and J. Watrous, Proc. Comput. Complex., pp. 236–249 (2004).

  7. R. Cleve, P. Hoyer, B. Toner, and J. Watrous, Presentation at Computational Complexity (2004).

  8. Communication from the anonymous referee.

  9. R. A. Horn and C. R. Johnson, Topics in Matrix Analysis (Cambridge University Press, 1994).

  10. J. Kempe, H. Kobayashi, K. Matsumoto, B. Toner, and T. Vidick, arXiv: 0704.2903 (2007).

  11. A. Kitaev, M. Vyalyi, and A. Shen, Classical and Quantum Computation (American Mathematical Society, 2002).

  12. A. Kitaev and J. Watrous, STOC, pp. 608–617 (2000).

  13. Kobayashi H., Matsumoto K. (2003) J. Comput. Syst. Sci. 66:429

    Article  MATH  MathSciNet  Google Scholar 

  14. Lund C., Fortnow L., Karloff H., Nisan N. (1992) J. ACM 39(4):859

    Article  MATH  MathSciNet  Google Scholar 

  15. Shamir A. (1992) J. ACM 39:869

    Article  MATH  MathSciNet  Google Scholar 

  16. K. G. H. Vollbrecht and R. F. Werner, Arxiv preprint quant-ph/9910064, pp. 6–7 (1999).

  17. J. Watrous, Arxiv preprint quant-ph/0411077 (2005).

  18. S. Wehner, STACS, pp. 162–171 (2006).

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Tel-Aviv University, Tel Aviv, 69978, Israel

    Alex Rapaport & Amnon Ta-Shma

Authors
  1. Alex Rapaport
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amnon Ta-Shma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alex Rapaport.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rapaport, A., Ta-Shma, A. On the Power of Quantum, One Round, Two Prover Interactive Proof Systems. Quantum Inf Process 6, 445–459 (2007). https://doi.org/10.1007/s11128-007-0068-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11128-007-0068-z

Keywords

PACS

Search

Navigation