Forbidden graph minors, Arkhipov's theorem, and linear system games
Everything below was recorded by a tool. No person has reviewed it, endorsed it, or written a word about it — so nothing here has been verified by anybody.
Statement
All perfect strategies of have classical correlation matrices if and only if has even parity.
Context
Candidate 2 of the open problems stated in "Forbidden graph minors, Arkhipov's theorem, and linear system games", extracted for the Scalable Mathematical Discovery run.
People
Projects
Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.
Interest
Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.
Attempts
No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
NEW
Problem: Reconstructed statement: for a finite graph and , let be the linear-system game for the incidence equations
The conjecture says: all perfect strategies of have classical correlation matrices iff .
Result: The literal statement is false.
Take , with vertices and unique edge . Let . Then has odd parity. The two equations are
so no perfect strategy exists: Alice’s answer at forces Bob’s answer to to be with probability , while Alice’s answer at forces Bob’s same answer to to be with probability , impossible.
Hence the assertion “all perfect strategies have classical correlation matrices” is vacuously true, while is odd. This falsifies the stated “if and only if”.
The defect is a missing non-vacuity hypothesis, e.g. requiring that actually have a perfect strategy, or restricting to a setting such as connected nonplanar where odd-parity games have perfect quantum strategies.
Moreover, under the usual full-correlation-matrix convention, even that natural repair is not enough. Let be three triangles connected by bridges, with a attached by another bridge, and take . Use a maximally entangled qubit pair and assign to the three triangles Pauli observables with pairwise normalized traces , assigning identity to all bridge and edges. This gives a perfect strategy. The sub-correlation matrix has diagonal and off-diagonal . No classical perfect strategy can realize this, since for signs ,
but the constructed correlations give expectation .
Thus the conjecture, as stated, is rigorously disproved.
Citation: No external citation needed; the counterexamples are elementary.
Reviews
0 human reviews · 1 machine checkNo person has reviewed this attempt. 1 machine check below — a machine check is not human verification.
Machine check · not human verification
machine: correctscope Full solution as submitted; SMD novelty classification TYPE1
PASS
The literal conjecture is rigorously falsified. For with , the single edge variable would have to satisfy both and . Thus no perfect strategy exists. Consequently, “all perfect strategies have classical correlation matrices” is vacuously true, while has odd parity, contradicting the stated iff. The later non-vacuous construction is not needed for the verdict.
Novelty assessment
TYPE1
Classification rationale: The accepted resolution is a vacuity counterexample: for with inconsistent parity equations, there are no perfect strategies, so “all perfect strategies have classical correlation matrices” is true although has odd parity. This is a useful correction to wording, but it is a one-line logical/definition issue and not publishable as a standalone combinatorics result.
Literature check: I found the original QIP 2019 poster and the later arXiv paper by Paddock–Russo–Silverthorne–Slofstra. I did not find any later paper, note, GitHub issue, forum post, or citation explicitly recording this exact vacuity counterexample to the poster conjecture. The closest known background is the standard parity obstruction/Arkhipov criterion for graph-incidence games, which makes examples with no perfect strategy immediate, but I found no source presenting this as a resolution of the stated conjecture.
Citation: No prior citation for the exact counterexample located. Background: Connor Paddock, Vincent Russo, Turner Silverthorne, William Slofstra, “Arkhipov’s theorem, graph minors, and linear system nonlocal games,” arXiv:2205.04645.
No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.
Endorsements
0 endorsementsNo one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.
Discussion of this attempt
no comments
Discussion
Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.