The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Quantum communication complexity of symmetric predicates
Open accessAbstract
We completely (that is, up to a logarithmic factor) characterize the bounded-error quantum communication complexity of every predicate ) depending only on . More precisely, given a predicate on , we put Then the bounded-error quantum communication complexity of is equal to (up to a logarithmic factor). In particular, the complexity of the set disjointness predicate is equal to . This result holds both in the model with prior entanglement and in the model without it.
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
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Quantum lower bounds by polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001) · Journal of the ACM · doi:10.1145/502090.502097 · Cited by 639
Quantum Entanglement and the Communication Complexity of the Inner Product Function
Cleve, R., van Dam, W., Nielsen, M., & Tapp, A. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49208-9_4 · Cited by 133
Cited by
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
Quantum proofs for classical theorems
(2011) · Theory of Computing · doi:10.4086/toc.gs.2011.002 · Cited by 41
Metadata
- Authors
- Razborov, A. A.
- Venue
- Izvestiya: Mathematics
- Publisher
- Steklov Mathematical Institute
- Published
- 2003-02-28
- Volume
- 67
- Issue
- 1
- Pages
- 145-159
- ISSN
- 1064-5632 (ISSN-L)
- 1468-4810
- OpenAlex
- W2053590396
- Cited by
- 181
- References
- 3
- FWCI
- 9.89
- Type
- journal article
- Language
- ceb
- Open access
- bronze
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: Quantum communication complexity of symmetric predicates. https://app.cochat.ai/papers/10.1070/im2003v067n01abeh000422
- The paper
- Razborov, A. A. (2003). Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics. https://doi.org/10.1070/im2003v067n01abeh000422
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.