The Quantum Query Complexity of Algebraic Properties

D.R. Simon, On the power of quantum computation

1994

Earlier work this paper cites.

L. Grover, A fast mechanical algorithm for database search , Proceedings of STOC’96: pages 212-219, 1996

1996

Earlier work this paper cites.

M. Boyer, G. Brassard, P. Høyer, A. Tapp, Tight bounds on quantum searching , Fortschritte Der Physik 46(4-5): pages 493-505, 1998

1998

Earlier work this paper cites.

G. Brassard, P. Hóyer, M. Mosca, A. Tapp, Quantum amplitude amplification and estimation

2000

Earlier work this paper cites.

S. Rajagopalan, L. J. Schulman, Verification of identities

2000

Earlier work this paper cites.

R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials , Journal of ACM 48: pages 778-797, 2001

2001

Earlier work this paper cites.

H. Buhrman, C. Dürr, M Heiligman, P. Høyer, F. Magniez, M. Santha, R. de Wolf, Quantum Algorithms for Element Distinctness

2001

Earlier work this paper cites.

A. Ambainis, Quantum Lower Bounds by Quantum Arguments

2002

Earlier work this paper cites.

A. Ambainis, Quantum walks and their algorithmic applications

2003

Cited alongside, same era.

T. Kavitha, Efficient Algorithms for Abelian Group Isomorphism and Related Problems

2003

Cited alongside, same era.

J. Kempe, N. Shenvi, K.B. Whaley, Quantum Random-Walk Search Algorithm

2003

Cited alongside, same era.

M.A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information

2003

Cited alongside, same era.

A. Ambainis, Quantum walk algorithm for element distinctness , Proceedings of FOCS’04: pages 22-31, 2004

2004

Cited alongside, same era.

C. Dürr, M. Heiligman, P. Høyer, M. Mhalla, Quantum query complexity of some graph problems

2004

Cited alongside, same era.

F. Magniez, A. Nayak, Quantum complexity of testing group commutativity

2005

Later among the works it cites.

F. Magniez, M. Santha, M. Szegedy, Quantum Algorithms for the Triangle Problem , Proceedings of SODA’05: pages 1109-1117, 2005

2005

Later among the works it cites.

A. Ambainis, R. Špalek, Quantum Algorithms for Matching and Network Flows , Proceedings of STACS’06, 2006

2006

Later among the works it cites.

H. Buhrman, R. Špalek, Quantum Verification of Matrix Products

2006

Later among the works it cites.

S. Dörn, Quantum Complexity Bounds of Independent Set Problems

2007

Closest in time.

S. Dörn, Quantum Algorithms for Graph Traversals and Related Problems

2007

Closest in time.