Simulation of Grover's quantum search algorithm in an Isingnuclearspinchain quantum computer with first and secondnearestneighbour couplings
Abstract
We implement Grover's quantum search algorithm on a nuclear spinchain quantum computer, taking Isingtype interactions between nearest and secondnearest neighbours into account. The performance of this implementation 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 obtain pronounced maxima at frequencies which fulfil the condition of the 2πkmethod with respect to the secondnearest neighbour interactions.
 Publication:

Journal of Physics B Atomic Molecular Physics
 Pub Date:
 March 2008
 DOI:
 10.1088/09534075/41/5/055504
 arXiv:
 arXiv:0710.3196
 Bibcode:
 2008JPhB...41e5504L
 Keywords:

 Quantum Physics
 EPrint:
 10 pages, 4 figures