Quantum Lower Bounds by Polynomials

Quantum Lower Bounds by Polynomials (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Robert Beals , Harry Buhrman , Richard Cleve , Michele Mosca , Ronald de Wolf

Citations:

236 - 27 self

BibTeX

@MISC{Beals98quantumlower,
    author = {Robert Beals and Harry Buhrman and Richard Cleve and Michele Mosca and Ronald de Wolf},
    title = {Quantum Lower Bounds by Polynomials},
    year = {1998}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

734	A fast quantum mechanical algorithm for database search - Grover - 1996
295	U.Vazirani, Strengths and weaknesses of quantum computing - Bennett, Brassard - 1997
137	Quantum measurements and the Abelian Stabilizer Problem lanl e-print quant-ph/9511026 - Kitaev
129	Quantum lower bounds by quantum arguments - Ambainis - 2002
126	On the degree of Boolean functions as real polynomials - Nisan, Szegedy - 1994
113	A.: Quantum vs. classical communication and computation - Buhrman, Cleve, et al.
109	Tight bounds on quantum searching”, Fortsch.Phys - Boyer, Brassard, et al. - 1998
107	Tight bounds on quantum searching - Boyer, Brassard, et al. - 1996
95	Quantum counting - Brassard, Hoyer, et al. - 1998
88	Complexity limitations on quantum computation - Fortnow, Rogers - 1999
80	An exact quantum polynomial-time algorithm for Simon's problem - Brassard, Hoyer - 1997
76	CREW PRAMs and decision trees - Nisan - 1991
57	The polynomial method in circuit complexity - Beigel - 1993
55	Quantum cryptanalysis of hidden linear functions - Boneh, Lipton - 1995
51	The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer - Mosca, Ekert - 1999
51	Probabilistic boolean decision trees and the complexity of evaluating game trees. FOCS - Saks, Wigderson - 1986
47	An oracle builder’s toolkit - Fenner, Fortnow, et al. - 1993
43	M.Sipser, A limit on the speed of quantum computation in determining parity, Phys.Rev.Lett - Farhi, Gutmann - 1998
30	Quantum Algorithm for the Collision Problem - Brassard, Hyer, et al. - 1997
25	Efficient quantum algorithms for shifted quadratic character problems - Hallgren, Dam - 2000
23	Schwankung von Polynomen zwischen Gitterpunkten - Ehlich, Zeller - 1964
21	Determining the majority - Alonso, Reingold, et al. - 1993
17	Acomparison of uniform approximations on an interval and a finite subset thereof - Cheney - 1966
17	On the power of quantum computation - Vazirani - 1998
16	Quantum searching, counting and amplitude amplification by eigenvector analysis - Mosca
15	The query complexity of order-finding - Cleve - 2000
14	On the Monte Carlo decision tree complexity of read-once formulae - Santha - 1995
12	Quantum Computer Can Not Speed Up Iterated Applications of a Black Box - Ozhigov - 1997
10	A note on quantum black-box complexity of almost all Boolean functions - Ambainis - 1999
10	On computing majority by comparisons - Saks, Werman - 1991
9	How many functions can be distinguished with k quantum queries? quantph/9901012 - Farhi, Goldstone, et al. - 1999
3	Conjugated operators in quantum algorithms - Hyer - 1999
2	Quantum bounds for ordered searching and sorting - HYER, NEERBEK, et al. - 1991
2	A probabilistic algorithm for k-SAT and constraint satisfaction problems - ONING, U - 1999
1	Also available at http://xxx.lanl.gov/abs/quant-ph/9811080.) Quantum Lower Bounds by Polynomials 795 AMBAINIS, A. 2000. Quantum lower bounds by quantum arguments - Lett
1	Fortschritte der Physik 46, 4--5, 493--505. (quant-ph/9605034 - BRASSARD, ANDHYER - 1997
1	Symposium on Theory of Computing and Systems (ISTCS'97 - BRASSARD, HYER, et al. - 2000
1	Quantum algorithms for element distinctness - WOLF - 2001
1	Quantum oracle interrogation: Getting all information for almost half the price - A454 - 1998
1	174--188. (quantph /9903071 - NAYAK, WU - 1999
1	Bounds by Polynomials 797 SERVEDIO,R.A.,AND - Lower - 1997