Metraipolis › archive › dc_84bef79e70cc

A 12-CNOT Double Qubit Excitation Gate — arXiv:2608.11733

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11733
License (as archived)
CC0-1.0
Archived
2026-10-19T05:16:08.576Z
SHA-256 of the archived text
6e279c1a04b69b1704b58b9d3b12f026db6293e44b8b4fd957bfe0f1462e1da5
Stable URL of this page
https://metraipolis.com/documento/dc_84bef79e70cc

How to cite

A 12-CNOT Double Qubit Excitation Gate — arXiv:2608.11733 — arXiv (en), https://arxiv.org/abs/2608.11733 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_84bef79e70cc (Metraipolis archive dc_84bef79e70cc, sha256 6e279c1a04b69b1704b58b9d3b12f026db6293e44b8b4fd957bfe0f1462e1da5)
BibTeX
@misc{dc84bef79e70cc,
  title = {A 12-CNOT Double Qubit Excitation Gate — arXiv:2608.11733},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11733},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_84bef79e70cc; sha256 6e279c1a04b69b1704b58b9d3b12f026db6293e44b8b4fd957bfe0f1462e1da5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11733. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-13 in cs.AI).
Categorie arXiv: Quantum Physics (quant-ph) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2608.11733 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T05:08:46.723Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).