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
ChatGPT DALL-E
13th February 2024
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
13th February 2024
