Thomas Häner

Factoring using 2n+2 qubits with Toffoli based modular multiplication

2016 · arXiv (Cornell University)

We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast to previous space-optimized implementations, ours features a purely Toffoli based modular multiplication circuit. The circuit depth and …