Metraipolis › archive › dc_f384d04ae315
Oracle Synthesis Based on X-Map Decision Diagrams — arXiv:2609.20854
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20854
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:52:18.653Z
- SHA-256 of the archived text
6f9e86e715c4633bbd9b293557c7988a91a7bf179f1b426d58060497168ec10e- Stable URL of this page
https://metraipolis.com/documento/dc_f384d04ae315
How to cite
Oracle Synthesis Based on X-Map Decision Diagrams — arXiv:2609.20854 — arXiv (en), https://arxiv.org/abs/2609.20854 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f384d04ae315 (Metraipolis archive dc_f384d04ae315, sha256 6f9e86e715c4633bbd9b293557c7988a91a7bf179f1b426d58060497168ec10e)
BibTeX
@misc{dcf384d04ae315,
title = {Oracle Synthesis Based on X-Map Decision Diagrams — arXiv:2609.20854},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20854},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f384d04ae315; sha256 6f9e86e715c4633bbd9b293557c7988a91a7bf179f1b426d58060497168ec10e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20854. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Quantum oracles act as reversible black-box operators that encode classical Boolean functions into quantum states, enabling efficient function evaluation in quantum superposition. The resource efficiency of oracle implementation is critical to the performance of numerous quantum algorithms. Most state-of-the-art oracle synthesis approaches rely on compact Boolean function representations such as exclusive-sum-of-products (ESOP), yet still suffer from excessive $T$-count and $CX$-count for large-scale functions. In this paper, we propose a novel compact representation named X-Map decision diagram (XMDD) for Boolean functions, which integrates local invertible maps and complement edges to achieve higher compression efficiency. Based on XMDD, we further develop an optimized quantum oracle synthesis algorithm. Extensive experimental results demonstrate that, for Boolean functions with more than seven input variables, our method outperforms the state-of-the-art ESOP-based approach and Qiskit in nearly all test cases, achieving simultaneous reduction in both $T$-count and $CX$-count without an obvious trade-off. Moreover, we show that the performance can be further boosted by employing more optimal variable orderings. The proposed XMDD-based framework provides a scalable and resource-efficient solution for practical oracle synthesis in near-term and fault-tolerant quantum computing. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-21 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.20854 — 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-10T02:31:30.407Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).