# Reducing the Number of Qubits in Quantum Factoring

> For the complete documentation index, see [llms.txt](/llms.txt). This markdown page mirrors [the canonical HTML page](/quantum-news/2024/reducing-the-number-of-qubits-in-quantum-factoring/).



The paper presents an optimization for reducing the number of qubits required in quantum factoring, specifically targeting Shor's algorithm. By employing a combination of techniques, including May and Schlieper's truncation and the Ekerå-Håstad variant, the authors achieve a significant reduction in qubit requirement to factor an RSA-2048 instance, potentially using less than 1700 qubits 

Published: 2024-02-13
Updated: 2024-02-13





Source: iacr.org














The paper presents an optimization for reducing the number of qubits required in quantum factoring, specifically targeting Shor’s algorithm. By employing a combination of techniques, including May and Schlieper’s truncation and the Ekerå-Håstad variant, the authors achieve a significant reduction in qubit requirement to factor an RSA-2048 instance, potentially using less than 1700 qubits