Generalized Satisfiability Problems via Operator Assignments

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10472)

Abstract

Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer’s framework in which the Fourier transform is used to represent constraints by multilinear polynomials. The polynomial representation of constraints gives rise to a relaxation of the notion of satisfiability in which the values to variables are linear operators on some Hilbert space. For constraints given by a system of linear equations over the two-element field, this relaxation has received considerable attention in the foundations of quantum mechanics, where such constructions as the Mermin-Peres magic square show that there are systems that have no solutions in the Boolean domain, but have solutions via operator assignments on some finite-dimensional Hilbert space. We completely characterize the classes of Boolean relations for which there is a gap between satisfiability in the Boolean domain and the relaxation of satisfiability via operator assignments. To establish our main result, we adapt the notion of primitive-positive definability (pp-definability) to our setting, a notion that has been used extensively in the study of constraint satisfaction. Here, we show that pp-definability gives rise to gadget reductions that preserve satisfiability gaps, and also give several additional applications.

Notes

Acknowledgments

This work was initiated when all three authors were in residence at the Simons Institute for the Theory of Computing. Albert Atserias partly funded by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant agreement ERC-2014-CoG 648276 (AUTAR), and by MINECO through TIN2013-48031-C4-1-P (TASSAT2); Simone Severini partly funded by The Royal Society, Engineering and Physical Sciences Research Council (EPSRC), National Natural Science Foundation of China (NSFC).

References

  1. 1.
    Acín, A., Fritz, T., Leverrier, A., Sainz, A.B.: A combinatorial approach to nonlocality and contextuality. Commun. Math. Phys. 2(334), 533–628 (2015)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bell, J.S.: On the problem of hidden variables in quantum mechanics. Rev. Mod. Phys. 38(3), 447 (1966)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Bodnarchuk, V.G., Kaluzhnin, L.A., Kotov, V.N., Romov, B.A.: Galois theory for post algebras. I. Cybernetics 5(3), 243–252 (1969)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Cleve, R., Liu, L., Slofstra, W.: Perfect commuting-operator strategies for linear system games (2016). arXiv preprint arXiv:1606.02278
  5. 5.
    Cleve, R., Mittal, R.: Characterization of binary constraint system games. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 320–331. Springer, Heidelberg (2014). doi:10.1007/978-3-662-43948-7_27 Google Scholar
  6. 6.
    Folland, G.B.: A Course in Abstract Harmonic Analysis. Studies in Advanced Mathematics. Taylor & Francis, London (1994)MATHGoogle Scholar
  7. 7.
    Folland, G.B.: Real Analysis: Modern Techniques and Their Applications. Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts. Wiley, New York (2013)MATHGoogle Scholar
  8. 8.
    Fritz, T.: Quantum logic is undecidable (2016). arXiv preprint arXiv:1607.05870
  9. 9.
    Geiger, D.: Closed systems of functions and predicates. Pac. J. Math. 27(1), 95–100 (1968)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Halmos, P.R.: Introduction to Hilbert Space and the Theory of Spectral Multiplicity. Benediction Classics, Oxford (2016)MATHGoogle Scholar
  11. 11.
    Ji, Z.: Binary constraint system games and locally commutative reductions (2013). arXiv preprint arXiv:1310.3794
  12. 12.
    Mermin, N.D.: Simple unified form for the major no-hidden-variables theorems. Phys. Rev. Lett 65(27), 3373 (1990)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Mermin, N.D.: Hidden variables and the two theorems of John Bell. Rev. Mod. Phys. 65(3), 803 (1993)MathSciNetCrossRefGoogle Scholar
  14. 14.
    O’Donnell, R.: Analysis of Boolean Functions. Cambridge University Press, Cambridge (2014)CrossRefMATHGoogle Scholar
  15. 15.
    Peres, A.: Incompatible results of quantum measurements. Phys. Lett. A 151(3–4), 107–108 (1990)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Post, E.L.: The Two-Valued Iterative Systems of Mathematical Logic. Annals of Mathematical Studies, vol. 5. Princeton University Press, Princeton (1941)MATHGoogle Scholar
  17. 17.
    Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 1–3 May 1978, pp. 216–226 (1978)Google Scholar
  18. 18.
    Slofstra, W.: Tsirelson’s problem and an embedding theorem for groups arising from non-local games (2016). arXiv preprint arXiv:1606.03140

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.Universitat Politècnica de CatalunyaBarcelonaSpain
  2. 2.University of California Santa CruzSanta CruzUSA
  3. 3.IBM Research - AlmadenSan JoseUSA
  4. 4.University College LondonLondonUK
  5. 5.Shanghai Jiao Tong UniversityShanghaiChina

Personalised recommendations