Space-efficient and noise-robust quantum factoring

DOI10.1007/978-3-031-68391-6_4MaRDI QIDQ6652983FDOQ6652983

Authors: Seyoon Ragavan, Vinod Vaikuntanathan 

Publication date: 13 December 2024

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Factoring polynomials with rational coefficients
• Fast multiplication of large numbers
• On lattices, learning with errors, random linear codes, and cryptography
• Title not available (Why is that?)
• The expected number of random elements to generate a finite Abelian group
• New Point Addition Formulae for ECC Applications
• On the Minimum Computation Time of Functions
• Title not available (Why is that?)
• Integer multiplication in time \(O(n\log n)\)
• Quantum resource estimates for computing elliptic curve discrete logarithms
• Should one always use repeated squaring for modular exponentiation?
• Quantum algorithms for computing short discrete logarithms and factoring RSA integers
• Title not available (Why is that?)
• Title not available (Why is that?)
• A quantum circuit for Shor's factoring algorithm using \(2n+2\) qubits

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)