An Explicit Counterexample to Tsirelson's Problem via a Linear System Game
quant-ph, math.FA, math.OA
Submitted: 2026-10-07
Updated: 2026-10-08
Code: https://github.com/leanhnhe091221-boop/explicit-linear-system-game-formali
Project page: https://m-ershov.github.io/Research/EL_n_accepted.pdf
Terminology
Sources
- Perfect Commuting-Operator Strategies for Linear System Games
- Characterization of Binary Constraint System Games
- Tsirelson's problem and Kirchberg's conjecture
- Connes' embedding problem and Tsirelson's problem
- MIP*=RE
- Nonsofic wreath products of residually finite groups
- About the Connes Embedding Conjecture---Algebraic approaches---
- The set of quantum correlations is not closed
- Tsirelson's problem and an embedding theorem for groups arising from non-local games
- An introduction to arithmetic groups
- Entanglement in non-local games and the hyperlinear profile of groups
- Tsirelson's Problem
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity