Authors
Craig Gidney
Publication date
2017/6/23
Journal
arXiv preprint arXiv:1706.07884
Description
We present reversible classical circuits for performing various arithmetic operations aided by dirty ancillae (i.e. extra qubits in an unknown state that must be restored before the circuit ends). We improve the number of clean qubits needed to factor an n-bit number with Shor's algorithm from 1.5n+O(1) to n+2, assisted by n-1 dirty qubits, without increasing the asymptotic size or depth of the circuit.
Scholar articles
C Gidney - arXiv preprint arXiv:1706.07884, 2017