使用n+2个干净量子位和n-1个脏量子位的因子分解
Factoring with n+2 clean qubits and n-1 dirty qubits
摘要：
我们提出了用于执行各种算术运算的可逆经典电路，这些运算由脏辅助（即在电路结束之前必须恢复的未知状态中的额外量子位）辅助。我们将使用Shor算法分解n位数所需的干净量子位的数量从1.5n+O（1）提高到n+2，并辅以n-1个脏量子位，而不增加电路的渐近大小或深度。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
