量子进位保存算法
Quantum Carry-Save Arithmetic
摘要：
本文介绍了如何利用从经典计算机设计中借鉴来的“进位保留”技术，从量子门中设计出高效的算术元件。这允许对Shor算法所需的所有算术元素进行位并行计算，包括模算术，将所有进位传播推迟到整个计算结束。这将量子门延迟从O（N^3）减少到O（N log N），代价是将所需的量子位数从O（N）增加到O（N^2）。
英文摘要：
This paper shows how to design efficient arithmetic elements out of quantum gates using "carry-save" techniques borrowed from classical computer design. This allows bit-parallel evaluation of all the arithmetic elements required for Shor's algorithm, including modular arithmetic, deferring all carry propagation until the end of the entire computation. This reduces the quantum gate delay from O(N^3) to O(N log N) at a cost of increasing the number of qubits required from O(N) to O(N^2).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
