Factorization with exponential sums

DOI10.1088/1751-8113/41/30/304024MaRDI QIDQ3518638zbMATH OpenOpenAlexWikidataFDO

Authors M. Štefaňák, Daniel Haase, Wolfgang Merkel, M. Suhail Zubairy, W. Schleich

Publication date 8 August 2008

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1751-8113/41/30/304024

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Geometric optics (78A05) Quantum computation (81P68)

Recommendations

• Factorization of numbers with Gauss sums. I: Mathematical background
• New factorization algorithm based on a continuous representation of truncated Gauss sums
• Factorization of numbers with truncated Gauss sums at rational arguments
• Factorization of numbers with physical systems
• Factorization of numbers with Gauss sums: III. Algorithms with entanglement

Cited in

(8)

• A partial factorization of the powersum formula
• Factorization of integers with multi-path optical interference
• Factorization of numbers with Gauss sums. I: Mathematical background
• Analogue algorithm for parallel factorization of an exponential number of large integers. II: Optical implementation
• Analogue algorithm for parallel factorization of an exponential number of large integers. I: Theoretical description
• Factorization of numbers with truncated Gauss sums at rational arguments
• New factorization algorithm based on a continuous representation of truncated Gauss sums
• Exponential sums and congruences with factorials

This page was built for publication: Factorization with exponential sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3518638)