The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Quantum vs. classical communication and computation
Open accessAbstract
AbotractWC present n simple and general simulation technique that transforms any black-box quantum algorithm (6 la Grover's database search nlgorithm) to a quantum communication protocol for a relntcd problem, in a way that fully exploits the quantum parallelism.This allows us to obtain new positive and negative results.The positive results are novel quantum communication protocols thnt nre built from nontrivial quantum algorithms via this simulation, These protocols, combined with (old and new) classical lower bounds, nre shown to provide the first asymptotic separation results between the quantum and classical (probabilistic) hvoparty communication complexity models.In particular, we obtain a quadratic separation for the bounded-error model, and an exponential separntion for the zero-error model.The negative results transform known quantum communication lower bounds to computational lower bounds in the black-box model, In particular, we show that the quadratic speed-up achieved by Grover for the OR function is impossible for the PARITY function or the MAJORITY function in the bounded-error model, nor ia It possible for the OR function itself in the exact case.This dichotomy naturally suggests a study of bounded-depth predicates (Le.those in the polynomial hierarchy) between OR and MAJORITY.We present black-box algorithms that achieve near quadratic speed up for nil such predicates.
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
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
(2005) · Complexity Theory · doi:10.1007/3-540-27477-4_15 · Cited by 1,629
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Some complexity questions related to distributive computing(Preliminary Report)
Yao, A. C.-C. (1979) · Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79 · doi:10.1145/800135.804414 · Cited by 1,042
(1996) · Cited by 824
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
Self-citationNP is as easy as detecting unique solutions
Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90135-0 · Cited by 635
Chi-Chih Yao, A. (2002) · Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science · doi:10.1109/sfcs.1993.366852 · Cited by 633
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Chor, B., & Goldreich, O. (1988) · SIAM Journal on Computing · doi:10.1137/0217015 · Cited by 544
On the power of quantum computation
Simon, D. R. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365701 · Cited by 491
Substituting quantum entanglement for communication
Cleve, R., & Buhrman, H. (1997) · Physical Review A · doi:10.1103/physreva.56.1201 · Cited by 416
Self-citationQuantum Entanglement and Communication Complexity
Buhrman, H., Cleve, R., & van Dam, W. (2001) · SIAM Journal on Computing · doi:10.1137/s0097539797324886 · Cited by 206
Self-citationLimit on the Speed of Quantum Computation in Determining Parity
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5442 · Cited by 181
Quantum Lower Bounds by Polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9802049 · Cited by 164
Self-citationFrankl, P., & Rödl, V. (1987) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1987-0871675-6 · Cited by 159
NP is as easy as detecting unique solutions
Valiant, L. G., & Vazirani, V. V. (1985) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/22145.22196 · Cited by 143
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
Self-citationTight Bounds on Quantum Searching
Boyer, M., Gilles Brassard, A., Høyer, P., & Tappa, A. (1999) · doi:10.1002/3527603093.ch10 · Cited by 132
Berthiaume, A., & Brassard, G. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552351 · Cited by 126
Multiparty quantum communication complexity
Buhrman, H., van Dam, W., Høyer, P., & Tapp, A. (1999) · Physical Review A · doi:10.1103/physreva.60.2737 · Cited by 121
Self-citationUnbiased bits from sources of weak randomness and probabilistic communication complexity
Chor, B., & Goldreich, O. (1985) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1985.62 · Cited by 102
Vazirani, U. V. (1987) · COMBINATORICA · doi:10.1007/bf02579325 · Cited by 98
Ensemble-Dependent Bounds for Accessible Information in Quantum Mechanics
Fuchs, C. A., & Caves, C. M. (1994) · Physical Review Letters · doi:10.1103/physrevlett.73.3047 · Cited by 93
Quantum Entanglement and Communication Complexity
Buhrman, H., Cleve, R., & van Dam, W. (1997) · BRICS Report Series · doi:10.7146/brics.v4i40.18966 · Cited by 22
Self-citation
Cited by
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Buhrman, H., Cleve, R., Watrous, J., & de Wolf, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.167902 · Cited by 1,190
Self-citationQuantum nonlocality without entanglement
Bennett, C. H., DiVincenzo, D. P., Fuchs, C. A., Mor, T., Rains, E., Shor, P. W., Smolin, J. A., & Wootters, W. K. (1999) · Physical Review A · doi:10.1103/physreva.59.1070 · Cited by 1,130
Bell inequalities and the separability criterion
Terhal, B. M. (2000) · Physics Letters A · doi:10.1016/s0375-9601(00)00401-1 · Cited by 775
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
Self-citation
Metadata
- Authors
- Buhrman, H., Cleve, R., & Wigderson, A.
- Venue
- Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
- Publisher
- ACM Press
- Published
- 1998
- Pages
- 63-68
- OpenAlex
- W2086290259
- Cited by
- 389
- References
- 29
- FWCI
- 13.66
- Type
- conference paper
- Language
- en
- Open access
- gold
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.