12个CNOT双量子比特激发门
A 12-CNOT Double Qubit Excitation Gate
浏览论文内容
中文总结 AI 辅助
该研究提出首个12-CNOT双量子比特激发算子分解方案，其CNOT数、CNOT深度、总电路深度均优于现有SOTA，仅额外增加2个单量子比特门。
中文摘要 AI 辅助
高效实现高层量子门是实用量子计算的关键。据我们所知，本文首次报道了双量子比特激发算子的12-CNOT分解方案，改进了现有采用13个CNOT的最先进（SOTA）实现。新电路在所有先前SOTA电路中具有最低的CNOT数（12）、最低的CNOT深度（10）和最低的总电路深度（16）；与先前SOTA中最低的单量子比特门数（11）相比，仅增加了2个额外的单量子比特门。
英文摘要
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.
发表机构
- Kvantify Aps（克万蒂菲公司）
机构由 AI 辅助整理，请以论文原文为准。
