Possible consequences for physics of the negative resolution of Tsirelson's problem
Ad\'an Cabello, Marco T\'ulio Quintino, Matthias Kleinmann

TL;DR
This paper discusses the implications of a recent proof that resolves Tsirelson's problem negatively, showing that certain quantum correlations cannot be approximated by finite-dimensional systems, and explores four logical possibilities of this outcome.
Contribution
It identifies four fundamental logical possibilities resulting from the negative resolution of Tsirelson's problem and discusses open problems to determine which is correct.
Findings
Separation of $C_{qa}$ and $C_{qc}$ by a hyperplane is possible.
Correlations from commuting measurements cannot always be approximated by finite-dimensional tensor products.
Four logical scenarios arise from the negative resolution, each with different implications.
Abstract
In 2020, Ji et al. [arXiv:2001.04383 and Comm.~ACM 64}, 131 (2021)] provided a proof that the complexity classes and are equivalent. This result implies a negative resolution of Tsirelson's problem, that is, (the closure of the set of tensor product correlations) and (the set of commuting correlations) can be separated by a hyperplane (that is, a Bell-like inequality). In particular, there are correlations produced by commuting measurements (a finite number of them and with a finite number of outcomes) on an infinite-dimensional quantum system which cannot be approximated by sequences of finite-dimensional tensor product correlations. Here, we point out that there are four logical possibilities of this result. Each possibility is interesting because it fundamentally challenges the nature of spacially separated systems in different ways. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Computability, Logic, AI Algorithms · Statistical Mechanics and Entropy
