Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness

@article{Hyer2002QuantumCO,
  title={Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness 

},
  author={P. H{\o}yer and Jan Neerbek and Y. Shi},
  journal={Algorithmica},
  year={2002},
  volume={34},
  pages={429-448}
}
Abstract. We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all distinct. Letting N be the number of elements in the input list, we prove a lower bound of (1/π )(ln(N )-1) accesses to the list elements for ordered searching, a lower bound of Ω(N logN ) binary comparisons for sorting, and a lower bound of $\Omega(\sqrt{N}\log{N})$ binary comparisons for element distinctness… Expand
95 Citations
Optimal Quantum Adversary Lower Bounds for Ordered Search
  • 16
  • PDF
Quantum search of partially ordered sets
  • A. Montanaro
  • Computer Science, Physics
  • Quantum Inf. Comput.
  • 2009
  • 1
  • Highly Influenced
  • PDF
Quantum algorithms for finding extrema with unary predicates
  • PDF
A lower bound on the quantum query complexity of read-once functions
  • H. Barnum, M. Saks
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2002
  • 66
  • PDF
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
  • Sophie Laplante, F. Magniez
  • Mathematics, Computer Science
  • Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
  • 2004
  • 54
  • PDF
Quantum and Classical Query Complexities of Local Search Are Polynomially Related
  • 11
  • PDF
Reconstructing Strings from Substrings with Quantum Queries
  • 7
  • PDF
Quantum query complexity and semi-definite programming
  • H. Barnum, M. Saks, M. Szegedy
  • Mathematics, Computer Science
  • 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
  • 2003
  • 84
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 33 REFERENCES
Quantum lower bounds by polynomials
  • 428
  • PDF
A Lower Bound for Quantum Search of an Ordered List
  • 16
  • PDF
A better lower bound for quantum algorithms searching an ordered list
  • A. Ambainis
  • Mathematics, Physics
  • 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
  • 1999
  • 45
  • PDF
Quantum Algorithms for Finding Claws, Collisions and Triangles
  • 2
A lower bound for randomized algebraic decision trees
  • 20
  • PDF
Quantum lower bounds by quantum arguments
  • 389
  • PDF
...
1
2
3
4
...