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

@article{Jones1998ImplementationOA,
  title={Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer},
  author={J A Jones and Michele Mosca},
  journal={Journal of Chemical Physics},
  year={1998},
  volume={109},
  pages={1648-1653}
}
  • J. A. JonesM. Mosca
  • Published 14 January 1998
  • Physics, Computer Science
  • Journal of Chemical Physics
Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantum computing is fairly well understood, it has proved difficult to implement quantum computers in real physical systems. It has recently been shown that nuclear magnetic resonance (NMR) can be used to implement small quantum computers using the spin states of nuclei in carefully chosen small molecules. Here… 

Figures and Tables from this paper

Experimental realization of a quantum algorithm

Quantum computers can in principle exploit quantum-mechanical effects to perform computations (such as factoring large numbers or searching an unsorted database) more rapidly than classical

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

Basics of quantum computation

The Dynamics of Quantum Computing in Molecules

The application to molecular quantum computing is connected to the more general problem of the control of quantum dynamics using tailored laser fields determined theoretically with optimal control theory or genetic algorithms.

NMR Quantum Computing

Quantum computing is at the forefront of scientific and technological research and development of the 21st century. NMR quantum computing is one the most mature technologies for implementing quantum

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.

Nuclear magnetic resonance quantum computing exploiting the pure spin state of para hydrogen

Nuclear magnetic resonance (NMR) is well-suited to implement quantum algorithms experimentally. However, there are serious problems associated with the noisy mixed initial state that is described by

Quantum logic gates and nuclear magnetic resonance pulse sequences.

How NMR in principle can be used to implement all the elements required to build quantum computers is described, and comparisons between the pulse sequences involved and those of more conventional NMR experiments are drawn.

Experimental implementation of a quantum algorithm in a multiqubit NMR system formed by an oriented 7/2 spin

A growing appreciation among researchers is the use of quadrupolar nuclei with spin >1/2 as a suitable candidate for quantum information processing. Such systems have multiple qubits per nuclei and
...

References

SHOWING 1-10 OF 44 REFERENCES

Experimental realization of a quantum algorithm

Quantum computers can in principle exploit quantum-mechanical effects to perform computations (such as factoring large numbers or searching an unsorted database) more rapidly than classical

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

Experimental Implementation of Fast Quantum Searching

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 reading out the final state.

Quantum Computation and Shor's Factoring Algorithm

The authors give an exposition of Shor's algorithm together with an introduction to quantum computation and complexity theory, and discuss experiments that may contribute to its practical implementation.

Fast Searches with Nuclear Magnetic Resonance Computers

If a computer could be built from quantum elements, which can exist in superpositions of many states rather than the 1s and 0s of conventional binary logic, then important hard problems could be

Bulk Spin-Resonance Quantum Computation

A new approach to quantum computing is introduced based on the use of multiple-pulse resonance techniques to manipulate the small deviation from equilibrium of the density matrix of a macroscopic ensemble so that it appears to be the density Matrix of a much lower dimensional pure state.

Ensemble quantum computing by NMR spectroscopy

A new computational model is presented, which differs from a QC only in that the result of a measurement is the expectation value of the observable, rather than a random eigenvalue thereof, which can solve nondeterministic polynomial-time complete problems inPolynomial time.

Quantum Computers, Factoring, and Decoherence

Here it is shown how the decoherence process degrades the interference pattern that emerges from the quantum factoring algorithm, a problem of practical significance for cryptographic applications.

Active Stabilization, Quantum Computation, and Quantum State Synthesis

Active stabilization of a quantum system is the active suppression of noise (such as decoherence) in the system, without disrupting its unitary evolution. Quantum error correction suggests the

Decoherence limits to quantum computation using trapped ions

  • M. PlenioP. Knight
  • Physics
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1997
We investigate the problem of factorization of large numbers on a quantum computer which we imagine to be realized within a linear ion trap. We derive upper bounds on the size of the numbers that can