Universality of graph homomorphism games and the quantum coloring problem
From MaRDI portal
Publication:6617160
DOI10.1007/s00023-024-01422-5zbMath1548.05238MaRDI QIDQ6617160
Publication date: 10 October 2024
Published in: Annales Henri Poincaré (Search for Journal in Brave)
Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum homomorphisms
- About the Connes embedding conjecture
- Topological dynamical systems associated to \(\text{II}_{1}\)-factors
- Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
- Zero sums of idempotents in Banach algebras
- Algebras, synchronous games, and chromatic numbers of graphs
- Clique-sums, tree-decompositions and compactness
- Bigalois extensions and the graph isomorphism game
- Nonlocal games and quantum permutation groups
- Bisynchronous games and factorizable maps
- Quantum and non-signalling graph isomorphisms
- TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE
- Simple unified form for the major no-hidden-variables theorems
- THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED
- A synchronous game for binary constraint systems
- On the Composition of Zero-Knowledge Proof Systems
- Tsirelson’s problem and an embedding theorem for groups arising from non-local games
- Connes' embedding problem and Tsirelson's problem
- Proposed Experiment to Test Local Hidden-Variable Theories
- Synchronous linear constraint system games
- Estimating quantum chromatic numbers
This page was built for publication: Universality of graph homomorphism games and the quantum coloring problem
