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:

28 - 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

1570	Biorthogonal bases of compactly supported wavelets - Cohen, Daubeches, et al. - 1992
876	Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer - Shor - 1997
314	Strengths and weaknesses of quantum computing - Bennett, Bernstein, et al. - 1998
293	Quantum mechanics helps in searching for a needle in a haystack - Grover - 1997
269	Quantum lower bounds by polynomials - Beals, Buhrman, et al. - 1998
190	Zur Theorie der orthogonalen Funktionensysteme - Haar - 1911
146	Quantum lower bounds by quantum arguments - Ambainis - 2000
123	Quantum amplitude amplification and estimation - Brassard, Høyer, et al.
92	Grover’s quantum searching algorithm is optimal - Zalka - 1999
57	Quantum algorithm for element distinctness. Preliminary version: quant-ph/0007016 - Buhrman, Durr, et al. - 2000
27	A general sequential time-space tradeoff for finding unique elements - Beame - 1991
25	A better lower bound for quantum algorithms searching an ordered list - Ambainis - 1999
24	A time-space tradeoff for sorting on nonoblivious machines - Borodin, Fischer, et al. - 1981
24	Tricks or treats with the Hilbert matrix - Choi - 1983
23	A Lower Bound for Randomized Algebraic Decision Trees - Grigoriev, Karpinski, et al. - 1996
21	Invariant quantum algorithms for insertion into an ordered list. Preliminary version: quantph/9901059 - Farhi, Goldstone, et al. - 1999
18	The role of relative entropy in quantum information theory - Vedral - 2002
17	On the power of quantum computation - Vazirani - 1998
15	Quantum Computation”, Complexity Theory Retrospective - Berthiaume - 1997
14	Distinguishability of states and von Neumann entropy, Phys Rev A 62 - Jozsa, Schlienz - 1999
12	Quantum wavelet transforms: fast algorithms and complete circuits - Fijany, Williams - 1998
11	M.: A limit on the speed of quantum computation for insertion into an ordered list, arXiv:quant-ph/9812057 - Farhi, Goldstone, et al.
6	A lower bound for quantum search of an ordered list - Buhrman, Wolf - 1999
5	Quantum Algorithms - Høyer - 2000
5	R.: A lower bound for quantum search of 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