Validation of an analyzability model for quantum software: a family of experiments
arXiv:2602.21074 · doi:10.1007/s10664-026-10825-3
Abstract
The analyzability of hybrid software, which integrates both classical and quantum components, is a key factor in ensuring its maintainability and industrial adoption. This article presents the empirical validation, through a family of experiments, of the quantum component of a previously proposed hybrid software analyzability model based on the ISO/IEC 25010 standard. The experimental series consists of four studies involving participants with diverse profiles in both academic and professional settings. In these experiments, the model's ability to effectively measure the analyzability of quantum algorithms is assessed, and the relationship between the analyzability levels computed by the model and the participant's perceptions of the complexity of these algorithms is examined. The results indicate that the proposed model effectively distinguishes between quantum software components with varying levels of analyzability and aligns with human perception, reinforcing its validity in quantum computing.
42 pages, 5 figures, 12 tables. This is the Author Accepted Manuscript (AAM) of the article published in Empirical Software Engineering (2026). The final published version is available at https://doi.org/10.1007/s10664-026-10825-3
References in corpus (6)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Application-Oriented Performance Benchmarks for Quantum Computing
- On-Premises Superconducting Quantum Computer for Education and Research