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

arXiv:0709.1424 · Physical Review Letters

Gauss Sum Factorization with Cold Atoms

Michael Gilowski, Thijs Wendrich, T. Müller, Ch. Jentsch, Wolfgang A. Ertmer, Ernst Maria Rasel, Wolfgang P. Schleich

Published Jan 24, 2008• 82 citations
arXivHTMLPDF

Abstract

We report the first implementation of a Gauss sum factorization algorithm by an internal state Ramsey interferometer using cold atoms. A sequence of appropriately designed light pulses interacts with an ensemble of cold rubidium atoms. The final population in the involved atomic levels determines a Gauss sum. With this technique we factor the number N=263193.

DOI
10.1103/physrevlett.100.030201

Related papers

Factorizing numbers with the Gauss sum technique: NMR implementations

T. S. Mahesh, Nageswaran Rajendran, Xinhua Peng +1 more

Several physics-based algorithms for factorizing large numbers were recently presented. A notable recent algorthm by Schleich et al. uses Gauss sums for distinguishing between factors and nonfactors. We demonstrate two NMR techniques that evaluate Gauss sums and thus implement their algorithm. The first one is based on differential excitation of a single spin magnetization by a cascade of rf pulses. The second method is based on spatial averaging and selective refocusing of magnetization for Gauss sums corresponding to factors. All factors of 16 637 and 52 882 363 are successfully obtained.

arXiv:quant-ph/0701205•Physical Review A•Jun 4, 2007•42 citations

Factorizing numbers with the Gauss sum technique

Dieter Suter, T. S. Mahesh, Nageswaran Rajendran +1 more

Several physics-based algorithms for factorizing large numbers were recently presented. A notable recent algorthm by Schleich et al. uses Gauss sums for distinguishing between factors and nonfactors. We demonstrate two NMR techniques that evaluate Gauss sums and thus implement their algorithm. The first one is based on differential excitation of a single spin magnetization by a cascade of rf pulses. The second method is based on spatial averaging and selective refocusing of magnetization for Gauss sums corresponding to factors. All factors of 16 637 and 52 882 363 are successfully obtained.

•Jun 4, 2007•25 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 implementation of factoring large numbers with Gauß sums: Suppression of ghost factors

Xinhua Peng, Dieter Suter

Finding the factors of an integer can be achieved by various experimental techniques, based on an algorithm developed by Schleich et al . ( Fortschr. Phys. , 54 (2006) 856), which uses specific properties of Gauß sums. Experimental limitations usually require truncation of these series, but if the truncation parameter is too small, it is no longer possible to distinguish between factors and so-called “ghost" factors. Here, we discuss two techniques for distinguishing between true factors and ghost factors while keeping the number of terms in the sum constant or only slowly increasing. We experimentally test these modified algorithms in a nuclear spin system, using NMR.

arXiv:0803.3396•Europhysics Letters (EPL)•Nov 1, 2008•24 citations

Factorizing numbers with classical interference: several implementations in optics

Andon A. Rangelov

Truncated Fourier, Gauss, Kummer and exponential sums can be used to factorize numbers: for a factor these sums equal unity in absolute value, whereas they nearly vanish for any other number. We show how this factorization algorithm can emerge from superpositions of classical light waves and we present a number of simple implementations in optics.

arXiv:0811.2070•Journal of Physics B Atomic Molecular and Optical Physics•Jan 12, 2009•19 citations

Factorization of Numbers with the Temporal Talbot Effect: Optical Implementation by a Sequence of Shaped Ultrashort Pulses

Damien Bigourd, B. Chatel, Wolfgang P. Schleich +1 more

We report on the successful operation of an analogue computer designed to factor numbers. Our device relies solely on the interference of classical light and brings together the field of ultrashort laser pulses with number theory. Indeed, the frequency component of the electric field corresponding to a sequence of appropriately shaped femtosecond pulses is determined by a Gauss sum which allows us to find the factors of a number.

arXiv:0709.1906•Physical Review Letters•Jan 24, 2008•84 citations
We report the first implementation of a Gauss sum factorization algorithm by an internal state Ramsey interferometer using cold atoms. A sequence of appropriately designed light pulses interacts with an ensemble of cold rubidium atoms. The final population in the involved atomic levels determines a Gauss sum. With this technique we factor the number N=263193.
Several physics-based algorithms for factorizing large numbers were recently presented. A notable recent algorthm by Schleich et al. uses Gauss sums for distinguishing between factors and nonfactors. We demonstrate two NMR techniques that evaluate Gauss sums and thus implement their algorithm. The first one is based on differential excitation of a single spin magnetization by a cascade of rf pulses. The second method is based on spatial averaging and selective refocusing of magnetization for Gauss sums corresponding to factors. All factors of 16 637 and 52 882 363 are successfully obtained.
Several physics-based algorithms for factorizing large numbers were recently presented. A notable recent algorthm by Schleich et al. uses Gauss sums for distinguishing between factors and nonfactors. We demonstrate two NMR techniques that evaluate Gauss sums and thus implement their algorithm. The first one is based on differential excitation of a single spin magnetization by a cascade of rf pulses. The second method is based on spatial averaging and selective refocusing of magnetization for Gauss sums corresponding to factors. All factors of 16 637 and 52 882 363 are successfully obtained.
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.
Finding the factors of an integer can be achieved by various experimental techniques, based on an algorithm developed by Schleich et al . ( Fortschr. Phys. , 54 (2006) 856), which uses specific properties of Gauß sums. Experimental limitations usually require truncation of these series, but if the truncation parameter is too small, it is no longer possible to distinguish between factors and so-called “ghost" factors. Here, we discuss two techniques for distinguishing between true factors and ghost factors while keeping the number of terms in the sum constant or only slowly increasing. We experimentally test these modified algorithms in a nuclear spin system, using NMR.