Factorization with exponential sums
From MaRDI portal
Publication:3518638
DOI10.1088/1751-8113/41/30/304024zbMath1144.81010OpenAlexW2029342870WikidataQ62447090 ScholiaQ62447090MaRDI QIDQ3518638
M. Suhail Zubairy, M. Štefaňák, Wolfgang Merkel, W. P. Schleich, Daniel Haase
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
Analysis of algorithms (68W40) Quantum computation (81P68) Randomized algorithms (68W20) Geometric optics (78A05)
Related Items (6)
Factorization of numbers with truncated Gauss sums at rational arguments ⋮ New factorization algorithm based on a continuous representation of truncated Gauss sums ⋮ Factorization of numbers with Gauss sums: I. Mathematical background ⋮ FACTORIZATION OF INTEGERS WITH MULTI-PATH OPTICAL INTERFERENCE ⋮ 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
This page was built for publication: Factorization with exponential sums
