Metraipolis › archive › dc_a801fab1dcdc

Shared-End-First Control Ordering in Clean-Ancilla V-Chain Synthesis of Nested Multi-Controlled Cascades: A Quantum Binary-Addition-Tree Case Study — arXiv:2609.29480

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29480
License (as archived)
CC0-1.0
Archived
2026-10-08T04:51:07.934Z
SHA-256 of the archived text
c5a8be87163c9686be79f998e8540d79368d7c0be7f8975558a8bf7b670664cd
Stable URL of this page
https://metraipolis.com/documento/dc_a801fab1dcdc

How to cite

Shared-End-First Control Ordering in Clean-Ancilla V-Chain Synthesis of Nested Multi-Controlled Cascades: A Quantum Binary-Addition-Tree Case Study — arXiv:2609.29480 — arXiv (en), https://arxiv.org/abs/2609.29480 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a801fab1dcdc (Metraipolis archive dc_a801fab1dcdc, sha256 c5a8be87163c9686be79f998e8540d79368d7c0be7f8975558a8bf7b670664cd)
BibTeX
@misc{dca801fab1dcdc,
  title = {Shared-End-First Control Ordering in Clean-Ancilla V-Chain Synthesis of Nested Multi-Controlled Cascades: A Quantum Binary-Addition-Tree Case Study — arXiv:2609.29480},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29480},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a801fab1dcdc; sha256 c5a8be87163c9686be79f998e8540d79368d7c0be7f8975558a8bf7b670664cd},
  year = {2026}
}

Archived text

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

Control order is logically irrelevant for a multi-controlled-X gate but can become physically consequential after ordered ancilla-chain synthesis. This work derives and validates a shared-end-first ordering rule for nested-control cascades, using reversible Binary-Addition-Tree (BAT) successor circuits as the primary case. Under Maslov clean-v-chain synthesis, pre-optimization CX cost is order-invariant, whereas shared-end-first ordering exposes P(m)=(m-4)(m-3)/2 inverse relative-phase-CCX pairs across stage boundaries; standard optimization removes 6P(m) CX, giving 12m-31 for QBAT after an independently derived two-CX terminal identity. At m=20, retaining an ascending control list after mirroring the BAT direction yields 1,025 CX, while mirroring the chain orientation restores 209. A disjoint-target nested cascade reproduces the same cancellation count for count, showing that BAT target geometry is not required; an ordered dirty-v-chain control shows zero orientation advantage, delimiting the mechanism within the tested synthesis families. Independent ripple-carry baselines give 11m-28 CX on FULL connectivity, so the QBAT/RC ratio approaches 12/11, with equal natural width 2m-3 in the tested QBAT-A1 and INC_RC implementations. The contribution is a synthesis-ordering rule that exposes cancellation to an existing optimizer, not a new optimizer pass or a universal MCX rule.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-25 in cs.AR).
Categorie arXiv: Emerging Technologies (cs.ET) ; Hardware Architecture (cs.AR).
Pagina del lavoro: https://arxiv.org/abs/2609.29480 — 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-08T04:28:37.319Z dalla pagina https://arxiv.org/catchup/cs.AR/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).