一句话：提出结构化量子编译方法，利用可交换双比特门顺序自由度，在IBM/Google架构上降低深度与门数。
现代量子线路常包含可交换的双比特算子，其顺序灵活性为编译优化提供了额外空间，但也因自由度增加而带来显著挑战。本文提出一种通用方法，为可扩展量子硬件寻找结构化解决方案：将复杂的编译问题分解为两个可在小规模下求解的子问题。进一步，作者将该结构化方法适配到实际问题，处理输入问题图的稀疏性以及真实硬件的噪声变化。评估在IBM与Google架构的耦合图上进行，规模最高达1024个量子比特，结果在深度和门数上均优于基线：深度最多降低72%，门数最多降低66%。在IBM Mumbai上的真实实验表明，该方法能找到比当前最优基线更低的期望最小能量。
A critical feature in today's quantum circuit is that they have permutable two-qubit operators. The flexibility in ordering the permutable two-qubit gates leads to more compiler optimization opportunities. However, it also imposes significant challenges due to the additional degree of freedom. Our Contributions are two-fold. We first propose a general methodology that can find structured solutions for scalable quantum hardware. It breaks down the complex compilation problem into two sub-problems that can be solved at small scale. Second, we show how such a structured method can be adapted to practical cases that handle sparsity of the input problem graphs and the noise variability in real hardware. Our evaluation evaluates our method on IBM and Google architecture coupling graphs for up to 1,024 qubits and demonstrate better result in both depth and gate count - by up to 72% reduction in depth, and 66% reduction in gate count. Our real experiments on IBM Mumbai show that we can find better expected minimal energy than the state-of-the-art baseline.
@inproceedings{paperbot10114,
title = {Exploiting the Regular Structure of Modern Quantum Architectures for Compiling and Optimizing Programs with Permutable Operators},
author = {Yuwei Jin and Fei Hua and Yanhao Chen and Ari Hayes and Chi Zhang and Eddy Z. Zhang},
booktitle = {ASPLOS},
year = {2023},
doi = {10.1145/3623278.3624751}
}