{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:38:13Z","timestamp":1773815893180,"version":"3.50.1"},"reference-count":30,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Swedish Research Council","doi-asserted-by":"crossref","award":["2022-06725"],"award-info":[{"award-number":["2022-06725"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"crossref"}]},{"name":"European Union and the Estonian Research Council","award":["TEM-TA138"],"award-info":[{"award-number":["TEM-TA138"]}]},{"name":"National Academic Infrastructure for Supercomputing in Sweden"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/e28030330","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:10:43Z","timestamp":1773655843000},"page":"330","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Training-Free Quantum Architecture Search Under Realistic Noise via Expressibility-Guided Evolution"],"prefix":"10.3390","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-9278-9043","authenticated-orcid":false,"given":"Seyedali","family":"Mousavi","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, M\u00e4lardalen University, 72123 V\u00e4ster\u00e5s, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyedhamidreza","family":"Mousavi","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, M\u00e4lardalen University, 72123 V\u00e4ster\u00e5s, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Pettersson","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, M\u00e4lardalen University, 72123 V\u00e4ster\u00e5s, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6289-1521","authenticated-orcid":false,"given":"Masoud","family":"Daneshtalab","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, M\u00e4lardalen University, 72123 V\u00e4ster\u00e5s, Sweden"},{"name":"Department of Computer Systems, Tallinn University of Technology, 19086 Tallinn, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,3,16]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","article-title":"Quantum computing in the NISQ era and beyond","volume":"2","author":"Preskill","year":"2018","journal-title":"Quantum"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"023023","DOI":"10.1088\/1367-2630\/18\/2\/023023","article-title":"The theory of variational hybrid quantum-classical algorithms","volume":"18","author":"McClean","year":"2016","journal-title":"New J. Phys."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1038\/s42254-021-00348-9","article-title":"Variational quantum algorithms","volume":"3","author":"Cerezo","year":"2021","journal-title":"Nat. Rev. Phys."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1900070","DOI":"10.1002\/qute.201900070","article-title":"Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms","volume":"2","author":"Sim","year":"2019","journal-title":"Adv. Quantum Technol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"010313","DOI":"10.1103\/PRXQuantum.3.010313","article-title":"Connecting ansatz expressibility to gradient magnitudes and barren plateaus","volume":"3","author":"Holmes","year":"2022","journal-title":"PRX Quantum"},{"key":"ref_6","unstructured":"Martyniuk, T., Sza\u0142kowski, M., and Rycerz, P. (ACM Comput. Surv., 2024). Quantum architecture search: A survey, ACM Comput. Surv., early access."},{"key":"ref_7","first-page":"3953","article-title":"QuantumNAS: Noise-adaptive search for robust quantum circuits","volume":"41","author":"Wang","year":"2022","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"ref_8","unstructured":"Zhou, Y., Tang, X., Wang, H., and Xie, Y. (2020). One-shot quantum architecture search. arXiv."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2315","DOI":"10.1080\/09500349414552171","article-title":"Fidelity for mixed quantum states","volume":"41","author":"Jozsa","year":"1994","journal-title":"J. Mod. Opt."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"043001","DOI":"10.1088\/2058-9565\/ab4eb5","article-title":"Parameterized quantum circuits as machine learning models","volume":"4","author":"Benedetti","year":"2019","journal-title":"Quantum Sci. Technol."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1038\/s41534-018-0116-9","article-title":"Hierarchical quantum classifiers","volume":"4","author":"Grant","year":"2018","journal-title":"npj Quantum Inf."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Li, J., Xu, H., Chen, G., and Zhang, S. (IEEE Trans.-Comput.-Aided Des. Integr. Circuits Syst., 2025). Quantum Multi-View Feature Selection with Configurable Kernel Circuits and Adaptive Fusion, IEEE Trans.-Comput.-Aided Des. Integr. Circuits Syst., early access.","DOI":"10.1109\/TCAD.2025.3650093"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"434","DOI":"10.22331\/q-2021-04-19-434","article-title":"Expressibility of the alternating layered ansatz for quantum computation","volume":"5","author":"Nakaji","year":"2021","journal-title":"Quantum"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"6961","DOI":"10.1038\/s41467-021-27045-6","article-title":"Noise-induced barren plateaus in variational quantum algorithms","volume":"12","author":"Wang","year":"2021","journal-title":"Nat. Commun."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"4812","DOI":"10.1038\/s41467-018-07090-4","article-title":"Barren plateaus in quantum neural network training landscapes","volume":"9","author":"McClean","year":"2018","journal-title":"Nat. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1103\/RevModPhys.74.197","article-title":"The role of relative entropy in quantum information theory","volume":"74","author":"Vedral","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Wilde, M.M. (2013). Quantum Information Theory, Cambridge University Press.","DOI":"10.1017\/CBO9781139525343"},{"key":"ref_18","first-page":"210134","article-title":"Quantum circuit architecture search with reinforcement learning","volume":"8","author":"Zhang","year":"2020","journal-title":"IEEE Access"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3007","DOI":"10.1038\/s41467-019-10988-2","article-title":"An adaptive variational algorithm for exact molecular simulations on a quantum computer","volume":"10","author":"Grimsley","year":"2019","journal-title":"Nat. Commun."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"052414","DOI":"10.1103\/PhysRevA.105.052414","article-title":"Robust resource-efficient quantum variational ansatz through an evolutionary algorithm","volume":"105","author":"Huang","year":"2022","journal-title":"Phys. Rev. A"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"230504","DOI":"10.1103\/PhysRevLett.116.230504","article-title":"Genetic algorithms for digital quantum simulations","volume":"116","author":"Solano","year":"2016","journal-title":"Phys. Rev. Lett."},{"key":"ref_22","unstructured":"Zhang, A., and Zhao, S. (2022). Evolutionary-based quantum architecture search. arXiv."},{"key":"ref_23","unstructured":"Li, C., Zeng, H., and Ding, D. (2026). Noise-Aware Quantum Architecture Search Based on NSGA-II Algorithm. arXiv."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"122272","DOI":"10.1016\/j.ins.2025.122272","article-title":"Automl-driven optimization of variational quantum circuit","volume":"717","author":"Situ","year":"2025","journal-title":"Inf. Sci."},{"key":"ref_25","unstructured":"He, Z., Deng, M., Zheng, S., Li, L., and Situ, H. (2024, January 20\u201327). Training-free quantum architecture search. Proceedings of the AAAI Conference on Artificial Intelligence, Vancouver, BC, Canada."},{"key":"ref_26","unstructured":"Anagolum, S., Alavisamani, N., Das, P., Qureshi, M., and Shi, Y. (May, January 27). \u00c9liv\u00e1gar: Efficient quantum circuit search for classification. Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, San Diego, CA, USA."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"024074","DOI":"10.1103\/rbhx-3fjd","article-title":"Adaptive fusion of training-free proxies for quantum architecture search","volume":"24","author":"He","year":"2025","journal-title":"Phys. Rev. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Murali, P., Baker, J.M., Javadi-Abhari, A., Chong, F.T., and Martonosi, M. (2019, January 13\u201317). Noise-adaptive compiler mappings for noisy intermediate-scale quantum computers. Proceedings of the 24th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS \u201919), Providence, RI, USA.","DOI":"10.1145\/3297858.3304075"},{"key":"ref_29","unstructured":"Li, A., Ding, Y., and Xie, Y. (2020). Pulse-efficient circuit transpilation for quantum applications. ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Virtual, 16\u201320 March 2020, Association for Computing Machinery."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Ferrari, D., and Amoretti, M. (2022, January 17\u201322). Noise-adaptive quantum compilation strategies evaluated with application-motivated benchmarks. Proceedings of the 19th ACM International Conference on Computing Frontiers, Turin, Italy.","DOI":"10.1145\/3528416.3530250"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/3\/330\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T05:41:00Z","timestamp":1773812460000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/3\/330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,16]]},"references-count":30,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["e28030330"],"URL":"https:\/\/doi.org\/10.3390\/e28030330","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,16]]}}}