Factorizing Numbers with the Gauss Sum Technique: NMR Implementations

Abstract

Several physics-based algorithms for factorizing large number were recently published. A notable recent one by Schleich et al. uses Gauss sums for distinguishing between factors and non-factors. 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 16637 and 52882363 are successfully obtained.

4 pages, 4 figures; Abstract and Conclusion are slightly modified. References added and formatted with Bibtex

References in corpus (1)

• Wave Packets can Factorize Numbers

Cited by in corpus (20)

• Quantum Computing with NMR
• Factorization of Numbers with the temporal Talbot effect: Optical implementation by a sequence of shaped ultrashort pulses
• Gauss sum factorization with cold atoms
• Nonadiabatic geometric quantum computation with cat qubits via invariant-based reverse engineering
• Factoring numbers with a single interferogram
• NMR implementation of Factoring Large Numbers with GaußSums: Suppression of Ghost Factors
• Prime Number Decomposition using the Talbot Effect
• Factorization of numbers with Gauss sums: I. Mathematical background
• New factorization algorithm based on a continuous representation of truncated Gauss sums
• Factorizing numbers with classical interference: several implementations in optics
• Quantum phase measurement and Gauss sum factorization of large integers in a superconducting circuit
• NMR implementations of Gauss sums
• Factorization of numbers with Gauss sums: II. Suggestions for implementations with chirped laser pulses
• Analogue algorithm for parallel factorization of an exponential number of large integers II. Optical implementation
• Chirped quasi-phase-matching with Gauss sums for production of biphotons
• Factorization of numbers with truncated Gauss sums at rational arguments
• Analogue algorithm for parallel factorization of an exponential number of large integers I. Theoretical description
• Factorization of numbers with Gauss sums: III. Algorithms with Entanglement
• Ghost factors in Gauss-sum factorization with transmon qubits
• An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem