OpenFrontiers
← Back to the index

Minimal separation of quantum correlation models

For each separation Cq≠CqaC_q\ne C_{qa} and Cqa≠CqcC_{qa}\ne C_{qc}, determine minimal input/output tuples under a stated ordering, and construct explicit small witnesses.

Source-reported statusAs of 2026-09-04Source & evidence ↓

Problem statement

For each separation Cq≠CqaC_q\ne C_{qa} and Cqa≠CqcC_{qa}\ne C_{qc}, determine minimal input/output tuples under a stated ordering, and construct explicit small witnesses.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

Finite-dimensional tensor-product correlations form CqC_q; their closure is CqaC_{qa}; commuting-operator correlations form CqcC_{qc}. Nonclosure of CqC_q and separation of CqaC_{qa} from CqcC_{qc} are different established phenomena, not one undifferentiated separation.

Slofstra proved nonclosure of finite-dimensional quantum correlations. Dykema–Paulsen–Prakash give an explicit five-input, two-output nonclosure example. MIP*=RE establishes Cqa≠CqcC_{qa}\ne C_{qc} and refutes the corresponding Tsirelson/Connes conjectures. Its construction is effective: calling all these proofs nonconstructive is inaccurate, although the resulting examples can be complicated.

The residual benchmark must specify which two sets are compared and what “smallest” means. Setting counts and output counts form a partial order, so distinct Pareto-minimal scenarios may matter. Useful advances are smaller certified examples, lower bounds excluding separation in specified scenarios and transparent separating correlations.

Progress & source assessment

Source catalogue review: 4 September 2026. Improved indicates partial progress, including qualified preprint claims.

References
  1. [1]Dykema, Paulsen & Prakash, 'Non-closure of the set of quantum correlations via graphs' (published 2019) link
  2. [2]Ji et al., 'MIP*=RE' link
  3. [3]Slofstra, 'The set of quantum correlations is not closed', Forum Math. Pi 7 (2019) link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.