首次实现12次CNOT门的双量子比特激发门，大幅降低量子线路开销。
A 12-CNOT Double Qubit Excitation Gate
- 提出12-CNOT分解方案，优于此前最优的13-CNOT电路。
- 相较之前最优方案，CNOT深度降低27%，总线路深度减少25%。
- 适合需要高频使用该算子的量子算法，如量子化学模拟。
高效实现高级量子门是实用量子计算的关键。本文首次报告了双量子比特激发算子的12-CNOT分解方案。我们在4个不同指标上对比了该新电路与此前最优的13-CNOT电路。结果表明，新电路在所有先前最优方案中拥有最少的CNOT数量（12）、最低的CNOT深度（8，约降低27%）和最低的总线路深度（15，降低25%）。通过输出量子比特重标记，CNOT深度可进一步降至7（较之前的11降低约36%）。相比最佳现有方案，仅增加2个单量子门（从11增至13）。由于双量子比特激发算子在实际量子算法中可能被重复使用数百或数千次，此类基础模块的优化将在全电路中累积带来显著资源节省。
原文摘要 · Abstract (English)
Effective implementation of high-level quantum gates is essential for practical quantum computing. In this work, we presented, to the best of our knowledge, the first reported 12-CNOT decomposition of the double qubit excitation operator. We compared our new circuit with the previous SOTA 13-CNOT circuits in 4 different metrics. Our new circuit has the lowest CNOT count (12), lowest CNOT depth (8, roughly 27% reduction), and lowest total circuit depth (15, 25% reduction) among all the previous SOTA circuits. With output qubit relabeling, the CNOT depth can be further reduced to 7 (roughly 36% reduction from 11). Further, we only added 2 extra 1q gates (from 11 to 13) compared to the best of the SOTA circuits. As the double qubit excitation operator can be used as a building block hundreds or thousands of times in practical quantum algorithms, any reduction in such primitives compounds over the full circuit, resulting in significant overall resource savings.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。