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

@article{Vandersypen2001ExperimentalRO,
  title={Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance},
  author={Lieven M. K. Vandersypen and Matthias Steffen and Gregory Breyta and Costantino S. Yannoni and Mark H. Sherwood and Isaac L. Chuang},
  journal={Nature},
  year={2001},
  volume={414},
  pages={883-887}
}
The number of steps any classical computer requires in order to find the prime factors of an l-digit integer N increases exponentially with l, at least using algorithms known at present. Factoring large integers is therefore conjectured to be intractable classically, an observation underlying the security of widely used cryptographic codes. Quantum computers, however, could factor integers in only polynomial time, using Shor's quantum factoring algorithm. Although important for the study of… 

Figures and Topics from this paper

Factoring larger integers with fewer qubits via quantum annealing with optimized parameters
TLDR
This study optimize the problem Hamiltonian to reduce the number of qubits involved in the final Hamiltonian while maintaining the QUBO coefficients in a reasonable range, enabling the improved algorithm to factorize larger integers with fewer qubits.
Exact search algorithm to factorize large biprimes and a triprime on IBM quantum computer
Factoring large integers using a quantum computer is an outstanding research problem that can illustrate true quantum advantage over classical computers. Exponential time order is required in order
Shor’s factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers
The security of messages encoded via the widely used RSA public key encryption system rests on the enormous computational effort required to find the prime factors of a large number N using classical
Realization of a scalable Shor algorithm
TLDR
The realization of a scalable Shor algorithm, as proposed by Kitaev, is presented, which has been realized scalably within an ion-trap quantum computer and returns the correct factors with a confidence level exceeding 99%.
Quantum Fourier Transform and Its Application in Shor’s Algorithm
Quantum Fourier transform (QFT) plays an eminent role in quantum computation. It creates a superposition of different quantum states, allowing simultaneous calculation, which would take many steps
Using Shor's algorithm on near term Quantum computers: a reduced version
Considering its relevance in the field of cryptography, integer factorization is a prominent application where Quantum computers are expected to have a substantial impact. Thanks to Shor’s algorithm
Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
TLDR
This work demonstrates a scalable version of Shor's quantum factoring algorithm in which then qubit control register is replaced by a single qubit that is recycled n times: the total number of qubits is one third of that required in the standard protocol.
Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
TLDR
This work demonstrates a scalable version of Shor's quantum factoring algorithm in which then qubit control register is replaced by a single qubit that is recycled n times: the total number of qubits is one third of that required in the standard protocol.
Demonstration of Shor's factoring algorithm for N [Formula: see text] 21 on IBM quantum processors.
TLDR
This work implemented the quantum order-finding algorithm for factoring the integer 21 using only five qubits and successfully verified the presence of entanglement between the control and work register qubits, which is a necessary condition for the algorithm's speedup in general.
Quantum Factoring Algorithm: Resource Estimation and Survey of Experiments
TLDR
This study investigates the details of quantum circuits used in several factoring experiments and indicates that some of the circuits have been constructed under the condition that the order of an element modulo a target composite is known in advance.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 42 REFERENCES
Efficient networks for quantum factoring.
TLDR
The number of memory quantum bits (qubits) and the number of operations required to perform factorization, using the algorithm suggested by Shor are estimated.
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.
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Mathematics, Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
TLDR
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.
An algorithmic benchmark for quantum information processing
TLDR
An experimental realization of an algorithmic benchmark using an NMR technique that involves coherent manipulation of seven qubits is reported, which can be used as a reliable and efficient method for creating a standard pseudopure state, the first step for implementing traditional quantum algorithms in liquid state NMR systems.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  • P. Shor
  • Computer Science, Mathematics
    SIAM Rev.
  • 1999
TLDR
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems.
Experimental realization of an order-finding algorithm with an NMR quantum computer.
TLDR
A nuclear magnetic resonance quantum computer which combines the quantum Fourier transform with exponentiated permutations is realization, demonstrating a quantum algorithm for order finding which has the same structure as Shor's algorithm and its speed-up over classical algorithms scales exponentially.
Implementation of a three-quantum-bit search algorithm
We report the experimental implementation of Grover’s quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of 13C-labeled CHFBr2, in which the
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.
Molecular scale heat engines and scalable quantum computation
TLDR
N procedure that extracts the asymptotically optimal fraction of purified bits is given, and a quasi-linear time implementation of the procedure is given in a model motivated by NMR quantum computing.
An approximate Fourier transform useful in quantum factoring", IBM Research Report RC19642 ,; R. Cle
We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring
...
1
2
3
4
5
...