Phys. Rev. A 72, 032326 (2005) [4 pages]Error tolerance in an NMR implementation of Grover’s fixed-point quantum search algorithmReceived 8 April 2005; published 22 September 2005 We describe an implementation of Grover’s fixed-point quantum search algorithm on a nuclear magnetic resonance quantum computer, searching for either one or two matching items in an unsorted database of four items. In this algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, so that the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored. © 2005 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.72.032326
DOI:
10.1103/PhysRevA.72.032326
PACS:
03.67.Lx, 82.56.−b
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.