Quantum complexities of ordered searching, sorting, and element distinctness

Quantum complexities of ordered searching, sorting, and element distinctness (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Peter Høyer , Jan Neerbek , Yaoyun Shi

Citations:

26 - 3 self

BibTeX

@MISC{Høyer01quantumcomplexities,
    author = {Peter Høyer and Jan Neerbek and Yaoyun Shi},
    title = {Quantum complexities of ordered searching, sorting, and element distinctness },
    year = {2001}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

1449	Orthonormal Bases of Compactly Supported Wavelets - Daubechies - 1988
843	Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer - Shor - 1997
318	Strengths and weaknesses of quantum computation - Bennet, Bernstein, et al. - 1999
296	Quantum mechanics helps in searching for a needle in haystack[J - Grover
261	Quantum lower bounds by polynomials - Beals, Buhrman, et al.
172	Zur theorie der orthogonalen funktionensysteme - HAAR - 1910
139	Quantum lower bounds by quantum arguments - Ambainis - 2000
122	Quantum amplitude amplification and estimation - Brassard, Høyer, et al. - 2002
93	Grover’s quantum searching algorithm is optimal. Los Alamos Physics Preprint Archive, http://xxx.lanl.gov/abs/quant-ph/9711070. ACKNOWLEDGMENTS The authors would like to thank Tad Hogg and Carlos Mochon for many enjoyable conversations about quantum compu - ZALKA - 1997
58	R.: Quantum algorithms for Element Distinctness - Buhrman, Dürr, et al. - 2005
27	A general sequential time-space tradeoff for finding unique elements - Beame - 1991
26	A better lower bound for quantum algorithms searching an ordered list - AMBAINIS - 1999
24	Tricks or Treats with the Hilbert Matrix - Choi
23	M.: A time-space tradeoff for sorting on nonoblivious machines - Borodin, Fischer, et al. - 1981
23	A lower bound for randomized algebraic decision trees - Grigoriev, Karpinksi, et al. - 1997
22	Invariant quantum algorithms for insertion into an ordered list. Manuscript at quant-ph/9901059 - Farhi, Goldstone, et al. - 1999
17	On the power of quantum computation - Vazirani - 1998
17	The role of relative entropy in quantum information theory - Vedral
15	Quantum Computation”, Complexity Theory Retrospective - Berthiaume - 1997
14	Distinguishability of states and von Neumann entropy, Phys Rev A 62 - Jozsa, Schlienz - 1999
11	M.: A limit on the speed of quantum computation for insertion into an ordered list, arXiv:quant-ph/9812057 - Farhi, Goldstone, et al.
11	Quantum wavelet transform: Fast algorithm and complete circuits. Quantum Computing and Quantum - Fijany, Williams - 1999
6	A lower bound for quantum search of an ordered list - Buhrman, Wolf - 1999
5	Quantum Algorithms - Høyer - 2000
4	A lower bound of quantum search for an ordered - Buhrman, Wolf - 1999
2	Quantum algorithms for finding claws, collisions and triangles,” quant-ph/0007016 - Buhrman, Dürr, et al. - 2000
2	Efficient quantum algorithms. quant-ph/9702028 - Hoyer - 1997
1	Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer - Rohrig, communication