曲速驱动量子计算
Warp-Drive Quantum Computation
摘要：
最近已经表明，时间最优量子计算是通过使用一个酉矩阵的Cartan分解来实现的。我们通过指出酉群是紧的来扩展这种方法。这允许我们通过向量子算法$U_{\rm alg}$添加额外的门$W$来进一步减少量子算法$U_{\rm alg}$的执行时间。该门$W$将$U_{\rm alg}$发送到另一个算法$WU_{\rm alg}$，该算法在比$U_{\rm alg}$更短的时间内可执行。我们称这种技术为曲速驱动。在这里，我们从理论和实验两方面证明了Grover算法的执行时间在两量子比特NMR量子计算机中减少。曲速驱动是一个潜在的强大工具，在加速算法和减少任何实现的错误。量子计算机
英文摘要：
Recently it has been shown that time-optimal quantum computation is attained by using the Cartan decomposition of a unitary matrix. We extend this approach by noting that the unitary group is compact. This allows us to reduce the execution time of a quantum algorithm $U_{\rm alg}$ further by adding an extra gate $W$ to it. This gate $W$ sends $U_{\rm alg}$ to another algorithm $WU_{\rm alg}$ which is executable in a shorter time than $U_{\rm alg}$. We call this technique warp-drive. Here we show both theoretically and experimentally that the execution time of Grover's algorithm is reduced in two-qubit NMR quantum computer. Warp-drive is potentially a powerful tool in accelerating algorithms and reducing the errors in any realization. of a quantum computer
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
