\(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem

DOI10.4171/icm2022/71OpenAlexW4389774904MaRDI QIDQ6118161

Thomas Vidick

Publication date: 20 March 2024

Published in: International Congress of Mathematicians (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/icm2022/71

zbMATH Keywords

entanglementTsirelson's problemquantum interactive proofs

Mathematics Subject Classification ID

General theory of von Neumann algebras (46L10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum graph homomorphisms via operator systems
• About the Connes embedding conjecture
• Non-deterministic exponential time has two-prover interactive protocols
• On the quantum chromatic number of a graph
• The classification problem for von Neumann factors
• On \(\varepsilon\)-representations
• Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
• Self-testing/correcting with applications to numerical problems
• On non-semisplit extensions, tensor products and exactness of group \(C^*\)-algebras
• The analogues of entropy and of Fisher's information measure in free probability theory. II
• The Morita theory of quantum graph isomorphisms
• Non-closure of the set of quantum correlations via graphs
• Hyperlinearity, essentially free actions and \(L^2\)-invariants. The sofic property
• On Ulam stability
• Quantum and non-signalling graph isomorphisms
• Matrices of unitary moments
• TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE
• OPERATOR ALGEBRAIC APPROACH TO INVERSE AND STABILITY THEOREMS FOR AMENABLE GROUPS
• FREE ENTROPY
• Proof verification and the hardness of approximation problems
• Extensions of Lipschitz mappings into a Hilbert space
• Probabilistic checking of proofs
• Designing programs that check their work
• 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
• A synchronous game for binary constraint systems
• Compression of quantum multi-prover interactive proofs
• A quantum linearity test for robustly verifying entanglement
• Characterization of Binary Constraint System Games
• From Operator Algebras to Complexity Theory and Back
• Quantum proof systems for iterated exponential time, and beyond
• Connes' embedding problem and Tsirelson's problem
• QUANTUM CHROMATIC NUMBERS VIA OPERATOR SYSTEMS
• Kochen–Specker Sets and the Rank-1 Quantum Chromatic Number
• COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM
• Synchronous linear constraint system games
• Estimating quantum chromatic numbers

This page was built for publication: \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem