Simulation of Grover's quantum search algorithm in a Ising nuclear spin chain quantum computer with first and second nearest neighbour couplings

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages, 4 figures

Scientific paper

10.1088/0953-4075/41/5/055504

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\pi k)-method with respect to the second nearest neighbour interactions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Simulation of Grover's quantum search algorithm in a Ising nuclear spin chain quantum computer with first and second nearest neighbour couplings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simulation of Grover's quantum search algorithm in a Ising nuclear spin chain quantum computer with first and second nearest neighbour couplings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulation of Grover's quantum search algorithm in a Ising nuclear spin chain quantum computer with first and second nearest neighbour couplings will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-11346

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.