Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Science

The Usefulness of NMR Quantum Computing

Warren S. Warren

Published Sep 12, 1997• 253 citations
Publisher

Abstract

Quantum computing—the manipulation of a quantum mechanical system to do information processing—has attracted considerable recent attention, largely triggered by Shor's proposed algorithm for finding prime factors in polynomial instead of exponential time ([1][1]). The importance of this problem
DOI
10.1126/science.277.5332.1688

Related papers

Quantum Information and Nuclear Magnetic Resonance Parameters

Jéssica Boreli dos Reis Lino, Teodorico C. Ramalho

Regarding the end of the 1900s, a small community of researchers in physics, computer science, mathematics and chemistry began to explore the fertile ground at the intersection of quantum mechanics with information theory, which led to a new and powerful paradigm of quantum computing.Quantum information processing promises to extend today's computing resources.Quantum computers, theoretically, could solve problems much more quickly than any classic computer.Intensive experimental efforts have been made to implement quantum computing since Shor and Grover developed their algorithms.In 1997, Nuclear Magnetic Resonance (NMR) emerged as one of the most promising experimental techniques for the implementation of quantum computing protocols.The isolation of nuclear spins and consequent long relaxation times, combined with the perfect dynamics implemented by radiofrequency pulses, led to important studies in the area.Therefore, nuclear spins are picked out as good candidates for quantum bits.In this scenario, quantum chemistry covers a vast field of quantum information science and can lead to advances in scientific research.

Revista Virtual de Química•Jan 1, 2018•2 citations

A prime factorization based on quantum dynamics on a spin ensemble (I)

Xijia Miao

In this paper it has been described how to use the unitary dynamics of quantum mechanics to solve the prime factorization problem on a spin ensemble without any quantum entanglement. The ensemble quantum computation for the prime factorization is based on the basic principle that both a closed quantum system and its ensemble obey the same unitary dynamics of quantum mechanics if there is not any decoherence effect in both the quantum system and its ensemble. It uses the NMR multiple-quantum measurement techniques to output the quantum computational results that are the inphase multiple-quantum spectra of the spin ensemble. It has been shown that the inphase NMR multiple-quantum spectral intensities used to search for the period of the modular exponential function may reduce merely in a polynomial form as the qubit number of the spin ensemble. The time evolution process of the modular exponential operation on the quantum computer obeys the unitary dynamics of quantum mechanics and hence the computational output is governed by the quantum dynamics. This essential difference between the quantum computer and the classical one could be the key point for the quantum computation outperforming the classical one in the prime factorization on a spin ensemble without any quantum entanglement. It has been shown that the prime factorization based on the quantum dynamics on a spin ensemble is locally efficient at least. This supports the conjecture that the quantum dynamics could play an important role for the origin of power of quantum computation and quantum entanglement could not be a unique resource to achieve power of quantum computation in the prime factorization.

arXiv:quant-ph/0302153•Feb 20, 2003•2 citations

The Use of NMR for Solving the Problems of Quantum Computers

Vladimir V. Voronov

The analysis of papers on usage NMR in quantum computations is provided and the probable direction of the future investigations are considered.

arXiv:quant-ph/0102021•Feb 5, 2001•3 citations

Shor's factorization algorithm

E. Desurvire

This chapter describes what is generally considered to be one of the most important and historical contributions to the field of quantum computing, namely Shor's factorization algorithm . As its name indicates, this algorithm makes it possible to factorize numbers, which consists in their decomposition into a unique product of prime numbers. Other classical factorization algorithms previously developed have a complexity or computing time that increases exponentially with the number size, making the task intractable if not hopeless for large numbers. In contrast, Shor's algorithm is able to factor a number of any size in polynomial time , making the factorization problem tractable should a quantum computer ever be realized in the future. Since Shor's algorithm is based on several nonintuitive properties and other mathematical subtleties, this chapter presents a certain level of difficulty. With the previous chapters and tools readily assimilated, and some patience in going through the different preliminary steps required, such a difficulty is, however, quite surmountable. I have sought to make this description of Shor's algorithm as mathematically complete as possible and crack-free, while avoiding some academic considerations that may not be deemed necessary from any engineering perspective. Eventually, Shor's algorithm is described in only a few basic instructions. What is conceptually challenging is to grasp why it works so well, and also to feel comfortable with the fact that its implementation actually takes a fair amount of trial and error. The two preliminaries of Shor's algorithm are the phase estimation and the related order-finding algorithms.

Cambridge University Press eBooks•Feb 19, 2009•0 citations

Controlling NMR spin systems for quantum computation

Jonathan A. Jones

Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put forward. After a few years of rapid growth, leading to an implementation of Shor's quantum factoring algorithm in a seven-spin system, the field started to reach its natural limits and further progress became challenging. Rather than pursuing more complex algorithms on larger systems, interest has now largely moved into developing techniques for the precise and efficient manipulation of spin states with the aim of developing methods that can be applied in other more scalable technologies and within conventional NMR. However, the user friendliness of NMR implementations means that they remain popular for proof-of-principle demonstrations of simple quantum information protocols.

arXiv:2402.01308•Progress in Nuclear Magnetic Resonance Spectroscopy•Feb 9, 2024•23 citations

Factoring semi-primes with (quantum) SAT-solvers

Michele Mosca, Sebastian R. Verschoor

