Error tolerance in an NMR Implementation of Grover's Fixed-Point Quantum Search Algorithm
arXiv:quant-ph/0504054 · doi:10.1103/PhysRevA.72.032326
Abstract
We describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance (NMR) quantum computer, searching for either one or two matching items in an unsorted database of four items. In this new algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, and so the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored.
5 Pages RevTex4 including three figures. Changes made at request of referees; now in press at Phys Rev A
References in corpus (10)
- Quantum Mechanics helps in searching for a needle in a haystack
- NMR Techniques for Quantum Control and Computation
- Tight bounds on quantum searching
- Grover's quantum searching algorithm is optimal
- Quantum computers can search rapidly by using almost any transformation
- Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer
- Implementation of a Quantum Algorithm to Solve Deutsch's Problem on a Nuclear Magnetic Resonance Quantum Computer
- Tackling Systematic Errors in Quantum Logic Gates with Composite Rotations
- Approximate quantum counting on an NMR ensemble quantum computer
- Practical Implementations of Twirl Operations
Cited by in corpus (12)
- A different kind of quantum search
- Quantum Computing with NMR
- NMR analogues of the quantum Zeno effect
- Geometric Algebra and Information Geometry for Quantum Computational Software
- Robust Logic Gates and Realistic Quantum Computation
- Effect of system level structure and spectral distribution of the environment on the decoherence rate
- Mixed state Pauli channel parameter estimation
- Controlling NMR spin systems for quantum computation
- Preparing pseudo-pure states with controlled-transfer gates
- Fault Models for Quantum Mechanical Switching Networks
- Optimization of probabilistic quantum search algorithm with a priori information
- Invariance of success probability in Grover's quantum search under local noise with memory