Bell-locality threshold of two-qubit Werner states
For , determine the exact critical visibility for Bell locality under all single-copy local projective measurements; formulate arbitrary POVMs as a separate threshold.
Problem statement
For , determine the exact critical visibility for Bell locality under all single-copy local projective measurements; formulate arbitrary POVMs as a separate threshold.
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
A two-qubit Werner state mixes a singlet with white noise. Entanglement and Bell nonlocality are different resources: the state is entangled for , but some entangled states still admit local hidden-variable models.
Acín–Gisin–Toner proved that the projective-measurement locality threshold is , with the order-three Grothendieck constant. Thus exact determination is a precise mathematical problem, not just a search for another Bell inequality. The threshold for all POVMs must be kept separate.
Published progress (February 2026): Designolle–Vértesi–Pokutta improve certified bounds for finite-order Grothendieck constants and clearly distinguish exact certificates from heuristic candidates. The exact order-three value remains unknown. No numerical interval is displayed here without a separately maintained certificate ledger.
The operational setting is one copy, ordinary classical-input Bell tests and no postselection or auxiliary entanglement. Filtering, collective measurements on several copies and network activation change the question; none should be silently included in this threshold.
Progress & source assessment
Source catalogue review: 4 September 2026. Improved indicates partial progress, including qualified preprint claims.
published: New certified finite-order Grothendieck bounds; exact order-three value remains unknown, and heuristic candidates are distinguished from certificates. Evidence
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts 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 notesNotes 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.