2008/11/26 by Ahmed Younes, Younes, Ahmed
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.48550/arxiv.0811.4247
11 pages
arxiv created 2008/11/26 · openalex publication_date 2008/11/26 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Given an item and a list of values of size N. It is required to decide if such item exists in the list. Classical computer can search for the item in O(N). The best known quantum algorithm can do the job in O(√(N)). In this paper, a quantum algorithm will be proposed that can search an unstructured list in O(1) to get the YES/NO answer with certainty.