Fixed Phase Quantum Search Algorithm
arXiv:0704.1585
Abstract
Building quantum devices using fixed operators is a must to simplify the hardware construction. Quantum search engine is not an exception. In this paper, a fixed phase quantum search algorithm that searches for M matches in an unstructured search space of size N will be presented. Selecting phase shifts of 1.91684πin the standard amplitude amplification will make the technique perform better so as to get probability of success at least 99.58% in O(sqrt(N/M)) better than any know fixed operator quantum search algorithms. The algorithm will be able to handle either a single match or multiple matches in the search space. The algorithm will find a match in O(sqrt(N/M)) whether the number of matches is known or not in advance.
10 pages, 3 figures
References in corpus (9)
- Grover's quantum searching algorithm is optimal
- Quantum computers can search rapidly by using almost any transformation
- Grover Algorithm with zero theoretical failure rate
- A different kind of quantum search
- On Arbitrary Phases in Quantum Amplitude Amplification
- A Family of Grover's Quantum Searching Algorithms
- Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
- Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion
- A Hybrid Quantum Search Engine: A Fast Quantum Algorithm for Multiple Matches