The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
Open accessAbstract
Bell proved that quantum entanglement enables two spacelike separated parties to exhibit classically impossible correlations. Even though these correlations are stronger than anything classically achievable, they cannot be harnessed to make instantaneous (faster than light) communication possible. Yet, Popescu and Rohrlich have shown that even stronger correlations can be defined, under which instantaneous communication remains impossible. This raises the question: Why are the correlations achievable by quantum mechanics not maximal among those that preserve causality? We give a partial answer to this question by showing that slightly stronger correlations would result in a world in which communication complexity becomes trivial.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Self-citationOn the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
Proposed Experiment to Test Local Hidden-Variable Theories
Clauser, J. F., Horne, M. A., Shimony, A., & Holt, R. A. (1969) · Physical Review Letters · doi:10.1103/physrevlett.23.880 · Cited by 7,573
Experimental Tests of Realistic Local Theories via Bell's Theorem
Aspect, A., Grangier, P., & Roger, G. (1981) · Physical Review Letters · doi:10.1103/physrevlett.47.460 · Cited by 2,251
Experimental Test of Local Hidden-Variable Theories
Freedman, S. J., & Clauser, J. F. (1972) · Physical Review Letters · doi:10.1103/physrevlett.28.938 · Cited by 1,999
Quantum generalizations of Bell's inequality
Cirel'son, B. S. (1980) · Letters in Mathematical Physics · doi:10.1007/bf00417500 · Cited by 1,788
Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components
von Neumann, J. (1956) · Cited by 1,652
(2005) · Complexity Theory · doi:10.1007/3-540-27477-4_15 · Cited by 1,629
Quantum nonlocality as an axiom
Popescu, S., & Rohrlich, D. (1994) · Foundations of Physics · doi:10.1007/bf02058098 · Cited by 1,562
Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components
Neumann, J. V. (1956) · Automata Studies. (AM-34) · doi:10.1515/9781400882618-003 · Cited by 1,456
Cited by
Brunner, N., Cavalcanti, D., Pironio, S., Scarani, V., & Wehner, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.419 · Cited by 2,688
Information causality as a physical principle
Pawłowski, M., Paterek, T., Kaszlikowski, D., Scarani, V., Winter, A., & Żukowski, M. (2009) · Nature · doi:10.1038/nature08400 · Cited by 775
Information processing in generalized probabilistic theories
Barrett, J. (2007) · Physical Review A · doi:10.1103/physreva.75.032304 · Cited by 768
Nonlocality and communication complexity
Buhrman, H., Cleve, R., Massar, S., & de Wolf, R. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.665 · Cited by 622
Self-citationScarani, V. (2019) · doi:10.1093/oso/9780198788416.001.0001 · Cited by 605
Metadata
- Authors
- Brassard, G., Buhrman, H., Linden, N., Méthot, A. A., Tapp, A., & Unger, F.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2006-06-27
- Volume
- 96
- Issue
- 25
- Pages
- 250401-250401
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2108732680
- Cited by
- 404
- References
- 24
- FWCI
- 10.52
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial. https://app.cochat.ai/papers/10.1103/physrevlett.96.250401
- The paper
- Brassard, G., Buhrman, H., Linden, N., Méthot, A. A., Tapp, A., & Unger, F. (2006). Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial. Physical Review Letters. https://doi.org/10.1103/physrevlett.96.250401
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.