Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance

We demonstrate a five-bit nuclear-magnetic-resonance quantum computer that distinguishes among various functions on four bits, making use of quantum parallelism. Its construction draws on the recognition of the sufficiency of linear coupling along a chain of nuclear spins, the synthesis of a suitably coupled molecule, and the use of a multi-channel spectrometer.

In this work, we experimentally demonstrate the implementation of a recently proposed robust and state-independent heat-bath algorithmic cooling (HBAC) method [1] on an NMR quantum processor. While HBAC methods improve the purity of a quantum system via iterative unitary entropy compression, they are difficult to implement experimentally since they use sort operations that are different for each iteration. The new robust HBAC method proved that optimal HBAC is possible withou...

In this essay we discuss the issue of quantum information and recent nuclear magnetic resonance (NMR) experiments. We explain why these experiments should be regarded as quantum information processing (QIP) despite the fact that, in present liquid state NMR experiments, no entanglement is found. We comment on how these experiments contribute to the future of QIP and include a brief discussion on the origin of the power of quantum computers.

We report the realization, using nuclear magnetic resonance techniques, of the first quantum computer that reliably executes an algorithm in the presence of strong decoherence. The computer is based on a quantum error avoidance code that protects against a class of multiple-qubit errors. The code stores two decoherence-free logical qubits in four noisy physical qubits. The computer successfully executes Grover's search algorithm in the presence of arbitrarily strong engineere...

Recently developed quantum algorithms suggest that in principle, quantum computers can solve problems such as simulation of physical systems more efficiently than classical computers. Much remains to be done to implement these conceptual ideas into actual quantum computers. As a small-scale demonstration of their capability, we simulate a simple many-fermion problem, the Fano-Anderson model, using liquid state Nuclear Magnetic Resonance (NMR). We carefully designed our experi...

We report on the current state of factoring integers on both digital and analog quantum computers. For digital quantum computers, we study the effect of errors for which one can formally prove that Shor's factoring algorithm fails. For analog quantum computers, we experimentally test three factorisation methods and provide evidence for a scaling performance that is absolutely and asymptotically better than random guessing but still exponential. We conclude with an overview of...

This in an introduction on quantum computing and on the use of NMR to build quantum computers, geared towards an NMR audience.

This is a short introduction to Quantum Computing intended for physicists. The basic idea of a quantum computer is introduced. Then we concentrate on Shor's integer factoring algorithm.

Shor and Grover demonstrated that a quantum computer can outperform any classical computer in factoring numbers and in searching a database by exploiting the parallelism of quantum mechanics. Whereas Shor's algorithm requires both superposition and entanglement of a many-particle system, the superposition of single-particle quantum states is sufficient for Grover's algorithm. Recently, the latter has been successfully implemented using Rydberg atoms. Here we propose an implem...

The procedure for simulating the nuclear magnetic resonance spectrum linked to the spin system of a molecule for a certain nucleus entails diagonalizing the associated Hamiltonian matrix. As the dimensions of said matrix grow exponentially with respect to the spin system's atom count, the calculation of the eigenvalues and eigenvectors marks the performance of the overall process. The aim of this paper is to provide a formalization of the complete procedure of the simulation ...