Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fixed-Point Quantum Search

Fixed-Point Quantum Search The quantum search algorithm consists of an iterative sequence of selective inversions and diffusion type operations, as a result of which it is able to find a state with desired properties (target state) in an unsorted database of size N in only N queries. This is achieved by designing the iterative transformations in a way that each iteration results in a small rotation of the state vector in a two-dimensional Hilbert space that includes the target state; if we choose the right number of iterative steps, we will stop just at the target state. This Letter shows that by replacing the selective inversions by selective phase shifts of π 3 , the algorithm preferentially converges to the target state irrespective of the step size or number of iterations. This feature leads to robust search algorithms and also to new schemes for quantum control and error correction. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Physical Review Letters American Physical Society (APS)

Fixed-Point Quantum Search

Physical Review Letters , Volume 95 (15) – Oct 7, 2005
4 pages

Loading next page...
 
/lp/american-physical-society-aps/fixed-point-quantum-search-lwzyZC0Bnz

References (15)

Publisher
American Physical Society (APS)
Copyright
Copyright © 2005 The American Physical Society
ISSN
1079-7114
DOI
10.1103/PhysRevLett.95.150501
pmid
16241706
Publisher site
See Article on Publisher Site

Abstract

The quantum search algorithm consists of an iterative sequence of selective inversions and diffusion type operations, as a result of which it is able to find a state with desired properties (target state) in an unsorted database of size N in only N queries. This is achieved by designing the iterative transformations in a way that each iteration results in a small rotation of the state vector in a two-dimensional Hilbert space that includes the target state; if we choose the right number of iterative steps, we will stop just at the target state. This Letter shows that by replacing the selective inversions by selective phase shifts of π 3 , the algorithm preferentially converges to the target state irrespective of the step size or number of iterations. This feature leads to robust search algorithms and also to new schemes for quantum control and error correction.

Journal

Physical Review LettersAmerican Physical Society (APS)

Published: Oct 7, 2005

There are no references for this article.