Metraipolis › archive › dc_eef71340adf2
Resource and entanglement study of a hybrid qudit-qubit quantum algorithm for solving the integer programming problem — arXiv:2609.23243
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23243
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T22:46:42.715Z
- SHA-256 of the archived text
74152e1375fb8ad9ddcb1b973f1076a92f201063232b5446cc769c6839edb872- Stable URL of this page
https://metraipolis.com/documento/dc_eef71340adf2
How to cite
Resource and entanglement study of a hybrid qudit-qubit quantum algorithm for solving the integer programming problem — arXiv:2609.23243 — arXiv (en), https://arxiv.org/abs/2609.23243 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eef71340adf2 (Metraipolis archive dc_eef71340adf2, sha256 74152e1375fb8ad9ddcb1b973f1076a92f201063232b5446cc769c6839edb872)
BibTeX
@misc{dceef71340adf2,
title = {Resource and entanglement study of a hybrid qudit-qubit quantum algorithm for solving the integer programming problem — arXiv:2609.23243},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23243},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eef71340adf2; sha256 74152e1375fb8ad9ddcb1b973f1076a92f201063232b5446cc769c6839edb872},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23243. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Recently, a hybrid qudit-qubit algorithm [1] was presented for solving the integer programming problem with a polynomial quantum advantage. In this work, we investigate the algorithm [1] to understand the role of qudits ($d$-dimensional quantum system) by conducting a comparative resource analysis with its qubit-only implementation and the classical simulability of the algorithm by exploring the entanglement structure. The resource analysis part is performed in terms of logical gate counts, and fault-tolerant physical resources, including non-Clifford gates. The hybrid qudit-qubit implementation has a more compact structure of the unitary operators as opposed to its qubit-only simulation which reduces the logical and fault-tolerant resource requirements. Two example problems, one with qutrits ($d=3$) and the other with ququint ($d=5$), when contrasted with their qubit-only implementation, within a simplified fault-tolerant resource model, showed $\sim 180 \times $ and $\sim 2220\times$ fewer total resource count, respectively. For the entanglement study, volume-law-like entropy growth and signatures of multi-partite entanglement is observed leading to increasing difficulty in the classical simulation of the algorithm. The algorithm generates synergistic tri-partite entanglement even for a quadratic problem, revealing that the algorithmic structure itself can generate higher-order entanglement in the system independent of the problem. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-22 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph) ; Computational Physics (physics.comp-ph). Pagina del lavoro: https://arxiv.org/abs/2609.23243 — 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-09T22:25:52.376Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).