Constant-Time Quantum Algorithm For The Unstructured Search Problem

Abstract

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(\sqrt{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.

11 pages

References in corpus (6)

• A different kind of quantum search
• Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
• Quantum Searching via Entanglement and Partial Diffusion
• Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion
• Fixed Phase Quantum Search Algorithm
• A Hybrid Quantum Search Engine: A Fast Quantum Algorithm for Multiple Matches

Cited by in corpus (1)

• A Quantum Algorithm for Testing Junta Variables and Learning Boolean Functions via Entanglement Measure