Skip to main content
SpringerLink
Log in

Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2518))

Included in the following conference series:

  • 989 Accesses

Abstract

This paper gives the first formal treatment of a quantum analogue of multi-prover interactive proof systems. 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. This implies that, in particular, without any prior entanglement among provers, the class of languages having quantum multi-prover interactive proof systems is equal to NEXP. Related to these, it is shown that, if a prover does not have his private qubits, the class of languages having quantum single-prover interactive proof systems is also equal to NEXP.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Aharonov, A. Yu. Kitaev, and N. Nisan. Quantum circuits with mixed states. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 20–30, 1998.

    Google Scholar 

  2. L. Babai. Trading group theory for randomness. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 421–429, 1985.

    Google Scholar 

  3. L. Babai, L. J. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3–40, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. Bellare, U. Feige, and J. Kilian. On the role of shared randomness in two prover proof systems. In Proceedings of the 3rd Israel Symposium on the Theory of Computing and Systems, pages 199–208, 1995.

    Google Scholar 

  5. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: how to remove the intractability assumptions. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 113–131, 1988.

    Google Scholar 

  6. C. H. Bennett, E. Bernstein, G. Brassard, and U. V. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(5):1510–1523, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  7. J.-Y. Cai, A. Condon, and R. J. Lipton. On bounded round multi-prover interactive proof systems. In Proceedings of the 5th Annual Structure in Complexity Theory Conference, pages 45–54, 1990.

    Google Scholar 

  8. J.-Y. Cai, A. Condon, and R. J. Lipton. PSPACE is provable by two provers in one round. Journal of Computer and System Sciences, 48(1):183–193, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  9. R. E. Cleve. An entangled pair of provers can cheat. Talk at the Workshop on Quantum Computation and Information, California Institute of Technology, November 2000.

    Google Scholar 

  10. D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A, 400:97–117, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  11. U. Feige. On the success probability of two provers in one-round proof systems. In Proceedings of the 6th Annual Structure in Complexity Theory Conference, pages 116–123, 1991.

    Google Scholar 

  12. U. Feige and L. Lovász. Two-prover one-round proof systems: their power and their problems (extended abstract). In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pages 733–744, 1992.

    Google Scholar 

  13. L. J. Fortnow. Complexity-Theoretic Aspects of Interactive Proof Systems. PhD thesis, Department of Mathematics, Massachusetts Institute of Technology, May 1989.

    Google Scholar 

  14. L. J. Fortnow, J. Rompel, and M. Sipser. On the power of multi-prover interactive protocols. Theoretical Computer Science, 134(2):545–557, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  15. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186–208, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  16. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 73–90. JAI Press, 1989.

    Google Scholar 

  17. L. P. Hughston, R. Jozsa, and W. K. Wootters. A complete classification of quantum ensembles having a given density matrix. Physics Letters A, 183:14–18, 1993.

    Article  MathSciNet  Google Scholar 

  18. A. Yu. Kitaev and J. H. Watrous. Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pages 608–617, 2000.

    Google Scholar 

  19. D. Lapidot and A. Shamir. Fully parallelized multi prover protocols for NEXP-time. Journal of Computer and System Sciences, 54(2):215–220, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  20. C. Lund, L. J. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. Journal of the ACM, 39(4):859–868, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  21. C. H. Papadimitriou. Games against nature. Journal of Computer and System Sciences, 31(2):288–301, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  22. A. Shamir. IP = PSPACE. Journal of the ACM, 39(4):869–877, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  23. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484–1509, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  24. A. Uhlmann. Parallel transport and “quantum holonomy” along density operators. Reports on Mathematical Physics, 24:229–240, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  25. J. H. Watrous. PSPACE has constant-round quantum interactive proof systems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 112–119, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Quantum Computation and Information Project,Exploratory Research for Advanced Technology, Japan Science and Technology Corporation, 5-28-3 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    Hirotada Kobayashi & Keiji Matsumoto

  2. Department of Information Science, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    Hirotada Kobayashi

Authors
  1. Hirotada Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keiji Matsumoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Prosenjit Bose  & Pat Morin  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kobayashi, H., Matsumoto, K. (2002). Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

  • Online ISBN: 978-3-540-36136-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation