Experimental Implementation of Fast Quantum Searching

  title={Experimental Implementation of Fast Quantum Searching},
  author={Isaac L. Chuang and Neil A. Gershenfeld and Mark Kubinec},
  journal={Physical Review Letters},
Using nuclear magnetic resonance techniques with a solution of chloroform molecules we implement Grover’s search algorithm for a system with four states. By performing a tomographic reconstruction of the density matrix during the computation good agreement is seen between theory and experiment. This provides the first complete experimental demonstration of loading an initial state into a quantum computer, performing a computation requiring fewer steps than on a classical computer, and then… 

Figures from this paper

Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer

This paper shows how a quantum mechanical Turing machine described in 1985 can be used to implement a fast quantum search algorithm initially developed by Grover, and can be demonstrated using a computer with two quantum bits to search a two bit domain in which one of the four elements satisfies the function.

Experimental quantum computation with nuclear spins in liquid solution

Using nuclear spins and magnetic resonance techniques at room temperature, this work provided proof of principle of quantum computing in a series of experiments which culminated in the implementation of the simplest instance of Shor’s quantum algorithm for prime factorization, using a seven-spin molecule.

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

A prototype quantum computer using nuclear spins in liquid solution

Insight is provided into what is needed to build a practical quantum computer, and several tools and techniques that will be useful in future large-scale implementations of quantum computers are delivered.

Operating Quantum States in Single Magnetic Molecules: Implementation of Grover's Quantum Algorithm.

Grover's quantum algorithm is implemented, proposed to find an element in an unsorted list, using a single nuclear 3/2 spin carried by a Tb ion sitting in a single molecular magnet transistor, opening the way to novel quantum search algorithms.

Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer

This work demonstrates the use of a NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch’s problem (distinguishing between constant and balanced functions).

Spectral implementation of some quantum algorithms by one- and two-dimensional nuclear magnetic resonance.

Spectral implementation of Grover's search algorithm, approximate quantum counting, a modified version of Berstein-Vazirani problem, and Hogg's algorithm are demonstrated here in three- and four-qubit systems.

Liquid-State NMR Quantum Computing

This article provides an introduction into the basic ideas that allow one to use quantum systems for computational purposes and discusses a few examples where NMR has been used for this purpose.




This work introduces several temporal averaging algorithms suitable for both high temperature and low temperature bulk quantum computing and analyzes the signal to noise behavior of each.

Principles of nuclear magnetic resonance in one and two dimensions

List of notation Introduction The dynamics of nuclear spin systems Manipulation of nuclear spin Hamiltonians One-dimensional Fourier spectroscopy Multiple-quantum transitions Two-dimensional Fourier

Phys. Rev. A

  • Phys. Rev. A
  • 1996

Int. J. Theor. Phys

  • Int. J. Theor. Phys
  • 1982


  • Rev. A 51, 992
  • 1995

LANL e-print quant-ph/9605034

  • Fortschr. Phys

Proc. R. Soc. London A

  • Proc. R. Soc. London A
  • 1998

Science 270

  • 1633
  • 1995

Int. J. Theor. Phys

  • Int. J. Theor. Phys
  • 1982