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

  title={Simulation of Grover's quantum search algorithm in an Ising-nuclear-spin-chain quantum computer with first- and second-nearest-neighbour couplings},
  author={Gustavo V. L{\'o}pez and Thomas Gorin and Lorena Lara},
  journal={Journal of Physics B: Atomic, Molecular and Optical Physics},
We implement Grover's quantum search algorithm on a nuclear spin-chain quantum computer, taking Ising-type interactions between nearest and second-nearest 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… 
6 Citations

Simulation of static and random errors on Grover's search algorithm implemented in an Ising nuclear spin chain quantum computer with a few qubits

Grover's search algorithm on a model quantum computer implemented on a chain of four or five nuclear spins with first- and second-neighbour Ising interactions is considered, and the behaviour of the fidelity is analysed as a function of the noise intensity for static and random noise on either the Larmor frequencies or the Rabi frequency.

Measurement-enhanced quantum search

The oscillatory nature of the unitary Grover operator makes quantum searching difficult if one has no prior knowledge of the number of target states in the database. In this work, we coupled the

Quasi non-Markovian Approach to the Study of Decoherence of a Controlled-Not Quantum Gate in a Chain of Few Nuclear Spins Quantum Computer

We develop in the weak coupling approximation a quasi-non-Markovian master equation and study the phenomenon of decoherence during the operation of a controlled-not (CNOT) quantum gate in a quantum

Diamond as a Solid State Quantum Computer with a Linear Chain of Nuclear Spins System

By removing a 12C atom from the tetrahedral configuration of the diamond, replacing it by a 13C atom, and repeating this in a linear direction, it is possible to have a linear chain of nuclear

Study of Decoherence of Entangled States Made up of Two Basic States in a Linear Chain of Three Qubits

Using Lindblad approach to study decoherence of quantum systems, we study the decoherence and decay of entangled states, formed by two basic states of a chain of thee qubits. We look on these states



Quantum Computation in a Ising Spin Chain Taking into Account Second Neighbor Couplings

Abstract We consider the realization of a quantum computer in a chain of nuclear spins coupled by an Ising interaction. Quantum algorithms can be performed with the help of appropriate

Numerical simulation of a controlled–controlled-not (CCN) quantum gate in a chain of three interacting nuclear spins system

We present a study of a quantum controlled–controlled-not gate, implemented in a chain of three nuclear spins weakly Ising interacting between all of them, that is, taking into account first and

Simulations of quantum-logic operations in a quantum computer with a large number of qubits

We report the simulations of the dynamics of quantum-logic operations with large number of qubits (up to 1000). A nuclear-spin chain in which selective excitations of spins are provided by the

Grover search with pairs of trapped ions

The desired interference required for quantum computing may be modified by the wave function oscillations for the implementation of quantum algorithms[Phys.Rev.Lett.84(2000)1615]. To diminish such

Implementation of a quantum search algorithm on a quantum computer

In 1982 Feynman observed that quantum-mechanical systems have an information-processing capability much greater than that of corresponding classical systems, and could thus potentially be used to

Decoherence of an n-qubit quantum memory.

This work analyzes decoherence of a quantum register in the absence of nonlocal operations, i.e., n noninteracting qubits coupled to an environment in terms of a sum rule which implies linear scaling in the number of qubits.

Quantum Computers Can Search Rapidly by Using Almost Any Transformation

This paper shows that this algorithm for exhaustive search can be implemented by replacing the W-H transform by almost any quantum mechanical operation, which leads to several new applications where it improves the number of steps by a square-root.

Experimental one-way quantum computing

The implementation of Grover's search algorithm demonstrates that one-way quantum computation is ideally suited for such tasks.

Spin dynamics for bosons in an optical lattice

We study the internal dynamics of bosonic atoms in an optical lattice. Within the regime in which the atomic crystal is a Mott insulator with one atom per well, the atoms behave as localized spins