The computational difficulty of factoring large integers forms the basis of security for RSA public-key cryptography. The best-known factoring algorithms for classical computers run in sub-exponential time. The integer factorization problem can be reduced to the Boolean Satisfiability problem (SAT). While this reduction has proved to be useful for studying SAT solvers, large integers have not been factored via such a reduction. Shor's quantum factoring algorithm factors integers in expected polynomial time. Large-scale fault-tolerant quantum computers capable of implementing Shor's algorithm are not yet available, preventing relevant benchmarking experiments. Recently, several authors have attempted quantum factorizations via reductions to SAT or similar NP-hard problems. While this approach may shed light on algorithmic approaches for quantum solutions to NP-hard problems, in this paper we study and question its practicality. We find no evidence that this is a viable path toward factoring large numbers, even for scalable fault-tolerant quantum computers, as well as for various quantum annealing or other special purpose quantum hardware.

arXiv:1902.01448•Scientific Reports•May 14, 2022•22 citations
Regarding the end of the 1900s, a small community of researchers in physics, computer science, mathematics and chemistry began to explore the fertile ground at the intersection of quantum mechanics with information theory, which led to a new and powerful paradigm of quantum computing.Quantum information processing promises to extend today's computing resources.Quantum computers, theoretically, could solve problems much more quickly than any classic computer.Intensive experimental efforts have been made to implement quantum computing since Shor and Grover developed their algorithms.In 1997, Nuclear Magnetic Resonance (NMR) emerged as one of the most promising experimental techniques for the implementation of quantum computing protocols.The isolation of nuclear spins and consequent long relaxation times, combined with the perfect dynamics implemented by radiofrequency pulses, led to important studies in the area.Therefore, nuclear spins are picked out as good candidates for quantum bits.In this scenario, quantum chemistry covers a vast field of quantum information science and can lead to advances in scientific research.
In this paper it has been described how to use the unitary dynamics of quantum mechanics to solve the prime factorization problem on a spin ensemble without any quantum entanglement. The ensemble quantum computation for the prime factorization is based on the basic principle that both a closed quantum system and its ensemble obey the same unitary dynamics of quantum mechanics if there is not any decoherence effect in both the quantum system and its ensemble. It uses the NMR multiple-quantum measurement techniques to output the quantum computational results that are the inphase multiple-quantum spectra of the spin ensemble. It has been shown that the inphase NMR multiple-quantum spectral intensities used to search for the period of the modular exponential function may reduce merely in a polynomial form as the qubit number of the spin ensemble. The time evolution process of the modular exponential operation on the quantum computer obeys the unitary dynamics of quantum mechanics and hence the computational output is governed by the quantum dynamics. This essential difference between the quantum computer and the classical one could be the key point for the quantum computation outperforming the classical one in the prime factorization on a spin ensemble without any quantum entanglement. It has been shown that the prime factorization based on the quantum dynamics on a spin ensemble is locally efficient at least. This supports the conjecture that the quantum dynamics could play an important role for the origin of power of quantum computation and quantum entanglement could not be a unique resource to achieve power of quantum computation in the prime factorization.
This chapter describes what is generally considered to be one of the most important and historical contributions to the field of quantum computing, namely Shor's factorization algorithm . As its name indicates, this algorithm makes it possible to factorize numbers, which consists in their decomposition into a unique product of prime numbers. Other classical factorization algorithms previously developed have a complexity or computing time that increases exponentially with the number size, making the task intractable if not hopeless for large numbers. In contrast, Shor's algorithm is able to factor a number of any size in polynomial time , making the factorization problem tractable should a quantum computer ever be realized in the future. Since Shor's algorithm is based on several nonintuitive properties and other mathematical subtleties, this chapter presents a certain level of difficulty. With the previous chapters and tools readily assimilated, and some patience in going through the different preliminary steps required, such a difficulty is, however, quite surmountable. I have sought to make this description of Shor's algorithm as mathematically complete as possible and crack-free, while avoiding some academic considerations that may not be deemed necessary from any engineering perspective. Eventually, Shor's algorithm is described in only a few basic instructions. What is conceptually challenging is to grasp why it works so well, and also to feel comfortable with the fact that its implementation actually takes a fair amount of trial and error. The two preliminaries of Shor's algorithm are the phase estimation and the related order-finding algorithms.
Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put forward. After a few years of rapid growth, leading to an implementation of Shor's quantum factoring algorithm in a seven-spin system, the field started to reach its natural limits and further progress became challenging. Rather than pursuing more complex algorithms on larger systems, interest has now largely moved into developing techniques for the precise and efficient manipulation of spin states with the aim of developing methods that can be applied in other more scalable technologies and within conventional NMR. However, the user friendliness of NMR implementations means that they remain popular for proof-of-principle demonstrations of simple quantum information protocols.
The computational difficulty of factoring large integers forms the basis of security for RSA public-key cryptography. The best-known factoring algorithms for classical computers run in sub-exponential time. The integer factorization problem can be reduced to the Boolean Satisfiability problem (SAT). While this reduction has proved to be useful for studying SAT solvers, large integers have not been factored via such a reduction. Shor's quantum factoring algorithm factors integers in expected polynomial time. Large-scale fault-tolerant quantum computers capable of implementing Shor's algorithm are not yet available, preventing relevant benchmarking experiments. Recently, several authors have attempted quantum factorizations via reductions to SAT or similar NP-hard problems. While this approach may shed light on algorithmic approaches for quantum solutions to NP-hard problems, in this paper we study and question its practicality. We find no evidence that this is a viable path toward factoring large numbers, even for scalable fault-tolerant quantum computers, as well as for various quantum annealing or other special purpose quantum hardware.