The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Bell’s Inequalities and Quantum Communication Complexity
Open accessAbstract
We prove that for every Bell's inequality, including those which are not yet known, there always exists a communication complexity problem, for which a protocol assisted by states which violate the inequality is more efficient than any classical protocol. Violation of Bell's inequalities is the necessary and sufficient condition for quantum protocol to beat the classical ones.
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
On 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
Die gegenw�rtige Situation in der Quantenmechanik
Schr�dinger, E. (1935) · Die Naturwissenschaften · doi:10.1007/bf01491891 · Cited by 3,392
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
Self-citationProceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
(2005) · Complexity Theory · doi:10.1007/3-540-27477-4_15 · Cited by 1,629
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
Bell Inequalities for Arbitrarily High-Dimensional Systems
Collins, D., Gisin, N., Linden, N., Massar, S., & Popescu, S. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.040404 · Cited by 981
Die gegenw�rtige Situation in der Quantenmechanik
Schr�dinger, E. (1935) · Die Naturwissenschaften · doi:10.1007/bf01491987 · Cited by 832
Die gegenw�rtige Situation in der Quantenmechanik
Schr�dinger, E. (1935) · Die Naturwissenschaften · doi:10.1007/bf01491914 · Cited by 689
Violations of Local Realism by Two EntangledN-Dimensional Systems Are Stronger than for Two Qubits
Kaszlikowski, D., Gnaciński, P., Żukowski, M., Miklaszewski, W., & Zeilinger, A. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4418 · Cited by 507
Self-citationAll-multipartite Bell-correlation inequalities for two dichotomic observables per site
Werner, R. F., & Wolf, M. M. (2001) · Physical Review A · doi:10.1103/physreva.64.032112 · Cited by 498
Interference of light and Bell's theorem
Belinskiĭ, A. V., & Klyshko, D. N. (1993) · Physics-Uspekhi · doi:10.1070/pu1993v036n08abeh002299 · Cited by 465
Bell's Inequalities and Density Matrices: Revealing “Hidden” Nonlocality
Popescu, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.2619 · Cited by 432
Bell’s Theorem for General N-Qubit States
Żukowski, M., & Brukner, Č. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.210401 · Cited by 422
Self-citationSubstituting quantum entanglement for communication
Cleve, R., & Buhrman, H. (1997) · Physical Review A · doi:10.1103/physreva.56.1201 · Cited by 416
Ardehali, M. (1992) · Physical Review A · doi:10.1103/physreva.46.5375 · Cited by 397
Kushilevitz, E. (1997) · Advances in Computers · doi:10.1016/s0065-2458(08)60342-3 · Cited by 252
Quantum Communication Complexity Protocol with Two Entangled Qutrits
Brukner, Č., Żukowski, M., & Zeilinger, A. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.197901 · Cited by 190
Self-citationMultiparty quantum communication complexity
Buhrman, H., van Dam, W., Høyer, P., et al. (1999) · Physical Review A · doi:10.1103/physreva.60.2737 · Cited by 112
Cited by
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Gühne, O., & Tóth, G. (2009) · Physics Reports · doi:10.1016/j.physrep.2009.02.004 · Cited by 2,401
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
High‐Dimensional Quantum Communication: Benefits, Progress, and Future Challenges
Cozzolino, D., Da Lio, B., Bacco, D., & Oxenløwe, L. K. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900038 · Cited by 470
Quantum discord as resource for remote state preparation
Dakić, B., Lipp, Y. O., Ma, X., Ringbauer, M., Kropatschek, S., Barz, S., Paterek, T., Vedral, V., Zeilinger, A., Brukner, Č., et al. (2012) · Nature Physics · doi:10.1038/nphys2377 · Cited by 462
Self-citation
Metadata
- Authors
- Brukner, Č., Żukowski, M., Pan, J.-W., & Zeilinger, A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2004-03-22
- Volume
- 92
- Issue
- 12
- Pages
- 127901-127901
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2171172588
- Cited by
- 265
- References
- 22
- FWCI
- 10.85
- 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.