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}
}
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

Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer
The simulation of quantum mechanical systems with classical computers appears to be a computationally intractable problem. In 1982 Feynman reversed this observation, suggesting that quantum
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
A simulator for ensemble quantum computing
A quantum computer simulator based on the principles of ensemble quantum computing using nuclear magnetic resonance (NMR) is presented. The first version of ensemble quantum computer simulator
Basics of quantum computation
Abstract Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical
The Dynamics of Quantum Computing in Molecules
TLDR
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.
Liquid-State NMR Quantum Computing
Processing of digital information has progressed at an enormous speed over the last few decades and thus become an indispensable resource. Still, for some computational problems, no efficient
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
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.
TLDR
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.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 34 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
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
Quantum Computation and Shor's Factoring Algorithm
Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations
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
TLDR
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
TLDR
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
TLDR
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. Plenio, P. 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
...
1
2
3
4
...