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

Bootstrapping 浅层电路

Bootstrapping shallow circuits

Ning Bao, Gun Suer

AI总结:

本文提出通过递归切割电路并应用 LIL 算法学习子酉的浅层表示来优化量子电路深度,实现电路压缩,且算法时间复杂度相对于原电路深度呈对数关系。

摘要:

最近,人们发现了一种多项式时间的经典算法,用于学习作用于 n-qubits 的酉 U 的浅层表示,其方法是学习局部反演,然后使用 ancilla qubits 和 SWAP gates 将它们缝合在一起。在这项工作中,我们 bootstrap local inversion learning (LIL) 以通过学习其子酉的浅层表示来优化量子电路深度。我们递归地切割电路并应用 LIL 算法,如果算法能找到子电路的浅层表示,则用其替换子电路。如果找不到,我们就继续切割,直到优化终止,终止条件是找到浅层表示或达到 constant-depth 子电路。通过用浅层表示替换子电路,我们希望获得对量子电路的一定压缩。由于采用 binary search 结构,该优化算法的时间复杂度相对于原始给定电路的深度呈对数关系。

英文摘要:

Recently, a polynomial time classical algorithm has been found for learning the shallow representation of a unitary $U$ acting on $n$-qubits, by learning local inversions and then sewing them back together with ancilla qubits and SWAP gates. In this work, we bootstrap local inversion learning (LIL) to optimize quantum circuit depth by learning shallow representations for its sub-unitaries. We recursively cut circuits and apply the LIL algorithm to replace sub-circuits with their shallow representations, if it can be found by the algorithm. If not, we keep cutting until the optimization terminates, either by finding shallow representations or by reaching constant-depth sub-circuits. By replacing sub-circuits with their shallow representations, we hope to obtain some compression of the quantum circuit. Due to the binary search structure, the optimization algorithm has time complexity logarithmic in the depth of the original given circuit.

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

↑