Skip to main content
Log in

Bisynchronous Games and Factorizable Maps

  • Published:
Annales Henri Poincaré Aims and scope Submit manuscript

Abstract

We introduce a new class of non-local games and corresponding densities, which we call bisynchronous. Bisynchronous games are a subclass of synchronous games and exhibit many interesting symmetries when the algebra of the game is considered. We develop a close connection between these non-local games and the theory of quantum groups which recently surfaced in studies of graph isomorphism games. When the number of inputs is equal to the number of outputs, we prove that a bisynchronous density arises from a trace on the quantum permutation group. Each bisynchronous density gives rise to a completely positive map, and we prove that these maps are factorizable maps.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Atserias, A., Mančinska, L., Roberson, D.E., Šámal, R., Severini, S., Varvitsiotis, A.: Quantum and non-signalling graph isomorphisms. J. Comb. Theory Ser. B 136, 289–328 (2019). ISSN 0095-8956

    Article  MathSciNet  Google Scholar 

  2. Brannan, M., Chirvasitu, A., Eifler, K., Harris, S., Paulsen, V., Su, X., Wasilewski, M.: Bigalois extensions and the graph iso- morphism game, arXiv:1812.11474

  3. Anantharaman-Delaroche, C.: On ergodic theorems for free group actions on noncommutative spaces. Probab. Theory Rel. Fields 135, 520–546 (2006)

    Article  MathSciNet  Google Scholar 

  4. Dykema, K., Paulsen, V.: Synchronous correlation matrices and Connes’ embedding conjecture. J. Mathem. Phys. 57(1), 015214 (2016)

    Article  ADS  MathSciNet  Google Scholar 

  5. Haagerup, U., Musat, M.: Factorization and dilation problems for completely positive maps on von Neumann algebras. Comm. Math. Phys. 303, 555–594 (2011)

    Article  ADS  MathSciNet  Google Scholar 

  6. Haagerup, U., Musat, M.: An asymptotic property of factorizable completely positive maps and the Connes embedding problem. Comm. Math. Phys. 338, 721–752 (2015)

    Article  ADS  MathSciNet  Google Scholar 

  7. Ji, Z., Natarajan, A., Vidick, T., Wright, J., Yuen, H.: MIP*=RE, 2020, arXiv e-prints, arXiv:2001.04383

  8. Helton, J.W., Meyer, K.P., Paulsen, V., Satriano, M.: Algebras, synchronous games and chromatic numbers of graphs. N. Y. J. Mathem. 25, 328–361 (2019)

    MathSciNet  MATH  Google Scholar 

  9. Kribs, D.W.: Quantum channels, wavelets, dilations and representations of \(\cal{O} _ n \). Proc. Edinb. Mathem. Soc. 46(2), 421–433 (2003)

    Article  MathSciNet  Google Scholar 

  10. Kim, S.-J., Paulsen, V., Schafhauser, C.: A synchronous game for binary constraint systems. J. Mathem. Phys. 59, 032201 (2018). https://doi.org/10.1063/1.4996867

    Article  ADS  MathSciNet  MATH  Google Scholar 

  11. Lupini, M., Mančinska, L., Roberson, D.E.: Nonlocal Games and Quantum Permutation Groups , (2017), arXiv:1712.01820

  12. Mančinska, L., Roberson D.E., Šámal R., Sev-erini S., Varvitsiotis A.: Relaxations of graph isomorphism. In: (English summary) 44th International Colloquium on Automata, Languages, and Programming, Art. No. 76, 14 pp. LIPIcs. Leibniz Int. Proc. Inform., 80, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2017)

  13. Musat, M., Rørdam, M.: Non-closure of quantum correlation matrices and factorizable channels that require infinite dimensional ancilla. Commun. Mathem. Phys. (2019). https://doi.org/10.1007/s00220-019-03449-w

    Article  MATH  Google Scholar 

  14. Navascués, M., Guryanova, Y., Hoban, M.J., Acín, A.: Almost quantum correlations. Nat. Commun. 6, 6288 (2015)

    Article  ADS  Google Scholar 

  15. Navascués, M., Pironio, S., Acín, A.: A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations New. J. Phys. 10(7), 073013 (2008)

    Google Scholar 

  16. Ortiz, C., Paulsen, V.: Quantum graph homomorphisms via operator systems. Linear Alg. Appl. 497(15), 23–43 (2016). https://doi.org/10.1016/j.laa2016.02.019

    Article  MathSciNet  MATH  Google Scholar 

  17. Ozawa, N.: About the Connes embedding conjecture. Jpn. J. Mathem. 8(1), 147–183 (2013)

    Article  MathSciNet  Google Scholar 

  18. Paulsen, Vern: Entanglement and non-locality, unpublished lecture notes written by Samuel J. Harris and Satish K. Pandey, Winter (2016). Available at http://www.math.uwaterloo.ca/~vpaulsen/

  19. Paulsen, V.I., Severini, S., Stahlke, D., Todorov, I.G., Winter, A.: Estimating quantum chromatic numbers. J. Funct. Anal. (2016). https://doi.org/10.1016/j.jfa.2016.01.010

    Article  MathSciNet  MATH  Google Scholar 

  20. Slofstra, W.: The set of quantum correlations is not closed. In forum of mathematics. Cambridge University Press, Cambridge (2019)

    MATH  Google Scholar 

Download references

Acknowledgements

This work was done while MR was a Postdoctoral Fellow at the department of Pure Mathematics, University of Waterloo.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mizanur Rahaman.

Additional information

Communicated by Matthias Christandl.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Paulsen, V.I., Rahaman, M. Bisynchronous Games and Factorizable Maps. Ann. Henri Poincaré 22, 593–614 (2021). https://doi.org/10.1007/s00023-020-01003-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00023-020-01003-2

Navigation