Consequences and limits of nonlocal strategies
The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
This paper investigates various aspects of the nonlocal effects that can arise when entangled quantum information is shared between two parties. A natural framework for studying nonlocality is that of cooperative games with incomplete information, where two cooperating players may share entanglement. Here, nonlocality can be quantified in terms of the values of such games. We review some examples of non-locality and show that it can profoundly affect the soundness of two-prover interactive proof systems. We then establish limits on nonlocal behavior by upper-bounding the values of several of these games. These upper bounds can be regarded as generalizations of the so-called Tsirelson inequality. We also investigate the amount of entanglement required by optimal and nearly optimal quantum strategies.
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
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252 · cited 1×
“The classical value of a game G will be denoted ω c ( G ) .”
BackgroundProposed 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 · cited 2×
“Our first example of a game for which a quantum strategy outperforms any classical strategy is a well-known example based on the CHSH inequality , named for its discoverers Clauser, Horne, Shimony, and Holt [14].”
BackgroundGoemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587 · cited 1×
“More recently, Goemans and Williamson used the same idea to derive randomized approximation algorithms for MAX CUT and related problems [23].”
BackgroundSome optimal inapproximability results
Håstad, J. (2001) · Journal of the ACM · doi:10.1145/502090.502098 · Cited by 1,902
Quantum generalizations of Bell's inequality
Cirel'son, B. S. (1980) · Letters in Mathematical Physics · doi:10.1007/bf00417500 · Cited by 1,788
The Problem of Hidden Variables in Quantum Mechanics
Kochen, S., & Specker, E. (1967) · Indiana University Mathematics Journal · doi:10.1512/iumj.1968.17.17004 · Cited by 1,250
Hidden variables and the two theorems of John Bell
Mermin, N. D. (1993) · Reviews of Modern Physics · doi:10.1103/revmodphys.65.803 · Cited by 1,078
Quantum Theory: Concepts and Methods
(2002) · doi:10.1007/0-306-47120-5 · Cited by 1,029
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
Quantum analogues of the Bell inequalities. The case of two spatially separated domains
Tsirel'son, B. S. (1987) · Journal of Soviet Mathematics · doi:10.1007/bf01663472 · Cited by 381
Wringing out better Bell inequalities
Braunstein, S. L., & Caves, C. M. (1990) · Annals of Physics · doi:10.1016/0003-4916(90)90339-p · Cited by 274
Metadata
- Authors
- Cleve, R., Hoyer, P., Toner, B., & Watrous, J.
- Venue
- Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
- Publisher
- IEEE
- Published
- 2004-11-12
- Pages
- 236-249
- ISSN
- 1093-0159 (ISSN-L)
- OpenAlex
- W2951124766
- Cited by
- 166
- References
- 11
- FWCI
- 2.39
- Type
- conference paper
- Language
- en
- Open access
- closed
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.