论文标题
量子算法基于量子傅里叶变换，用于逐局添加
Quantum Algorithm based on Quantum Fourier Transform for Register-by-Constant Addition
论文作者
论文摘要
由于Shor对使用量子计算来考虑质数产品的方法的命题，因此已经寻求实施有效的量子算术算法。这些算法能够使用量子并行性在大型值上同时应用算术操作。 Draper根据量子傅立叶变换提出了一种添加算法，其操作数为两个量子寄存器，我称之为逐登录。但是，对于需要向目标寄存器添加恒定值的情况，Draper的算法比使用的操作数量和使用的Qubits数量要复杂。在本文中，对于需要在目标寄存器中添加一个常数的情况，我提出了比Draper更有效的添加算法。
Since Shor's proposition of the method for factoring products of prime numbers using quantum computing, there has been a quest to implement efficient quantum arithmetic algorithms. These algorithms are capable of applying arithmetic operations simultaneously on large sets of values using quantum parallelism. Draper proposed an addition algorithm based on the quantum Fourier transform whose operands are two quantum registers, which I refer to as register-by-register addition. However, for cases where there is the need to be added a constant value to a target register, Draper's algorithm is more complex than necessary in terms of number of operations and number of qubits used. In this paper, I present a more efficient addition algorithm than Draper's for cases where there needs to be added just a constant to a target register.
