6
[1706.07884] Factoring with n+2 clean qubits and n-1 dirty qubits
source link: https://arxiv.org/abs/1706.07884
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
[Submitted on 23 Jun 2017 (v1), last revised 19 Jan 2018 (this version, v2)]
Factoring with n+2 clean qubits and n-1 dirty qubits
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.
Comments:
14 pages, 26 figures
Subjects:
Quantum Physics (quant-ph)
Cite as:
arXiv:1706.07884 [quant-ph]
(or
arXiv:1706.07884v2 [quant-ph] for this version)
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK