arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.01418quant-ph
收藏

利用无关项(Don't Cares)的量子态制备电路优化

Quantum State Preparation Circuit Optimization Exploiting Don't Cares

Hanyu Wang, Daniel Bochen Tan, Jason Cong

AI总结:

本文提出一种利用量子态制备电路中无关项条件的窥孔优化算法,通过替换不影响最终结果的局部酉操作,将双量子比特门数量较先前方法减少36%。

摘要:

量子态制备用于初始化量子寄存器,是运行量子算法的基础。设计能以更少双量子比特门高效纠缠量子比特的态制备电路,可提升精度并缓解器件上的耦合约束。现有方法先综合出初始电路,再利用编译器在保持酉等价性的前提下减少电路的门数。在本研究中,我们识别出量子电路中大量打破局部酉等价性却不会改变态制备整体结果的条件(即无关项,don't cares)。我们提出一种窥孔优化算法,在原始电路中识别此类可替换的酉操作。利用这些无关项条件,与先前方法相比,我们的算法将双量子比特门数量减少了36%。

英文摘要:

Quantum state preparation initializes the quantum registers and is essential for running quantum algorithms. Designing state preparation circuits that entangle qubits efficiently with fewer two-qubit gates enhances accuracy and alleviates coupling constraints on devices. Existing methods synthesize an initial circuit and leverage compilers to reduce the circuit's gate count while preserving the unitary equivalency. In this study, we identify numerous conditions within the quantum circuit where breaking local unitary equivalences does not alter the overall outcome of the state preparation (i.e., don't cares). We introduce a peephole optimization algorithm that identifies such unitaries for replacement in the original circuit. Exploiting these don't care conditions, our algorithm achieves a 36% reduction in the number of two-qubit gates compared to prior methods.

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

↑