Metraipolis › archive › dc_0615ee73253a
Efficient Synthesis of Multi-Controlled Toffoli Gates with Ternary Clifford$+P_9$ Gates — arXiv:2609.29884
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29884
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T07:36:51.423Z
- SHA-256 of the archived text
aef774cae804ae49ff572fcbd531227c473c77c76a013d35db925ba1a6674dcd- Stable URL of this page
https://metraipolis.com/documento/dc_0615ee73253a
How to cite
Efficient Synthesis of Multi-Controlled Toffoli Gates with Ternary Clifford$+P_9$ Gates — arXiv:2609.29884 — arXiv (en), https://arxiv.org/abs/2609.29884 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0615ee73253a (Metraipolis archive dc_0615ee73253a, sha256 aef774cae804ae49ff572fcbd531227c473c77c76a013d35db925ba1a6674dcd)
BibTeX
@misc{dc0615ee73253a,
title = {Efficient Synthesis of Multi-Controlled Toffoli Gates with Ternary Clifford$+P_9$ Gates — arXiv:2609.29884},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29884},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0615ee73253a; sha256 aef774cae804ae49ff572fcbd531227c473c77c76a013d35db925ba1a6674dcd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29884. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Temporary occupation of qutrit levels can reduce the width and depth required for binary circuit logic in quantum computing. We introduce an efficient intermediate-qutrit decomposition of multi-controlled Toffoli gates with binary-subspace inputs and outputs. For balanced control widths $n=2^h-1$, the proposed decomposition is evaluated hierarchically through a tree, allowing independent subtree computations to proceed in parallel and reducing the depth from linear to logarithmic. The balanced low-depth construction requires $6n+3$ logical $P_9$ injections and $\frac{n-3}{4}$ clean ancillary qutrits. It matches the direct $P_9$ count of a recursively extended Clifford+$P_9$ baseline derived from the state-of-the-art work while using asymptotically one-quarter as many clean ancillas and replacing linear depth with logarithmic depth. For arbitrary control widths, a sequential extension preserves the $6n+3$ $P_9$ count but has depth $O(\log m+n-m)$ for a balanced core $m=2^h-1\leq n$, which is linear in the worst case over $n$. By reducing the resource overhead of a widely used reversible primitive, the proposed decomposition provides a practical building block for the design and compilation of more resource-efficient quantum algorithms in the fault-tolerant regime.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-25 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.29884 — 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-08T06:49:21.255Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).