Bisynchronous games and factorizable maps

DOI10.1007/S00023-020-01003-2MaRDI QIDQ2223561zbMATH OpenOpenAlexFDO

Authors M. Rahaman, Vern I. Paulsen

Publication date 29 January 2021

Published in Annales Henri Poincaré (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1908.03842

zbMATH Keywords

bisynchronous gamesfactorizable mapsgraph isomorphism games

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) 2-person games (91A05) Games involving graphs (91A43)

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.

Recommendations

• Synchronicity for quantum non-local games
• Quantum semigroups from synchronous games
• A synchronous game for binary constraint systems
• Synchronous linear constraint system games
• Perfect strategies for non-local games

Cites work

• A synchronous game for binary constraint systems
• About the Connes embedding conjecture
• Algebras, synchronous games, and chromatic numbers of graphs
• An asymptotic property of factorizable completely positive maps and the Connes embedding problem
• Bigalois extensions and the graph isomorphism game
• Estimating quantum chromatic numbers
• Factorization and dilation problems for completely positive maps on von Neumann algebras
• Non-closure of quantum correlation matrices and factorizable channels that require infinite dimensional ancilla (With an appendix by Narutaka Ozawa)
• Nonlocal games and quantum permutation groups
• On ergodic theorems for free group actions on noncommutative spaces
• Quantum and non-signalling graph isomorphisms
• QUANTUM CHANNELS, WAVELETS, DILATIONS AND REPRESENTATIONS OF $\mathcal{O}_{n}$
• Quantum graph homomorphisms via operator systems
• Relaxations of graph isomorphism
• Synchronous correlation matrices and Connes' embedding conjecture
• The set of quantum correlations is not closed

Cited in

(12)

• Positively factorizable maps
• Quantum semigroups from synchronous games
• The quantum-to-classical graph homomorphism game
• Quantum symmetries of quantum metric spaces and non-local games
• Quantum hypergraph homomorphisms and non-local games
• Transitive nonlocal games
• Universality of graph homomorphism games and the quantum coloring problem
• Matrix extreme points and free extreme points of free spectrahedra
• Free extreme points span generalized free spectrahedra given by compact coefficients
• Absolutely dilatable bimodule maps
• Quantum automorphism groups of lexicographic products of graphs
• Noncommutative harmonic analysis and quantum information. Abstracts from the workshop held January 25--30, 2026

This page was built for publication: Bisynchronous games and factorizable maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223561)