Simulation of Grover's quantum search algorithm in a Ising nuclear spin chain quantum computer with first and second nearest neighbour couplings
arXiv:0710.3196 · doi:10.1088/0953-4075/41/5/055504
Abstract
We implement Grover's quantum search algorithm on a nuclear spin chain quantum computer, taking into Ising type interactions between nearest and second nearest neighbours into account. The performance of the realisation of the algorithm is studied by numerical simulations with four spins. We determine the temporal behaviour of the fidelity during the algorithm, and we compute the final fidelity as a function of the Rabi frequency. For the latter, we obtained pronounced maxima at frequencies which fulfil the condition of the (2πk)-method with respect to the second nearest neighbour interactions.
10 pages, 4 figures
References in corpus (17)
- Quantum Mechanics helps in searching for a needle in a haystack
- Experimental One-Way Quantum Computing
- Quantum Computing with Very Noisy Devices
- Dynamics of Loschmidt echoes and fidelity decay
- Quantum computers can search rapidly by using almost any transformation
- Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer
- Grover Algorithm with zero theoretical failure rate
- Spin dynamics for bosons in an optical lattice
- Effects of Noisy Oracle on Search Algorithm Complexity
- Grover search with pairs of trapped ions
- Implementation of three-qubit Grover search in cavity QED
- Simulations of Quantum Logic Operations in Quantum Computer with Large Number of Qubits
- Decoherence of an -qubit quantum memory
- Numerical simulation of a Controlled-Controlled-Not (CCN) quantum gate in a chain of three interacting nuclear spins system
- Robust quantum searching with spontaneously decaying qubits
- Quantum computation in a Ising spin chain taking into account second neighbor couplings
- Single-Pulse Preparation of the Uniform Superpositional State used in Quantum Algorithms