Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms

arXiv2404.16450MaRDI QIDQ6532015FDOQ6532015

Authors: Cédric Pilatte 

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Lattices and convex bodies (number-theoretic aspects) (11H06) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Factorization (11Y05) Estimates on character sums (11L40)

This page was built for publication: Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms

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