Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Foundations of Physics Letters

A second look at a recent algebraic proof of nonlocality

Robert K. Clifton, Michael L. G. Redhead, Jeremy Butterfield

Published Aug 1, 1991• 7 citations
Publisher
DOI
10.1007/bf00665898

Related papers

Weakening the locality conditions in algebraic nonlocality proofs

Andrew Elby, Martin R. Jones

Physics Letters A•Nov 1, 1992•11 citations

On a Recent Proof of Nonlocality Without Inequalities

G. C. Ghirardi

arXiv:1101.5252•Foundations of Physics•Mar 17, 2011•5 citations

Generalization of the Greenberger-Horne-Zeilinger algebraic proof of nonlocality

Robert K. Clifton, Michael L. G. Redhead, Jeremy Butterfield

Foundations of Physics•Feb 1, 1991•58 citations

Some difficulties for Clifton, Redhead, and Butterfield's recent proof of nonlocality

Martin R. Jones

Foundations of Physics Letters•Aug 1, 1991•3 citations

Bell’S Proof of Nonlocality

Jean Bricmont

History of physics•Jan 1, 2026•0 citations

Comments on the recent improvements of the MRRW bounds

Alexander Barg

The asymptotic McEliece--Rodemich--Rumsey--Welch bound (1977) limits the largest attainable rate of binary codes as a function of the relative distance. After a nearly half-century hiatus, this result was recently improved in two concurrent works, by OpenAI and by O. Alrabiah and V. Guruswami. The two arguments look entirely different, a Delsarte certificate on the one hand, a classical-quantum channel and the pretty good measurement on the other, and they yield the same bound. The purpose of this note is to explain why: in both proofs, a subspace is attached to every codeword and moved with it, and the bound counts how many such subspaces fit in the ambient space, exactly in the first case and in the probabilistic sense of typicality in the second. We also present the OpenAI proof in the language and context of coding theory, as an extension of the spectral method in which the single vector attached to a codeword is replaced by a subspace.

cs.ITCross-listedarXiv:2609.01860•Sep 3, 2026
The asymptotic McEliece--Rodemich--Rumsey--Welch bound (1977) limits the largest attainable rate of binary codes as a function of the relative distance. After a nearly half-century hiatus, this result was recently improved in two concurrent works, by OpenAI and by O. Alrabiah and V. Guruswami. The two arguments look entirely different, a Delsarte certificate on the one hand, a classical-quantum channel and the pretty good measurement on the other, and they yield the same bound. The purpose of this note is to explain why: in both proofs, a subspace is attached to every codeword and moved with it, and the bound counts how many such subspaces fit in the ambient space, exactly in the first case and in the probabilistic sense of typicality in the second. We also present the OpenAI proof in the language and context of coding theory, as an extension of the spectral method in which the single vector attached to a codeword is replaced by a subspace.