Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 74 tok/s
Gemini 2.5 Pro 37 tok/s Pro
GPT-5 Medium 36 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 104 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 448 tok/s Pro
Claude Sonnet 4.5 32 tok/s Pro
2000 character limit reached

RE-completeness of entangled constraint satisfaction problems (2410.21223v2)

Published 28 Oct 2024 in quant-ph

Abstract: Constraint satisfaction problems (CSPs) are a natural class of decision problems where one must decide whether there is an assignment to variables that satisfies a given formula. Schaefer's dichotomy theorem, and its extension to all alphabets due to Bulatov and Zhuk, shows that CSP languages are either efficiently decidable, or NP-complete. It is possible to extend CSP languages to quantum assignments using the formalism of nonlocal games. Due to the equality of complexity classes MIP$\ast=$ RE, general succinctly-presented entangled CSPs are RE-complete. In this work, we show that a wide range of NP-complete CSPs become RE-complete in this setting, including all boolean CSPs, such as 3SAT, as well as $3$-colouring. This also implies that these CSP languages remain undecidable even when not succinctly presented. To show this, we work in the weighted algebra framework introduced by Mastel and Slofstra, where synchronous strategies for a nonlocal game are represented by tracial states on an algebra. Along the way, we improve the subdivision technique in order to be able to separate constraints in the CSP while preserving constant soundness, construct commutativity gadgets for all boolean CSPs, and show a variety of relations between the different ways of presenting CSPs as games.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. Non-deterministic exponential time has two-prover interactive protocols. Computational complexity 1 (1991), 3–40.
  2. Bell, J. S. On the Einstein Podolsky Rosen paradox. Physics Physique Fizika 1 (Nov 1964), 195–200.
  3. Blackadar, B. Operator algebras: theory of C*-algebras and von Neumann algebras, vol. 122. Springer Berlin, Heidelberg, 2006.
  4. Bulatov, A. A. A dichotomy theorem for nonuniform CSPs. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (2017), IEEE, pp. 319–330.
  5. Efficiently stable presentations from error-correcting codes. arXiv preprint arXiv:2311.04681 (2023).
  6. Consequences and limits of nonlocal strategies. In Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004. (2004), pp. 236–249.
  7. Approximation algorithms for noncommutative csps. arXiv:2312.16765 (2024).
  8. The computational advantage of MIP* vanishes in the presence of noise. arXiv preprint arXiv:2312.04360 (2023).
  9. Low communication 2-prover zero-knowledge proofs for NP. In Annual International Cryptology Conference (1992).
  10. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 47 (May 1935), 777–780.
  11. Quantum proof systems for iterated exponential time, and beyond. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (New York, NY, USA, 2019), STOC 2019, Association for Computing Machinery, p. 473–480.
  12. Håstad, J. Some optimal inapproximability results. Journal of the ACM (JACM) 48, 4 (2001), 798–859.
  13. Algebras, synchronous games, and chromatic numbers of graphs. New York J. Math 25 (2019), 328–361.
  14. Oracularization and two-prover one-round interactive proofs against nonlocal strategies. In 2009 24th Annual IEEE Conference on Computational Complexity (2009), pp. 217–228.
  15. A multi-prover interactive proof for NEXP sound against entangled provers. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (2012), pp. 243–252.
  16. Ji, Z. Classical verification of quantum proofs. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (New York, NY, USA, 2016), STOC ’16, Association for Computing Machinery, p. 885–898.
  17. Ji, Z. Compression of quantum multi-prover interactive proofs. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (New York, NY, USA, 2017), STOC 2017, Association for Computing Machinery, p. 289–302.
  18. MIP*=RE. arXiv:2001.04383 (2022).
  19. Entangled games are hard to approximate. SIAM Journal on Computing 40, 3 (2011), 848–877.
  20. Khot, S. On the power of unique 2-prover 1-round games. In Proceedings 17th IEEE Annual Conference on Computational Complexity (2002), pp. 25–.
  21. A synchronous game for binary constraint systems. Journal of Mathematical Physics 59, 3 (mar 2018).
  22. Lin, J. Tracial embeddable strategies: Lifting MIP* tricks to MIPco, 2024.
  23. Almost synchronous correlations and tomita-takesaki theory. arXiv preprint arXiv:2307.08129 (2023).
  24. Two prover perfect zero knowledge for MIP*. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing (New York, NY, USA, 2024), STOC 2024, Association for Computing Machinery, p. 991–1002.
  25. Mermin, N. D. Simple unified form for the major no-hidden-variables theorems. Phys. Rev. Lett. 65 (Dec 1990), 3373–3376.
  26. A quantum unique games conjecture, 2024.
  27. The status of the quantum pcp conjecture (games version). arXiv preprint arXiv:2403.13084 (2024).
  28. 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) (oct 2018), IEEE.
  29. Two-player entangled games are NP-hard. In Proceedings of the 33rd Computational Complexity Conference (Dagstuhl, DEU, 2018), CCC ’18, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
  30. NEEXP is contained in MIP*. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) (Los Alamitos, CA, USA, nov 2019), IEEE Computer Society, pp. 510–518.
  31. Ozawa, N. About the Connes embedding conjecture: algebraic approaches. Japanese Journal of Mathematics 8, 1 (2013), 147–183.
  32. Paddock, C. Rounding near-optimal quantum strategies for nonlocal games to strategies using maximally entangled states. arXiv:2203.02525 (2022).
  33. Satisfiability problems and algebras of boolean constraint system games. arXiv preprint arXiv:2310.07901 (2023).
  34. Peres, A. Incompatible results of quantum measurements. Physics Letters A 151, 3 (1990), 107–108.
  35. Raghavendra, P. Optimal algorithms and inapproximability results for every CSP? In Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (New York, NY, USA, 2008), STOC ’08, Association for Computing Machinery, p. 245–254.
  36. Schmüdgen, K. An Invitation to Unbounded Representations of *-Algebras on Hilbert Space. Springer International Publishing, 2020.
  37. Vidick, T. CS286 Seminar in Computer Science: Around the quantum PCP conjecture, 2014. URL: users.cms.caltech.edu/~vidick/teaching/286_qPCP/. Last visited on 2024/10/04.
  38. Vidick, T. Three-player entangled xor games are np-hard to approximate. SIAM Journal on Computing 45, 3 (2016), 1007–1063.
  39. Vidick, T. Erratum: Three-player entangled XOR games are NP-hard to approximate. SIAM Journal on Computing 49, 6 (2020), 1423–1427.
  40. Vidick, T. Almost synchronous quantum correlations. Journal of Mathematical Physics 63, 2 (Feb 2022).
  41. Zhuk, D. A proof of CSP dichotomy conjecture. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (2017), IEEE, pp. 331–342.

Summary

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

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

Continue Learning

We haven't generated follow-up questions for this paper yet.

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

Authors (2)

  1. Eric Culf
  2. Kieran Mastel
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 post and received 0 likes.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up to View