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

Contemporary Physics

NMR implementation of exponential sums for integer factorization

M. Štefaňák, W. Merkel, M. Mehring, W. P. Schleich

Published May 1, 2008• 2 citations
Publisher
DOI
10.1142/9789812818942_0006

Related papers

Analogue algorithm for parallel factorization of an exponential number of large integers: II—optical implementation

Vincenzo Tamma

arXiv:1505.04584•Quantum Information Processing•Nov 26, 2015•11 citations

NMR implementations of Gauss sums

Jonathan A. Jones

arXiv:0807.1608•Physics Letters A•Jul 17, 2008•14 citations

Analogue algorithm for parallel factorization of an exponential number of large integers: I. Theoretical description

Vincenzo Tamma

arXiv:1505.04577•Quantum Information Processing•Nov 23, 2015•8 citations

Comment on "NMR Experiment Factors Numbers with Gauss Sums"

Julia A. Wei Xiaohua Jones

Mehring et al. have recently described an elegant nuclear magnetic resonance (NMR) experiment implementing an algorithm to factor numbers based on the properties of Gauss sums. Similar experiments have also been described by Mahesh et al. In fact these algorithms do not factor numbers directly, but rather check whether a trial integer $\ell$ is a factor of a given integer $N$. Here I show that these NMR schemes cannot be used for factor checking without first implicitly determining whether or not $\ell$ is a factor of $N$.

arXiv:0704.2065•Apr 16, 2007•2 citations

NMR Experiment Factors Numbers with Gauss Sums

Michael Mehring, Klaus Müller, Ilya Sh. Averbukh +2 more

We factor the number 157573 using an NMR implementation of Gauss sums. Although the current implementation is classical and scales exponentially, we believe that an extension to the quantum regime using entangled states is possible.

arXiv:quant-ph/0609174•Physical Review Letters•Mar 22, 2007•85 citations

Quantum Algorithms for Integer Factorization

Song Yuan Yan

Springer eBooks•Jan 1, 2015•0 citations
Mehring et al. have recently described an elegant nuclear magnetic resonance (NMR) experiment implementing an algorithm to factor numbers based on the properties of Gauss sums. Similar experiments have also been described by Mahesh et al. In fact these algorithms do not factor numbers directly, but rather check whether a trial integer ℓ\ellℓ is a factor of a given integer NNN. Here I show that these NMR schemes cannot be used for factor checking without first implicitly determining whether or not ℓ\ellℓ is a factor of NNN.