Factorizing numbers with classical interference: several implementations in optics

Abstract

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.

References in corpus (6)

• NMR experiment factors numbers with Gauss sums
• Factorization of Numbers with the temporal Talbot effect: Optical implementation by a sequence of shaped ultrashort pulses
• Gauss sum factorization with cold atoms
• Factorizing Numbers with the Gauss Sum Technique: NMR Implementations
• NMR implementations of Gauss sums
• Chirping a two-photon transition in a multi-state ladder

Cited by in corpus (8)

• Prime Factorization Using Magnonic Holographic Device
• Factoring numbers with a single interferogram
• Factorization of numbers with Gauss sums: I. Mathematical background
• New factorization algorithm based on a continuous representation of truncated Gauss sums
• Analogue algorithm for parallel factorization of an exponential number of large integers I. Theoretical description
• Quantum Path Computing: Computing Architecture with Propagation Paths in Multiple Plane Diffraction of Classical Sources of Fermion and Boson Particles
• Ghost factors in Gauss-sum factorization with transmon qubits
• An optical Eratosthenes' sieve for large prime numbers