Arkhipov's theorem, graph minors, and linear system nonlocal games
From MaRDI portal
Publication:6088391
DOI10.5802/alco.292arXiv2205.04645OpenAlexW4386245491MaRDI QIDQ6088391
Vincent F. Russo, Connor Paddock, Turner Silverthorne, William Slofstra
Publication date: 14 December 2023
Published in: Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.04645
Games involving graphs (91A43) Graph minors (05C83) Quantum coherence, entanglement, quantum correlations (81P40) Games on graphs (graph-theoretic aspects) (05C57) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Contextuality in quantum theory (81P13)
Cites Work
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- The geometry of the word problem for finitely generated groups.
- Growth constants of minor-closed classes of graphs
- Graph minor hierarchies
- Graph minors. XIII: The disjoint paths problem
- Perfect commuting-operator strategies for linear system games
- On the parity of planar covers
- Efficient Planarity Testing
- ON DISJOINT CYCLES
- Simple unified form for the major no-hidden-variables theorems
- Inverse and stability theorems for approximate representations of finite groups
- THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED
- Term Rewriting and All That
- Two simple proofs of the Kochen-Specker theorem
- On Some Lemmas in the Theory of Groups
- Robust self-testing of the singlet
- A quantum linearity test for robustly verifying entanglement
- Characterization of Binary Constraint System Games
- Tsirelson’s problem and an embedding theorem for groups arising from non-local games
This page was built for publication: Arkhipov's theorem, graph minors, and linear system nonlocal games