Space-efficient and noise-robust quantum factoring
From MaRDI portal
Publication:6652983
Cites work
- scientific article; zbMATH DE number 1617936 (Why is no real title available?)
- scientific article; zbMATH DE number 5320229 (Why is no real title available?)
- scientific article; zbMATH DE number 5320241 (Why is no real title available?)
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- A quantum circuit for Shor's factoring algorithm using \(2n+2\) qubits
- Factoring polynomials with rational coefficients
- Fast multiplication of large numbers
- Integer multiplication in time \(O(n\log n)\)
- New Point Addition Formulae for ECC Applications
- On lattices, learning with errors, random linear codes, and cryptography
- On the Minimum Computation Time of Functions
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Should one always use repeated squaring for modular exponentiation?
- The expected number of random elements to generate a finite Abelian group
This page was built for publication: Space-efficient and noise-robust quantum factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652983)
