The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Quantum Pseudo-Telepathy
Open accessAbstract
Quantum information processing is at the crossroads of physics, mathematics and computer science. It is concerned with what we can and cannot do with quantum information that goes beyond the abilities of classical information processing devices. Communication complexity is an area of classical computer science that aims at quantifying the amount of communication necessary to solve distributed computational problems. Quantum communication complexity uses quantum mechanics to reduce the amount of communication that would be classically required.Pseudo-telepathy is a surprising application of quantum information processing to communication complexity. Thanks to entanglement, perhaps the most nonclassical manifestation of quantum mechanics, two or more quantum players can accomplish a distributed task with no need for communication whatsoever, which would be an impossible feat for classical players. After a detailed overview of the principle and purpose of pseudo-telepathy, we present a survey of recent and not-so-recent work on the subject. In particular, we describe and analyse all the pseudo-telepathy games currently known to the authors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
Experimental Test of Bell's Inequalities Using Time- Varying Analyzers
Aspect, A., Dalibard, J., & Roger, G. (1982) · Physical Review Letters · doi:10.1103/physrevlett.49.1804 · Cited by 3,942
On the Problem of Hidden Variables in Quantum Mechanics
BELL, J. S. (1966) · Reviews of Modern Physics · doi:10.1103/revmodphys.38.447 · Cited by 2,845
Aspect, A., Grangier, P., & Roger, G. (1982) · Physical Review Letters · doi:10.1103/physrevlett.49.91 · Cited by 2,687
Bell’s theorem without inequalities
Greenberger, D. M., Horne, M. A., Shimony, A., & Zeilinger, A. (1990) · American Journal of Physics · doi:10.1119/1.16243 · Cited by 2,404
Extreme quantum entanglement in a superposition of macroscopically distinct states
Mermin, N. D. (1990) · Physical Review Letters · doi:10.1103/physrevlett.65.1838 · Cited by 1,482 · cited 1×
“When restricted to l = 1, but with any number n ≥ 3 of players, this is Mermin’s parity game, introduced in [35] and recast from a computer science point of view in [36, 37].”
BackgroundViolation of Bell Inequalities by Photons More Than 10 km Apart
Tittel, W., Brendel, J., Zbinden, H., & Gisin, N. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.3563 · Cited by 963
Simple unified form for the major no-hidden-variables theorems
Mermin, N. D. (1990) · Physical Review Letters · doi:10.1103/physrevlett.65.3373 · Cited by 753 · cited 14×
“When restricted to ℓ = 1, but with any number n ≥ 3 of players, this is Mermin’s parity game , introduced in [35] and recast from a computer science point of view in [36, 37].”
MethodInfluentialDie Logik nicht gleichzeitig entscheidbarer Aussagen
Specker, E. (1960) · Dialectica · doi:10.1111/j.1746-8361.1960.tb00422.x · Cited by 273
All-Versus-Nothing Violation of Local Realism for Two Entangled Photons
Chen, Z.-B., Pan, J.-W., Zhang, Y.-D., Brukner, Č., & Zeilinger, A. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.160408 · Cited by 77 · cited 1×
“Too often, we read that they allow to rule out local realism in a single run: “The quantum nonlocality can thus, in principle, be manifest in a single run of a certain measurement” [11].”
Background
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
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-testing of quantum systems: a review
Šupić, I., & Bowles, J. (2020) · Quantum · doi:10.22331/q-2020-09-30-337 · Cited by 365
The two Bellʼs theorems of John Bell
Wiseman, H. M. (2014) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/47/42/424001 · Cited by 131
Metadata
- Authors
- Brassard, G., Broadbent, A., & Tapp, A.
- Venue
- Foundations of Physics
- Published
- 2005-11
- Volume
- 35
- Issue
- 11
- Pages
- 1877-1907
- ISSN
- 0015-9018 (ISSN-L)
- 1572-9516
- OpenAlex
- W2026103473
- Cited by
- 165
- References
- 11
- FWCI
- 7.56
- 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
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.