The set of quantum correlations is not closed
From MaRDI portal
Abstract: We construct a linear system non-local game which can be played perfectly using a limit of finite-dimensional quantum strategies, but which cannot be played perfectly on any finite-dimensional Hilbert space, or even with any tensor-product strategy. In particular, this shows that the set of (tensor-product) quantum correlations is not closed. The constructed non-local game provides another counterexample to the "middle" Tsirelson problem, with a shorter proof than our previous paper (though at the loss of the universal embedding theorem). We also show that it is undecidable to determine if a linear system game can be played perfectly with a finite-dimensional strategy, or a limit of finite-dimensional quantum strategies.
Recommendations
- A synchronous game for binary constraint systems
- Perfect commuting-operator strategies for linear system games
- Non-closure of the set of quantum correlations via graphs
- Tsirelson's problem and an embedding theorem for groups arising from non-local games
- Linear conic formulations for two-party correlations and values of nonlocal games
Cites work
- A FINITELY PRESENTED SOLVABLE GROUP WITH UNSOLVABLE WORD PROBLEM
- About the Connes embedding conjecture
- Algorithmically complex residually finite groups
- Characterization of binary constraint system games
- Compression of quantum multi-prover interactive proofs
- Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
- Connes' embedding problem and Tsirelson's problem
- scientific article; zbMATH DE number 6292749 (Why is no real title available?)
- Hyperlinear and Sofic Groups: A Brief Guide
- Introduction to sofic and hyperlinear groups and Connes' embedding conjecture. With an appendix by Vladimir Pestov
- Lifting solutions to perturbing problems in C^*-algebras
- Linear conic formulations for two-party correlations and values of nonlocal games
- On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings
- On the faithful representation of infinite groups by matrices
- On the Residual Finiteness of Generalised Free Products of Nilpotent Groups
- Perfect commuting-operator strategies for linear system games
- Quantum XOR games
- Simple unified form for the major no-hidden-variables theorems
- Synchronous correlation matrices and Connes' embedding conjecture
- Tsirelson's problem and an embedding theorem for groups arising from non-local games
- Tsirelson's problem and Kirchberg's conjecture
- Unbounded entanglement can be needed to achieve the optimal success probability
Cited in
(60)- Unitary correlation sets
- Non-closure of the set of quantum correlations via graphs
- A universal representation for quantum commuting correlations
- Einstein meets Turing: the computability of nonlocal games
- Geometry of information structures, strategic measures and associated stochastic control topologies
- Non-closure of quantum correlation matrices and factorizable channels that require infinite dimensional ancilla (With an appendix by Narutaka Ozawa)
- Exact values of quantum violations in low-dimensional Bell correlation inequalities
- Bisynchronous games and factorizable maps
- Perfect strategies for non-local games
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Quantum and non-signalling graph isomorphisms
- Bipartite matrix-valued tensor product correlations that are not finitely representable
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Mixed states in one spatial dimension: decompositions and correspondence with nonnegative matrices
- Geometry of the set of synchronous quantum correlations
- A synchronous game for binary constraint systems
- Almost synchronous quantum correlations
- Anchored parallel repetition for nonlocal games
- Quantum teleportation and super-dense coding in operator algebras
- Nonlocal Games with Noisy Maximally Entangled States are Decidable
- Correlation matrices, Clifford algebras, and completely positive semidefinite rank
- Linear conic formulations for two-party correlations and values of nonlocal games
- Tsirelson's problem and an embedding theorem for groups arising from non-local games
- The Connes embedding problem: a guided tour
- Classical vs quantum satisfiability in linear constraint systems modulo an integer
- The quantum-to-classical graph homomorphism game
- Approximate completely positive semidefinite factorizations and their ranks
- A Characterization of Perfect Strategies for Mirror Games
- Arkhipov's theorem, graph minors, and linear system nonlocal games
- \(\mathrm{MIP}^* = \mathrm{RE}\): a negative resolution to Connes' embedding problem and Tsirelson's problem
- Graph isomorphism: physical resources, optimization models, and algebraic characterizations
- Quantum hypergraph homomorphisms and non-local games
- Scalable Bell inequalities for graph states of arbitrary prime local dimension and self-testing
- Quantum no-signalling correlations and non-local games
- Improved device-independent randomness expansion rates using two sided randomness
- The Schmidt rank for the commuting operator framework
- Transitive nonlocal games
- Statistical constructions in quantum information theory
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations
- Many bounded versions of undecidable problems are \textsf{NP}-hard
- Constant-sized robust self-tests for states and measurements of unbounded dimension
- An operator-algebraic formulation of self-testing
- Universality of graph homomorphism games and the quantum coloring problem
- Synchronous values of games
- On the complexity of zero gap MIP^*
- Team semantics and independence notions in quantum physics
- Quantum delegation with an off-the-shelf device
- Transfer of quantum game strategies
- The computational advantage of MIP* vanishes in the presence of noise
- The computational advantage of MIP* vanishes in the presence of noise
- Rounding near-optimal quantum strategies for nonlocal games to strategies using a maximally entangled state
- Undecidability and incompleteness in quantum information theory and operator algebras
- Asymmetric graphs with quantum symmetry
- Undecidability in physics: a review
- An abstract characterization for projections in operator systems
- Satisfiability problems and algebras of Boolean constraint system games
- The membership problem for constant-sized quantum correlations is undecidable
- Stability of homomorphisms, coverings and cocycles. I: Equivalence
- Operator systems generated by projections
- On the quantum chromatic numbers of small graphs
This page was built for publication: The set of quantum correlations is not closed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4610442)
