Metraipolis › archive › dc_70beae7af2ae

Quantum Uncomputation of Clean and Dirty Ancilla Qubits — arXiv:2608.09578

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.09578
License (as archived)
CC0-1.0
Archived
2026-10-19T09:19:38.427Z
SHA-256 of the archived text
b8169a6709392ab6cb4975bf026ca7240963dc00a707c6646787a493f62dec97
Stable URL of this page
https://metraipolis.com/documento/dc_70beae7af2ae

How to cite

Quantum Uncomputation of Clean and Dirty Ancilla Qubits — arXiv:2608.09578 — arXiv (en), https://arxiv.org/abs/2608.09578 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_70beae7af2ae (Metraipolis archive dc_70beae7af2ae, sha256 b8169a6709392ab6cb4975bf026ca7240963dc00a707c6646787a493f62dec97)
BibTeX
@misc{dc70beae7af2ae,
  title = {Quantum Uncomputation of Clean and Dirty Ancilla Qubits — arXiv:2608.09578},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.09578},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_70beae7af2ae; sha256 b8169a6709392ab6cb4975bf026ca7240963dc00a707c6646787a493f62dec97},
  year = {2026}
}

Archived text

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

Automatic uncomputation aims to provide programming-language-level support to facilitate the correct and safe use of ancilla qubits in quantum computing, but efforts have only been made for clean ancillas, leaving dirty ancillas unexplored. We present a unified formalization of the uncomputation of both clean and dirty ancillas. For the first time, we prove that checking the existence of uncomputation is coNP-hard. We introduce two complementary synthesis-oriented existence checking methods: a syntax-directed static reasoning system and a rewrite-based normalization procedure (\RwUnx), together forming a top-down pipeline. We implement \RwUnx in Qiskit. Compared with the state-of-the-art \Reqompx, \RwUnx handles practical benchmarks with complex dependencies where \Reqompx does not, and achieves higher success rates in random-circuit experiments.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-11 in cs.PL).
Categorie arXiv: Programming Languages (cs.PL) ; Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.09578 — 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-19T09:15:58.325Z dalla pagina https://arxiv.org/catchup/cs.PL/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).