用SAT方法实现量子线路布局的深度最优合成，显著提升效率。
Depth-Optimal Quantum Layout Synthesis as SAT
- 将量子线路布局合成问题转化为SAT编码，直接优化电路深度
- 相比已有方法提速10-100倍，实现深度最优映射
- 同时优化CX门数量与深度能最好降低噪声
量子电路由作用于量子比特的门构成。当前量子硬件平台对二元CX门施加连通性限制，因此布局合成是电路执行前的关键步骤。由于CX门易出错，减少其数量或深度至关重要。本文提出一种新的高效SAT编码方式，专注于寻找具有最小电路深度或最小CX门深度的映射电路。采用增量式SAT求解与并行计划策略，相比保证深度最优的OLSQ2，速度提升超过10-100倍。尽管深度最小化仍比仅优化门数耗时更长（如对比Q-Synth），但通过仿真发现：仅最小化CX门数量比仅最小化深度更能有效降噪；而同时考虑两者可获得最佳噪声抑制效果。
原文摘要 · Abstract (English)
Quantum circuits consist of gates applied to qubits. Current quantum hardware platforms impose connectivity restrictions on binary CX gates. Hence, Layout Synthesis is an important step to transpile quantum circuits before they can be executed. Since CX gates are noisy, it is important to reduce the CX count or CX depth of the mapped circuits. We provide a new and efficient encoding of Quantum-circuit Layout Synthesis in SAT. Previous SAT encodings focused on gate count and CX-gate count. Our encoding instead guarantees that we find mapped circuits with minimal circuit depth or minimal CX-gate depth. We use incremental SAT solving and parallel plans for an efficient encoding. This results in speedups of more than 10-100x compared to OLSQ2, which guarantees depth-optimality. But minimizing depth still takes more time than minimizing gate count with Q-Synth. We correlate the noise reduction achieved by simulating circuits after (CX)-count and (CX)-depth reduction. We find that minimizing for CX-count correlates better with reducing noise than minimizing for CX-depth. However, taking into account both CX-count and CX-depth provides the best noise reduction.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。