An intrinsic limitation on the size of quantum database

Abstract

It is found that Grover's quantum search algorithm is not robust against phase inversion and Hadmard transformation inaccuracies. Imperfect phase inversions and Hadmard-Walsh transformations in Grover's quantum search algorithm lead to reductions in the maximum probability of the marked state and affect the efficiency of the algorithm. even in the absence of decoherence. Given the degrees of inaccuracies, we find that to guarantee half rate of success, the size of the database should be in the order of $O(\frac{1}{{\delta }^2})$, where $\delta$ is the uncertainty.

6 pages, 3 figures

References in corpus (10)

• Quantum Mechanics helps in searching for a needle in a haystack
• Reliable Quantum Computers
• Quantum computers can search rapidly by using almost any transformation
• Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer
• Quantum Computers, Factoring, and Decoherence
• Generalized Quantum Search with Parallelism
• Searching in Grover's Algorithm
• Fast quantum search algorithm and Bounds on it
• Quantum searching's underlying SU(2) structure and its quantum decoherence effects
• Speedup of iterated quantum search by parallel performance