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.1906 · Physical Review Letters

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

Damien Bigourd, B. Chatel, Wolfgang P. Schleich, B. Girard

Published Jan 24, 2008• 84 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.100.030202

Related papers

Factorization of numbers with Gauss sums: II. Suggestions for implementation with chirped laser pulses

W. Merkel, Sabine Wölk, Wolfgang P. Schleich +3 more

We propose three implementations of the Gauss sum factorization schemes discussed in part I of this series (Wölk et al 2011 New J. Phys. 13 103007): (i) a two-photon transition in a multi-level ladder system induced by a chirped laser pulse, (ii) a chirped one-photon transition in a two-level atom with a periodically modulated excited state and (iii) a linearly chirped one-photon transition driven by a sequence of ultrashort pulses. For each of these quantum systems, we show that the excitation probability amplitude is given by an appropriate Gauss sum. We provide rules on how to encode the number N to be factored in our system and how to identify the factors of N in the fluorescence signal of the excited state.

arXiv:1210.6487•New Journal of Physics•Oct 7, 2011•12 citations

Factoring numbers with interfering random waves

S. J. Weber, B. Chatel, B. Girard

We report on a new implementation of the factorisation of numbers using Gauss sums which improves tremendously the efficiency to eliminate all "ghost" factors. We show that by choosing randomly the terms in the Gauss sum, the required number of terms varies as ln N instead of . As an illustration, we present experimental results obtained by interfering thirty ultrashort laser pulses where we factorise 1340333404807. This new approach is totally general and can be implemented for all the experiments based on the Gauss sum.

Europhysics Letters (EPL)•Jul 29, 2008•21 citations

THEORETICAL AND EXPERIMENTAL STUDY OF A NEW ALGORITHM FOR FACTORING NUMBERS

Vincenzo Tamma

The security of codes, for example in credit card and government information, relies on the fact that the factorization of a large integer N is a rather costly process on a classical digital computer. Such a security is endangered by Shor's algorithm which employs entangled quantum systems to find, with a polynomial number of resources, the period of a function which is connected with the factors of N. We can surely expect a possible future realization of such a method for large numbers, but so far the period of Shor's function has been only computed for the number 15. Inspired by Shor's idea, our work aims to methods of factorization based on the periodicity measurement of a given continuous periodic factoring function which is physically implementable using an analogue computer. In particular, we have focused on both the theoretical and the experimental analysis of Gauss sums with continuous arguments leading to a new factorization algorithm. The procedure allows, for the first time, to factor several numbers by measuring the periodicity of Gauss sums performing first-order factoring'' interference processes. We experimentally implemented this idea by exploiting polychromatic optical interference in the visible range with a multi-path interferometer, and achieved the factorization of seven digit numbers. The physical principle behind this factoring interference procedure can be potentially exploited also on entangled systems, as multi-photon entangled states, in order to achieve a polynomial scaling in the number of resources.

•Jan 1, 2010•2 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•20 citations

Factoring numbers with ultrashort laser pulses

B. Chatel, Damien Bigourd, Elsa Baynard +4 more

Various schemes have been recently proposed to factor numbers with physical systems. Based on electromagnetic fields interacting with quantum systems, they operate as analog computers. Here we present several experimental demonstrations based on ultrashort pulses interacting with rubidium atoms.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 1, 2007•0 citations

Factorization of numbers with Gauss sums: I. Mathematical background

Sabine Wölk, W. Merkel, Wolfgang P. Schleich +2 more

We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and scales exponentially.

arXiv:1210.6474•New Journal of Physics•Oct 7, 2011•22 citations
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.
We propose three implementations of the Gauss sum factorization schemes discussed in part I of this series (Wölk et al 2011 New J. Phys. 13 103007): (i) a two-photon transition in a multi-level ladder system induced by a chirped laser pulse, (ii) a chirped one-photon transition in a two-level atom with a periodically modulated excited state and (iii) a linearly chirped one-photon transition driven by a sequence of ultrashort pulses. For each of these quantum systems, we show that the excitation probability amplitude is given by an appropriate Gauss sum. We provide rules on how to encode the number N to be factored in our system and how to identify the factors of N in the fluorescence signal of the excited state.
We report on a new implementation of the factorisation of numbers using Gauss sums which improves tremendously the efficiency to eliminate all "ghost" factors. We show that by choosing randomly the terms in the Gauss sum, the required number of terms varies as ln N instead of . As an illustration, we present experimental results obtained by interfering thirty ultrashort laser pulses where we factorise 1340333404807. This new approach is totally general and can be implemented for all the experiments based on the Gauss sum.
The security of codes, for example in credit card and government information, relies on the fact that the factorization of a large integer N is a rather costly process on a classical digital computer. Such a security is endangered by Shor's algorithm which employs entangled quantum systems to find, with a polynomial number of resources, the period of a function which is connected with the factors of N. We can surely expect a possible future realization of such a method for large numbers, but so far the period of Shor's function has been only computed for the number 15. Inspired by Shor's idea, our work aims to methods of factorization based on the periodicity measurement of a given continuous periodic factoring function which is physically implementable using an analogue computer. In particular, we have focused on both the theoretical and the experimental analysis of Gauss sums with continuous arguments leading to a new factorization algorithm. The procedure allows, for the first time, to factor several numbers by measuring the periodicity of Gauss sums performing first-order factoring'' interference processes. We experimentally implemented this idea by exploiting polychromatic optical interference in the visible range with a multi-path interferometer, and achieved the factorization of seven digit numbers. The physical principle behind this factoring interference procedure can be potentially exploited also on entangled systems, as multi-photon entangled states, in order to achieve a polynomial scaling in the number of resources.