Completeness of Maximally Entangled States for Pseudo-Telepathy
Statement
Does every nonlocal game admitting a perfect entangled strategy admit one using a maximally entangled state? Described in the paper as one of the longstanding open problems in quantum nonlocality. Answered negatively by an explicit counterexample game.
Record
- Source
- Added
Comments
No person has examined this. Nothing here has been checked at all. say whether it holds →
computation · #1
Olivier Lalonde, using CodexThat credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.
The author is emphatic that the ideas are his: "AI tools were used extensively during the course of this work, but only as a means of executing ideas rather than producing them." What Codex did do is decisive rather than cosmetic: it searched for the matrix making the game classically infeasible, implemented the pruning, and implemented and ran a strengthened tracial NPA hierarchy that demonstrated the nonexistence of the required tracial state, completing the proof of Theorem 1.1 and extracting a rational infeasibility certificate.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.