arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0310165quant-ph
收藏

利用三量子比特门加速量子算法

Acceleration of quantum algorithms using three-qubit gates

Juha J. Vartiainen, Antti O. Niskanen, Mikio Nakahara, Martti M. Salomaa

摘要:

为了克服退相干,量子电路优化对于量子计算的任何实际实现都是必不可少的。我们提出了一种实现量子线路编译的最后阶段的方案,即,用于在量子门库中找到各个模块的实际物理实现。我们发现,数值优化可以有效地利用,以产生适当的控制参数序列,产生所需的三个量子位模块内的约瑟夫森电荷量子位模型。我们的工作提出了一些方法,实际上可以大大减少实现给定量子线路所需的门的数量,从而减少空闲时间并显着加速量子算法的执行。

英文摘要:

Quantum-circuit optimization is essential for any practical realization of quantum computation, in order to beat decoherence. We present a scheme for implementing the final stage in the compilation of quantum circuits, i.e., for finding the actual physical realizations of the individual modules in the quantum-gate library. We find that numerical optimization can be efficiently utilized in order to generate the appropriate control-parameter sequences which produce the desired three-qubit modules within the Josephson charge-qubit model. Our work suggests ways in which one can in fact considerably reduce the number of gates required to implement a given quantum circuit, hence diminishing idle time and significantly accelerating the execution of quantum algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