Tsirelson's conjecture on quantum correlation sets
For integers , let and denote the corresponding approximately quantum and commuting quantum correlation sets, and let denote the finite-dimensional commuting correlation set. Tsirelson's conjecture. One has
for all ; equivalently, is dense in for all . This is the strong Tsirelson conjecture, concerning whether the tensor-product and commuting-operator models agree in infinite dimensions; the source presents it as an open formulation, although its connection with the Connes Embedding Problem is discussed.
References
Primary source
Magdalena Musat, “The Connes-Kirchberg Problem and infinite-dimensional phenomena in quantum information theory”, arXiv:2512.00432 (2025).
Progress summary
A landmark result shows the conjecture is false: some commuting quantum correlations cannot be approximated by finite-dimensional models.
The conjecture asserts that the approximately quantum and commuting quantum correlation sets coincide for every finite number of questions and answers. It is equivalent to the density of finite-dimensional commuting correlations in the full commuting set and is closely tied to the Connes Embedding Problem.
Known results
- Tsirelson proved agreement of the tensor-product and commuting models in finite dimensions.
- Slofstra proved that the tensor-product correlation set is not closed for sufficiently large parameters.
- The Connes Embedding Problem and Tsirelson's problem were shown to be essentially equivalent.
December 2025 negative resolution
The theorem of Ji, Natarajan, Vidick, Wright, and Yuen implies that the Connes Embedding Problem is false and that for some finite parameters. Thus the stated strong Tsirelson conjecture is disproved, with the conclusion also reported in later expositions.
Current status (as of August 2026): The strong conjecture is settled negatively; equality fails for some , although the sources do not specify the smallest such parameters.
Solutions 0
No solutions have been posted yet.