Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness

2002/11/07 by Not Available Not Available · 2 citations
Computer Science · #Computability, Logic, AI Algorithms #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography

paper · doi:10.1007/s00453-002-0976-3

openalex publication_date 2002/11/07 · crossref created 2002/11/07 · crossref issued 2002/11/08 · crossref published 2002/11/08 · crossref published-print 2002/11/08 · crossref deposited 2019/05/29 · openalex created_date 2025/10/10 · crossref indexed 2026/06/11 · openalex updated_date 2026/08/01

Citations

• Orthonormal bases of compactly supported wavelets
• Invariant Quantum Algorithms for Insertion into an Ordered List

Cited by

• The Bayesian Learner is Optimal for Noisy Binary Search  (and Pretty Good for Quantum as Well)
• Binary search [wikipedia]