Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Two prover perfect zero knowledge for MIP* (2404.00926v2)

Published 1 Apr 2024 in quant-ph and cs.CC

Abstract: The recent MIP*=RE theorem of Ji, Natarajan, Vidick, Wright, and Yuen shows that the complexity class MIP* of multiprover proof systems with entangled provers contains all recursively enumerable languages. Prior work of Grilo, Slofstra, and Yuen [FOCS '19] further shows (via a technique called simulatable codes) that every language in MIP* has a perfect zero knowledge (PZK) MIP* protocol. The MIP*=RE theorem uses two-prover one-round proof systems, and hence such systems are complete for MIP*. However, the construction in Grilo, Slofstra, and Yuen uses six provers, and there is no obvious way to get perfect zero knowledge with two provers via simulatable codes. This leads to a natural question: are there two-prover PZK-MIP* protocols for all of MIP*? In this paper, we show that every language in MIP* has a two-prover one-round PZK-MIP* protocol, answering the question in the affirmative. For the proof, we use a new method based on a key consequence of the MIP*=RE theorem, which is that every MIP* protocol can be turned into a family of boolean constraint system (BCS) nonlocal games. This makes it possible to work with MIP* protocols as boolean constraint systems, and in particular allows us to use a variant of a construction due to Dwork, Feige, Kilian, Naor, and Safra [Crypto '92] which gives a classical MIP protocol for 3SAT with perfect zero knowledge. To show quantum soundness of this classical construction, we develop a toolkit for analyzing quantum soundness of reductions between BCS games, which we expect to be useful more broadly. This toolkit also applies to commuting operator strategies, and our argument shows that every language with a commuting operator BCS protocol has a two prover PZK commuting operator protocol.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (46)
  1. D A Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC ’86, page 1–5, New York, NY, USA, 1986. Association for Computing Machinery.
  2. Nondeterministic exponential time has two-prover interactive protocols. In Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pages 16–25 vol.1, 1990.
  3. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC ’88, page 113–131, New York, NY, USA, 1988. Association for Computing Machinery.
  4. Spatial isolation implies zero knowledge even in a quantum world. J. ACM, 69(2), jan 2022.
  5. Consequences and limits of nonlocal strategies. In Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004., pages 236–249, 2004.
  6. Characterization of binary constraint system games. In Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I 41, pages 320–331. Springer, 2014.
  7. Complexity lower bounds for computing the approximately-commuting operator value of nonlocal games to high precision. Computational Complexity Conference (CCC), 2019.
  8. Efficiently stable presentations from error-correcting codes, 2023.
  9. Operator algebraic approach to inverse and stability theorems for amenable groups. Mathematika, 65(1):98–118, aug 2018.
  10. Low communication 2-prover zero-knowledge proofs for NP. In Annual International Cryptology Conference, 1992.
  11. Quantum proof systems for iterated exponential time, and beyond. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, page 473–480, New York, NY, USA, 2019. Association for Computing Machinery.
  12. The membership problem for constant-sized quantum correlations is undecidable. arXiv:2101.11087, 2021.
  13. The knowledge complexity of interactive proof-systems. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC ’85, page 291–304, New York, NY, USA, 1985. Association for Computing Machinery.
  14. Adina Goldberg. Synchronous linear constraint system games. Journal of Mathematical Physics, 62(3), mar 2021.
  15. Perfect zero knowledge for quantum multiprover interactive proofs. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, pages 611–635. IEEE Computer Society, 2019.
  16. Samuel J. Harris. Universality of graph homomorphism games and the quantum coloring problem. arXiv:2305.18116, 2023.
  17. Algebras, synchronous games, and chromatic numbers of graphs. New York J. Math, 25:328–361, 2019.
  18. Oracularization and two-prover one-round interactive proofs against nonlocal strategies. In 2009 24th Annual IEEE Conference on Computational Complexity, pages 217–228, 2009.
  19. A multi-prover interactive proof for nexp sound against entangled provers. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pages 243–252, 2012.
  20. Zhengfeng Ji. Binary constraint system games and locally commutative reductions. arXiv:1310.3794, 2013.
  21. Zhengfeng Ji. Classical verification of quantum proofs. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC ’16, page 885–898, New York, NY, USA, 2016. Association for Computing Machinery.
  22. Zhengfeng Ji. Compression of quantum multi-prover interactive proofs. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, page 289–302, New York, NY, USA, 2017. Association for Computing Machinery.
  23. Quantum soundness of testing tensor codes. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 586–597, Los Alamitos, CA, USA, feb 2022. IEEE Computer Society.
  24. Mip*=re. arXiv:2001.04383, 2022.
  25. Joe Kilian. Uses of randomness in algorithms and protocols. MIT Press, 1990.
  26. Entangled games are hard to approximate. SIAM Journal on Computing, 40(3):848–877, 2011.
  27. A synchronous game for binary constraint systems. Journal of Mathematical Physics, 59(3), mar 2018.
  28. Connes’ embedding conjecture and sums of hermitian squares. Advances in Mathematics, 217(4):1816–1837, 2008.
  29. Junqiao Lin. Almost synchronous correlations in the commuting operator model. ariXiv:2304.01940, 2023.
  30. Amine Marrakchi and Mikael de la Salle. Almost synchronous correlations and tomita-takesaki theory. arXiv:2307.08129, 2023.
  31. N. David Mermin. Simple unified form for the major no-hidden-variables theorems. Phys. Rev. Lett., 65:3373–3376, Dec 1990.
  32. Low-degree testing for quantum states, and a quantum entangled games PCP for QMA. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, oct 2018.
  33. Two-player entangled games are NP-hard. In Proceedings of the 33rd Computational Complexity Conference, CCC ’18, Dagstuhl, DEU, 2018. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
  34. Neexp in mip*. 2019.
  35. Quantum free games. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, page 1603–1616, New York, NY, USA, 2023. Association for Computing Machinery.
  36. Narutaka Ozawa. About the connes embedding conjecture: algebraic approaches. Japanese Journal of Mathematics, 8(1):147–183, 2013.
  37. Connor Paddock. Rounding near-optimal quantum strategies for nonlocal games to strategies using maximally entangled states. arXiv:2203.02525, 2022.
  38. Asher Peres. Incompatible results of quantum measurements. Physics Letters A, 151(3):107–108, 1990.
  39. Satisfiability and boolean constraint system algebras. arXiv:2310.07901, 2023.
  40. A classical leash for a quantum system: Command of quantum systems via rigidity of chsh games. In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS ’13, page 321–322, New York, NY, USA, 2013. Association for Computing Machinery.
  41. Adi Shamir. Ip = pspace. J. ACM, 39(4):869–877, oct 1992.
  42. William Slofstra. The set of quantum correlations is not closed. Forum of Mathematics, Pi, 7(E1), 2019.
  43. Thomas Vidick. Three-player entangled xor games are np-hard to approximate. SIAM Journal on Computing, 45(3):1007–1063, 2016.
  44. Thomas Vidick. Erratum: Three-player entangled XOR games are NP-hard to approximate. SIAM Journal on Computing, 49(6):1423–1427, 2020.
  45. Thomas Vidick. Almost synchronous quantum correlations. Journal of Mathematical Physics, 63(2), feb 2022.
  46. Henry Yuen. A parallel repetition theorem for all entangled games. arXiv:1604.04340, 2016.
Citations (4)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now