Quantum Lower Bounds by Quantum Arguments

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing · 1997 · 5.9K citations

Computing, Computer Science, Mathematics +12

Strengths and Weaknesses of Quantum Computing

Charles H. Bennett, Ethan Bernstein, Gilles Brassard et al. · SIAM Journal on Computing · 1997 · 1.5K citations · Full text

Computing, Computer Science, Algorithms +4

On the distributional complexity of disjointness

Alexander Razborov · Theoretical Computer Science · 1992 · 485 citations

Computing, Computer Science, Mathematics +10

The Probabilistic Communication Complexity of Set Intersection

Bala Kalyanasundaram, Georg Schintger · SIAM Journal on Discrete Mathematics · 1992 · 458 citations

Computing, Computer Science, Probability Theory +13

Limit on the Speed of Quantum Computation in Determining Parity

Edward Farhi, Jeffrey Goldstone, Sam Gutmann et al. · Physical Review Letters · 1998 · 192 citations · Full text

Computing, Computer Science, Physics +11