Bigalois extensions and the graph isomorphism game
Abstract
We study the graph isomorphism game that arises in quantum information theory from the perspective of bigalois extensions of compact quantum groups. We show that every algebraic quantum isomorphism between a pair of (quantum) graphs and arises as a quotient of a certain measured bigalois extension for the quantum automorphism groups and of the graphs and . In particular, this implies that the quantum groups and are monoidally equivalent. We also establish a converse to this result, which says that every compact quantum group monoidally equivalent to is of the form for a suitably chosen quantum graph that is quantum isomorphic to . As an application of these results, we deduce that the -algebraic, C-algebraic, and quantum commuting (qc) notions of a quantum isomorphism between classical graphs and all coincide. Using the notion of equivalence for non-local games, we deduce the same result for other synchronous non-local games, including the synBCS game and certain related graph homomorphism games.
Cite
@article{arxiv.1812.11474,
title = {Bigalois extensions and the graph isomorphism game},
author = {Michael Brannan and Alexandru Chirvasitu and Kari Eifler and Samuel Harris and Vern Paulsen and Xiaoyu Su and Mateusz Wasilewski},
journal= {arXiv preprint arXiv:1812.11474},
year = {2020}
}
Comments
33 pages