Metraipolis › archive › dc_860fb07d8730
Measurement-Efficient Differentiable Quantum Architecture Search for Combinatorial Optimization — arXiv:2610.10351
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10351
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:37:33.938Z
- SHA-256 of the archived text
7e4475bd9e2f923ca29b6eb4eea3a06fe9e634e4bb355455fc82ebb85b54cd03- Stable URL of this page
https://metraipolis.com/documento/dc_860fb07d8730
How to cite
Measurement-Efficient Differentiable Quantum Architecture Search for Combinatorial Optimization — arXiv:2610.10351 — arXiv (en), https://arxiv.org/abs/2610.10351 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_860fb07d8730 (Metraipolis archive dc_860fb07d8730, sha256 7e4475bd9e2f923ca29b6eb4eea3a06fe9e634e4bb355455fc82ebb85b54cd03)
BibTeX
@misc{dc860fb07d8730,
title = {Measurement-Efficient Differentiable Quantum Architecture Search for Combinatorial Optimization — arXiv:2610.10351},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10351},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_860fb07d8730; sha256 7e4475bd9e2f923ca29b6eb4eea3a06fe9e634e4bb355455fc82ebb85b54cd03},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10351. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Differentiable quantum architecture search (DQAS) is a promising framework for the automated design of quantum circuits, particularly for variational quantum optimization algorithms. However, its practical deployment on quantum hardware is limited by the large number of circuit measurements required during optimization, making hardware execution costly. In this work, we show that for a broad class of combinatorial optimization problems and commonly used rotational gate parameterizations, the measurement cost of DQAS can be significantly reduced without changing the optimization objective. We derive the proposed measurement reduction scheme theoretically and validate it experimentally on 3-SAT and MaxCut benchmark problems. Our approach reduces the requested gradient measurement cost by about 39 to 41% while introducing only negligible classical post-processing overhead, lowering the practical cost of executing DQAS on quantum hardware. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.10351 — 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-08T12:14:15.467Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).