Training-Free Quantum Architecture Search Under Realistic Noise via Expressibility-Guided Evolution
Entropy · 16.03.2026 · 28 (3) · 330
DOI: 10.3390/e28030330 ↗Kurz gefasst
Fachartikel in der Zeitschrift Entropy, online erschienen am 16.03.2026. Verfasst von Seyedali Mousavi und 3 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science and Engineering, Mälardalen University, 72123 Västerås, Sweden. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Swedish Research Council, European Union and the Estonian Research Council, National Academic Infrastructure for Supercomputing in Sweden.
Abstract (Originalsprache)
Designing noise-robust parameterized quantum circuits (PQCs) is a central challenge in the noisy intermediate-scale quantum (NISQ) regime. Existing quantum architecture search methods rely on training large SuperCircuits and evaluating SubCircuits under noisy execution, resulting in high computational cost and architecture assessments that depend on task-specific optimization and device noise. In this work, we propose a training-free quantum architecture search framework based on information-theoretic expressibility measures rather than performance-based estimators. We empirically show that noise-free KL-divergence-based expressibility exhibits a consistent monotonic association with noisy task loss across diverse circuit architectures and realistic hardware noise models. Leveraging this relationship, we introduce an expressibility-guided evolutionary search that requires neither SuperCircuit training nor noisy execution during the search phase. Since expressibility is evaluated independently of hardware noise, the method is inherently device-agnostic, enabling architectures to be reused across multiple quantum devices without re-running the search. Experiments using IBM-derived Qiskit noise models demonstrate that the proposed approach achieves competitive performance compared to SuperCircuit-based baselines, while substantially reducing computational cost. These results establish expressibility as an effective information-theoretic surrogate for ranking PQC architectures under realistic noise.
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Department of Computer Science and Engineering, Mälardalen University, 72123 Västerås, Sweden.
- Department of Computer Systems, Tallinn University of Technology, 19086 Tallinn, Estonia.
ORCID-Profile: Seyedali Mousavi, Masoud Daneshtalab
Förderung
- Swedish Research Council
- European Union and the Estonian Research Council
- National Academic Infrastructure for Supercomputing in Sweden
Zitieren
APA
Mousavi, S., Mousavi, S., Pettersson, P., & Daneshtalab, M. (2026). Training-Free Quantum Architecture Search Under Realistic Noise via Expressibility-Guided Evolution. Entropy, 28(3), 330. https://doi.org/10.3390/e28030330
Vancouver
Mousavi S, Mousavi S, Pettersson P, Daneshtalab M. Training-Free Quantum Architecture Search Under Realistic Noise via Expressibility-Guided Evolution. Entropy. 2026;28(3):330. doi:10.3390/e28030330
BibTeX
@article{Mousavi2026,
author = {Mousavi, Seyedali and Mousavi, Seyedhamidreza and Pettersson, Paul and Daneshtalab, Masoud},
title = {Training-Free Quantum Architecture Search Under Realistic Noise via Expressibility-Guided Evolution},
journal = {Entropy},
year = {2026},
volume = {28},
number = {3},
pages = {330},
doi = {10.3390/e28030330}
}
EUVIMED