Abstract
We study synchronous values of games, especially synchronous games. It is known that a synchronous game has a perfect strategy if and only if it has a perfect synchronous strategy. However, we give examples of synchronous games, in particular graph colouring games, with synchronous value that is strictly smaller than their ordinary value. Thus, the optimal strategy for a synchronous game need not be synchronous. We derive a formula for the synchronous value of an XOR game as an optimization problem over a spectrahedron involving a matrix related to the cost matrix. We give an example of a game such that the synchronous value of repeated products of the game is strictly increasing. We show that the synchronous quantum bias of the XOR of two XOR games is not multiplicative. Finally, we derive geometric and algebraic conditions that a set of projections that yields the synchronous value of a game must satisfy.
Similar content being viewed by others
Notes
Some authors refer to conditional probability densities as correlations.
This can be seen directly by checking that \(\begin{pmatrix} 1&\omega _n^j&\dots&\omega _n^{j(n-1)} \end{pmatrix}^T\) is an eigenvector for each \(j \in \{0,1,\dots , n-1\}\).
References
Alhajjar, E., Russell, T.: Maximally entangled correlation sets. Houston J. Math. 46(2), 357–376 (2020)
Alizadeh, F., Haeberly, J.A., Overton, M.L.: Complementarity and nondegeneracy in semidefinite programming. Semidefinite programming. Math. Program. 77(2 Ser. B), 111–128 (1997)
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998)
Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. J. ACM 45(1), 70–122 (1998)
Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Comput. Complex. 1, 3–40 (1991)
Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-prover interactive proofs: how to remove intractability assumptions. In: Proceedings of the ACM Symposium on Theory of Computing, vol. 20, pp. 113–131 (1988)
Bavarian, M., Vidick, T., Yuen, H.: Hardness amplification for entangled games via anchoring. In: Proceedings of the ACM Symposium on Theory of Computing, vol. 49, pp. 303–316 (2017)
Coladangelo, A.: A two-player dimension witness based on embezzlement, and an elementary proof of the non-closure of the set of quantum correlations. Quantum 4, 282–300 (2020)
Clauser, J.F., Horne, M.A., Shimony, A., Holt, R.A.: Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett. 23(15), 880–884 (1969)
Cleve, R., Hoyer, P., Toner, B., Watrous, J.: Consequences and limits of nonlocal strategies. In: Proceedings. 19th IEEE Annual Conference on Compuational Complexity, 2004, pp. 236–249 (2004)
Cleve, R., Liu, L., Slofstra, W.: Perfect commuting-operator strategies for linear system games. J. Math. Phys. 58(1), 1089–7658 (2017)
Cleve, R., Mittal, R.: Characterization of binary constraint system games. In; International Colloquium on Automata, Languages and Programming (2014)
Cuntz, J., Pedersen, G.: Equivalence and traces on C*-algebras. J. Funct. Anal. 33, 135–164 (1979)
Coladangelo, A., Stark, J.: Unconditional separation of finite and infinite-dimensional quantum correlations. arXiv:1708.06522 (2018)
Cleve, R., Slofstra, W., Unger, F., Upadhyay, S.: Perfect parallel repetition theorem for quantum XOR proof systems. Comput. Complex. 17(2), 282–299 (2008)
Dykema, K., Paulsen, V.I., Prakash, J.: Non-closure of the set of quantum correlations via graphs. Commun. Math. Phys. 365, 1125–1142 (2019)
Dinur, I., Steurer, D., Vidick, T.: A parallel repetition theorem for entangled projection games. Comput. Complex. 24, 201–254 (2015)
Feige, U., Goldwasser, S., Lovasz, L., Safra, S., Szeged, M.: Interactive proofs and the hardness of approximating cliques. J. ACM 43(2), 268–292 (1996)
Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edn. Cambridge University Press, Cambridge (2012)
Helton, W., Meyer, K.P., Paulsen, V.I., Satriano, M.: Algebras, synchronous games and chromatic numbers of graphs, New York. J. Math. 25, 328–361 (2019)
Junge, M., Navascues, M., Palazuelos, C., Perez-Garcia, D., Scholz, V.B., Werner, R.F.: Connes’ embedding problem and Tsirelson’s problem. J. Math. Phys. 52, 012102 (2011)
Ji, Z., Natarajan, A., Vidick, T., Wright, J., Yuen, H.: MIP*=RE. arXiv:2001.04383 (2020)
Jain, R., Pereszlényi, A., Yao, P.: A parallel repetition theorem for entangled two-player one-round games under product distributions. In: Proceedings of the IEEE Conference on Computational Complexity, vol. 29, pp. 209–216 (2014)
Karp, Richard M.: Reducibility among combinatorial problems. In: Miller, R.E., Thacher, J.W. (eds.) Complexity of Computer Computation, pp. 85–103. Plenum Press, New York (1972)
Kim, S.J., Paulsen, V.I., Schafhauser, C.P.: A synchronous game for binary constraint systems. J. Math. Phys. 59, 032201 (2018)
Kruglyak, S.A., Rabanovich, V.I., Samolenko, Yu.S.: On sums of projections. Funct. Anal. Appl. 36(3), 182–195 (2002)
Laurent, M.: Semidefinite relaxations for Max-Cut. In: Grötschel, M. (ed.) The Sharpest Cut: The Impact of Manfred Padberg and His Work. MPS-SIAM Series in Optimization, vol. 4, pp. 257–290. Cambridge University Press, Cambridge (2004)
Mermin, N.D.: Simple unified form for the major no-hidden-variables theorems. Phys. Rev. Lett. 65(27), 3373 (1990)
Mancinska, L., Paulsen, V.I., Todorov, I.G., Winter, A.M.: Products of synchronous games, preprint
Musat, M., Rørdam, M.: Non-closure of quantum correlation matrices and factorizable channels that require infinite dimensional ancilla (with an appendix by Narutaka Ozawa). Commun. Math. Phys. 375(3), 1761–1776 (2019)
Palazuelos, C., Vidick, T.: Survey on nonlocal games and operator space theory. J. Math. Phys. 57, 05220 (2016)
Paulsen, V.I.: Completely Bounded Maps and Operator Algebras, vol. 78. Cambridge University Press, Cambridge (2002)
Paulsen, V.I.: Entanglement and Non-locality, online course notes
Paulsen, V.I., Severini, S., Stahlke, D., Todorov, I.G., Winter, A.: Estimating quantum chromatic numbers. J. Funct. Anal. 270(6), 2188–2222 (2016)
Paulsen, V.I., Todorov, I.G.: Quantum chromatic numbers via operator systems. Q. J. Math. 66(2), 677–692 (2015)
Regev, O., Vidick, T.: Quantum XOR games. ACM Trans. Comput. Theory 7(15), 1–43 (2015)
Roberson, D.E.: Variations on a Theme: Graph Homomorphisms. Ph.D. Thesis, University of Waterloo (2013)
Slater, M.: Lagrange Multipliers Revisited, Cowles Commission Discussion Paper No. 403 (1950)
Slofstra, W.: The set of quantum correlations is not closed. Forum Math. 7, e1 (2019)
Slofstra, W.: Tsirelson’s problem and an embedding theorem for groups arising from non-local games. J. Am. Math. Soc. 33(1), 1–56 (2019)
Tsirelson, B.: Some results and problems on quantum bell-type inequalities. Hadron. J. Suppl. 8(4), 329–345 (1993)
Acknowledgements
H.M. acknowledges the support of the Natural Sciences and Engineering Research Council of Canada (NSERC). V.I.P. was supported by NSERC Grant 03784. All the authors wish to thank the American Institute of Mathematics (AIM) where this research originated.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by David Pérez-García.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Helton, J.W., Mousavi, H., Nezhadi, S.S. et al. Synchronous Values of Games. Ann. Henri Poincaré 25, 4357–4397 (2024). https://doi.org/10.1007/s00023-024-01426-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00023-024-01426-1