在使用核自旋的量子计算机中量子傅里叶变换的实际计算时间成本
Actual computational time-cost of the Quantum Fourier Transform in a quantum computer using nuclear spins
摘要：
我们发现，在使用核自旋的量子计算机中，对于大的n，QFT的实际计算时间成本是O（n2^n）。量子算法的计算成本通常被估计为量子图灵机（QTM）和量子线路等理想数学模型所需的通用门的总和。该成本与物理实现中的实际时间成本成比例，其中所有量子操作可以在同一时间内实现。然而，如果实现对于每个量子门花费不同的时间，则存在实际时间成本将具有与理想成本不同的行为的可能性。因此，我们通过考虑门控时间来估计这些实现中QFT的实际时间成本。实际的时间开销与复杂度分析估计的O（n^2）有很大的不同。
英文摘要：
We found that the actual computational time-cost of the QFT is O(n 2^n) for large n in a quantum computer using nuclear spins. The computational cost of a quantum algorithm has usually been estimated as the sum of the universal gates required in such ideal mathematical models as the Quantum Turing Machine(QTM) and the quantum circuit. This cost is proportional to an actual time-cost in the physical implementation where all quantum operations can be achieved in the same time. However, if the implementation takes a different time for each quantum gate, there is a possibility that the actual time-cost will have a different behavior from the ideal cost. So we estimated the actual time-cost of the QFT in these implementations by considering the gating time. The actual time-cost is drastically different from O(n^2) estimated by complexity analysis.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
