Document Open Access Logo

A Quantum Unique Games Conjecture

Authors Hamoon Mousavi, Taro Spirig

PDF
Thumbnail PDF

File

LIPIcs.ITCS.2025.76.pdf
  • Filesize: 0.72 MB
  • 16 pages

Document Identifiers

Author Details

Hamoon Mousavi
  • Simons Institute for Theoretical Computer Science, University of California, Berkeley, CA, USA
Taro Spirig
  • QMATH, Department of Mathematical Sciences, University of Copenhagen, Denmark

Funding

  • Mousavi, Hamoon: Supported by a Simons-CIQC postdoctoral fellowship through NSF QLCI Grant No. 2016245.
  • Spirig, Taro: Supported by the European Union under the Grant Agreement No 101078107, QInteract and VILLUM FONDEN via Villum Young Investigator grant (No 37532) and the QMATH Centre of Excellence (Grant No 10059).

Acknowledgements

We thank Henry Yuen for valuable discussions on the topics explored in this paper. We thank Eric Culf and Michael Chapman for helpful discussions.

Cite As Get BibTex

Hamoon Mousavi and Taro Spirig. A Quantum Unique Games Conjecture. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 325, pp. 76:1-76:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ITCS.2025.76

Abstract

After the NP-hardness of computational problems such as 3SAT and MaxCut was established, a natural next step was to explore whether these problems remain hard to approximate. While the quantum nonlocal games extensions of some of these problems are known to be hard - indeed undecidable - their inapproximability remains largely unresolved. In this work, we introduce definitions for the quantum extensions of Label-Cover and Unique-Label-Cover. We show that these problems play a similarly crucial role in studying the inapproximability of quantum constraint satisfaction problems as they do in the classical setting.

Subject Classification

ACM Subject Classification
  • Theory of computation → Quantum complexity theory
  • Theory of computation → Quantum complexity theory
Keywords
  • hardness of approximation
  • quantum computing
  • noncommutative constraint satisfaction problems
  • Fourier analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Sanjeev Arora, László Babai, Jacques Stern, and Z Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. Journal of Computer and System Sciences, 54(2):317-331, 1997. URL: https://doi.org/10.1006/jcss.1997.1472.
  2. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, May 1998. URL: https://doi.org/10.1145/278298.278306.
  3. Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: A new characterization of NP. J. ACM, 45(1):70-122, January 1998. URL: https://doi.org/10.1145/273865.273901.
  4. László Babai, Lance Fortnow, Leonid A. Levin, and Mario Szegedy. Checking computations in polylogarithmic time. In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC '91, pages 21-32, New York, NY, USA, 1991. Association for Computing Machinery. URL: https://doi.org/10.1145/103418.103428.
  5. László Babai, Lance Fortnow, and Carsten Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, March 1991. URL: https://doi.org/10.1007/BF01200056.
  6. John Stewart Bell. On the Einstein Podolsky Rosen paradox. Physics, 1(3):195-200, 1964. URL: https://doi.org/10.1103/PhysicsPhysiqueFizika.1.195.
  7. Mihir Bellare, Oded Goldreich, and Madhu Sudan. Free bits, PCPs and non-approximability-towards tight results. In Proceedings of IEEE 36th Annual Foundations of Computer Science, pages 422-431, 1995. URL: https://doi.org/10.1109/SFCS.1995.492573.
  8. Michael Ben-Or, Shafi Goldwasser, Joe Kilian, and Avi Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC '88, pages 113-131, New York, NY, USA, 1988. ACM. URL: https://doi.org/10.1145/62212.62223.
  9. John F. Clauser, Michael A. Horne, Abner Shimony, and Richard A. Holt. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett., 23:880-884, October 1969. URL: https://doi.org/10.1103/PhysRevLett.23.880.
  10. Richard Cleve, Peter Hoyer, Benjamin Toner, and John Watrous. Consequences and limits of nonlocal strategies. In Proceedings of the 19th IEEE Annual Conference on Computational Complexity, CCC '04, pages 236-249, Washington, DC, USA, 2004. IEEE Computer Society. URL: https://doi.org/10.1109/CCC.2004.9.
  11. Richard Cleve and Rajat Mittal. Characterization of binary constraint system games. In International Colloquium on Automata, Languages, and Programming (ICALP) 2012, pages 320-331, 2012. URL: https://doi.org/10.1007/978-3-662-43948-7_27.
  12. Eric Culf, Hamoon Mousavi, and Taro Spirig. Approximation algorithms for noncommutative constraint satisfaction problems, 2023. URL: https://doi.org/10.48550/arXiv.2312.16765.
  13. Irit Dinur. The pcp theorem by gap amplification. J. ACM, 54(3):12-es, June 2007. URL: https://doi.org/10.1145/1236457.1236459.
  14. Irit Dinur, David Steurer, and Thomas Vidick. A parallel repetition theorem for entangled projection games. In 2014 IEEE 29th Conference on Computational Complexity (CCC), pages 197-208, 2014. URL: https://doi.org/10.1109/CCC.2014.28.
  15. Uriel Feige, Shafi Goldwasser, Laszlo Lovász, Shmuel Safra, and Mario Szegedy. Interactive proofs and the hardness of approximating cliques. J. ACM, 43(2):268-292, March 1996. URL: https://doi.org/10.1145/226643.226652.
  16. Uriel Feige and Joe Kilian. Two-prover protocols - low error at affordable rates. SIAM Journal on Computing, 30(1):324-346, 2000. URL: https://doi.org/10.1137/S0097539797325375.
  17. Uriel Feige and László 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, STOC '92, pages 733-744, New York, NY, USA, 1992. Association for Computing Machinery. URL: https://doi.org/10.1145/129712.129783.
  18. Uriel Feige and Gideon Schechtman. On the optimality of the random hyperplane rounding technique for max cut. Random Structures & Algorithms, 20(3):403-440, 2002. URL: https://doi.org/10.1002/rsa.10036.
  19. Lance Fortnow, John Rompel, and Michael Sipser. On the power of multi-prover interactive protocols. Theoretical Computer Science, 134(2):545-557, 1994. URL: https://doi.org/10.1016/0304-3975(94)90251-8.
  20. Tobias Fritz. Tsirelson’s problem and Kirchberg’s conjecture. Reviews in Mathematical Physics, 24(05):1250012, 2012. URL: https://doi.org/10.1142/S0129055X12500122.
  21. Michel X. Goemans and David P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42(6):1115-1145, November 1995. URL: https://doi.org/10.1145/227683.227684.
  22. Samuel J. Harris. Universality of Graph Homomorphism Games and the Quantum Coloring Problem. Annales Henri Poincare, 25(10):4321-4356, 2024. URL: https://doi.org/10.1007/s00023-024-01422-5.
  23. John William Helton, Kyle P Meyer, Vern I Paulsen, and Matthew Satriano. Algebras, synchronous games and chromatic numbers of graphs. arXiv preprint, 2017. URL: https://doi.org/10.48550/arXiv.1703.00960.
  24. Johan Håstad. Clique is hard to approximate within n^1-ε. In Proceedings of 37th Conference on Foundations of Computer Science, pages 627-636, 1996. URL: https://doi.org/10.1109/SFCS.1996.548522.
  25. Johan Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859, July 2001. URL: https://doi.org/10.1145/502090.502098.
  26. Yeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson, and John Wright. Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell’s inequality, pages 1319-1384. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023. URL: https://doi.org/10.1137/1.9781611977554.ch48.
  27. Tsuyoshi Ito, Hirotada Kobayashi, and Keiji Matsumoto. Oracularization and two-prover one-round interactive proofs against nonlocal strategies. 2009 24th Annual IEEE Conference on Computational Complexity, pages 217-228, 2008. URL: https://doi.org/10.1109/CCC.2009.22.
  28. Zhengfeng Ji. Binary constraint system games and locally commutative reductions, 2013. URL: https://doi.org/10.48550/arXiv.1310.3794.
  29. Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen. MIP^* = RE. Commun. ACM, 64(11):131-138, October 2021. URL: https://doi.org/10.1145/3485628.
  30. Marius Junge, Miguel Navascues, Carlos Palazuelos, David Perez-Garcia, Volkher B. Scholz, and Reinhard F. Werner. Connes' embedding problem and tsirelson’s problem. Journal of Mathematical Physics, 52(1):012102, 2011. URL: https://doi.org/10.1063/1.3514538.
  31. Julia Kempe, Oded Regev, and Ben Toner. Unique games with entangled provers are easy. SIAM Journal on Computing, 39(7):3207-3229, 2010. URL: https://doi.org/10.1137/090772885.
  32. Subhash Khot. On the power of unique 2-prover 1-round games. In Proceedings 17th IEEE Annual Conference on Computational Complexity, pages 25-, 2002. URL: https://doi.org/10.1109/CCC.2002.1004334.
  33. Subhash Khot. On the unique games conjecture. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pages 3-, 2005. URL: https://doi.org/10.1109/SFCS.2005.61.
  34. Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O’Donnell. Optimal inapproximability results for MAX‐CUT and other 2‐variable CSPs? SIAM Journal on Computing, 37(1):319-357, 2007. URL: https://doi.org/10.1137/S0097539705447372.
  35. Se-Jin Kim, Vern Paulsen, and Christopher Schafhauser. A synchronous game for binary constraint systems. Journal of Mathematical Physics, 59(3):032201, 2018. URL: https://doi.org/10.1063/1.4996867.
  36. Elchanan Mossel, Ryan O'Donnell, and Krzysztof Oleszkiewicz. Noise stability of functions with low influences: Invariance and optimality. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pages 21-30, 2005. URL: https://doi.org/10.1109/SFCS.2005.53.
  37. Hamoon Mousavi, Seyed Sajjad Nezhadi, and Henry Yuen. Nonlocal games, compression theorems, and the arithmetical hierarchy. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, pages 1-11, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3519935.3519949.
  38. Hamoon Mousavi and Taro Spirig. A quantum unique games conjecture, 2024. URL: https://doi.org/10.48550/arXiv.2409.20028.
  39. Anand Natarajan and Chinmay Nirkhe. The status of the quantum pcp conjecture (games version), 2024. URL: https://doi.org/10.48550/arXiv.2403.13084.
  40. Anand Natarajan and John Wright. NEEXP ⊆ MIP^*. In IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 510-518, 2019. URL: https://doi.org/10.48550/arXiv.1904.05870.
  41. Ryan O'Donnell and Henry Yuen. Private communication, 2024. Google Scholar
  42. Narutaka Ozawa. About the Connes embedding conjecture: Algebraic approaches. Jpn. J. Math., 8:147-183, 2013. URL: https://doi.org/10.1007/s11537-013-1280-5.
  43. Vern I Paulsen, Simone Severini, Daniel Stahlke, Ivan G Todorov, and Andreas Winter. Estimating quantum chromatic numbers. Journal of Functional Analysis, 270(6):2188-2222, 2016. URL: https://doi.org/10.1016/j.jfa.2016.01.010.
  44. Prasad Raghavendra. Optimal algorithms and inapproximability results for every CSP? In Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC '08, pages 245-254, New York, NY, USA, 2008. Association for Computing Machinery. URL: https://doi.org/10.1145/1374376.1374414.
  45. Ran Raz. A parallel repetition theorem. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC '95, pages 447-456, New York, NY, USA, 1995. Association for Computing Machinery. URL: https://doi.org/10.1145/225058.225181.
  46. Volkher B Scholz and Reinhard F Werner. Tsirelson’s problem, 2008. URL: https://doi.org/10.48550/arXiv.0812.4305.
  47. William Slofstra. The set of quantum correlations is not closed. In Forum of Mathematics, Pi, volume 7. Cambridge University Press, 2019. URL: https://doi.org/10.1017/fmp.2018.3.
  48. William Slofstra. Tsirelson’s problem and an embedding theorem for groups arising from non-local games. Journal of the American Mathematical Society, 2019. URL: https://doi.org/10.1090/jams/929.
  49. Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, and David P. Williamson. Gadgets, approximation, and linear programming. SIAM Journal on Computing, 29(6):2074-2097, 2000. URL: https://doi.org/10.1137/S0097539797328847.
  50. Boris Tsirelson. Quantum analogues of the Bell inequalities. the case of two spatially separated domains. Journal of Soviet Mathematics, 36(4):557-570, 1987. URL: https://doi.org/doi:10.1007/BF01663472.
  51. Boris Tsirelson. Some results and problems on quantum Bell-type inequalities. Hadronis Journal Supplement, 8:320-331, 1993. URL: https://www.tau.ac.il/~tsirel/download/hadron.pdf.
  52. John Watrous. The Theory of Quantum Information. Cambridge University Press, 2018. URL: https://doi.org/10.1017/9781316848142.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact