Reducing the Number of Qubits in Quantum Factoring

ePrint Report: Reducing the Number of Qubits in Quantum Factoring

Clémence Chevignard, Pierre-Alain Fouque, André Schrottenloher

This paper focuses on the optimization of the number of logical qubits in Shor's quantum factoring algorithm. As in previous works, we target the implementation of the modular exponentiation, which is the most costly component of the algorithm, both in qubits and operations.


In this paper, we show that using only $o(n)$ work qubits, one can obtain the first bit of the modular exponentiation …

algorithm eprint report factoring implementation modular optimization quantum qubits report shor target