2011/01/25 by M. Nordin Zakaria, M Nordin Zakaria, Zakaria, M Nordin
Computer Science · Physics and Astronomy · #Computability, Logic, AI Algorithms #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.1101.4703
arxiv created 2011/01/25 · openalex publication_date 2011/01/25 · arxiv updated 2011/01/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider in this paper the possibility of embedding a quantum search algorithm within a classical binary search framework. The result appears promising: taking full advantage of quantum parallelism, we show that it may actually be possible to search an unstructured list in O(lg(N)), provided we are willing to restart the quantum search multiple times with a different sequence of qubits and perform a series of non-unitary measurements at the end of each.