Adina Goldberg, University of Waterloo
Synchronous Quantum Games
We recast nonlocal games using string diagrams, allowing for a natural extension to quantum games (with bipartite question and answer states). We define strategies in this setting and show that synchronous quantum games require synchronized players to win. We give examples of some quantum games on quantum graphs and see that these require quantum homo/isomorphisms to win. (The talk is based on a preprint ``Quantum games and synchronicity'' (https://arxiv.org/abs/2408.15444). This work is inspired by Musto, Reutter, and Verdon's paper ``A compositional approach to quantum functions'', and relies heavily on the reference ``Categories for Quantum Theory'' by Heunen and Vicary for string diagrams in quantum information.)
MC 5417