Error tolerance in an NMR implementation of Grover's fixed-point quantum search algorithm

Journal Article · Thu Sep 15 00:00:00 EDT 2005 · Physical Review. A

DOI:https://doi.org/10.1103/PhysRevA.72.032326· OSTI ID:20718512

Li, Xiao; Jones, Jonathan A ^[1]

---

1. Centre for Quantum Computation, Clarendon Laboratory, University of Oxford, Parks Road, OX1 3PU (United Kingdom)

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.

• OSTI ID: 20718512
• Journal Information: Physical Review. A, Vol. 72, Issue 3; Other Information: DOI: 10.1103/PhysRevA.72.032326; (c) 2005 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
37 INORGANIC
ORGANIC
PHYSICAL AND ANALYTICAL CHEMISTRY
ALGORITHMS
ENERGY LEVELS
ERRORS
IMPLEMENTATION
NUCLEAR MAGNETIC RESONANCE
QUANTUM COMPUTERS
QUANTUM MECHANICS