Executable specifications make software assumptions explicit and checkable, yet their role in quantum information and machine learning (QIML) remains underexplored. We argue that executable specifications should be treated as first-class artifacts for independent verification and validation (IV&V) of QIML systems. Static analysis, testing, simulation, and runtime checking can provide evidence about QIML behavior, while Design by Contract shows that selected quantum-state, measurement, and statistical properties can be expressed as checkable conditions. However, adapting existing methods for specification inference and assessment from conventional and machine-learning software to QIML raises several challenges, notably limited evidence for deriving generalizable specifications, non-local and probabilistic behavior, repository-scale reasoning across hybrid workflows, and weak behavioral oracles. We characterize these challenges and identify research directions for QIML corpora, specification semantics, repository-level analysis, and specification assessment.
Executable specifications make software assumptions explicit and checkable, yet their role in quantum information and machine learning (QIML) remains underexplored. We argue that executable specifications should be treated as first-class artifacts for independent verification and validation (IV&V) of QIML systems. Static analysis, testing, simulation, and runtime checking can provide evidence about QIML behavior, while Design by Contract shows that selected quantum-state, measurement, and statistical properties can be expressed as checkable conditions. However, adapting existing methods for specification inference and assessment from conventional and machine-learning software to QIML raises several challenges, notably limited evidence for deriving generalizable specifications, non-local and probabilistic behavior, repository-scale reasoning across hybrid workflows, and weak behavioral oracles. We characterize these challenges and identify research directions for QIML corpora, specification semantics, repository-level analysis, and specification assessment.
Quantum-Inspired Machine Learning (QiML) is a subfield of Quantum Machine Learning (QML) that implements quantum mechanical principles using classical computational resources, without requiring quantum hardware. Despite growing interest, QiML is frequently treated as a subset of broader QML surveys, leaving a gap in unified, cross-domain coverage. This survey provides the first dedicated examination of QiML as a standalone field, reviewing literature from 2017 to 2025 across tensor network simulations, dequantized algorithms, and variational quantum circuit simulations. We propose a unified taxonomy spanning these families, survey empirical applications across diverse domains, and assess practical limitations and open problems. Our analysis reveals that algorithmic maturity and practical readiness vary considerably across QiML families, with domain-specific success patterns driven by differing structural assumptions. Fundamental open questions remain around scalability, data embedding, and the relationship between quantum inductive biases and learning efficiency. This survey serves as a reference for researchers seeking a structured understanding of QiML’s current landscape and future directions.
Quantum machine learning (QML) is a promising paradigm for tackling computational problems that challenge classical AI. Yet, the inherent probabilistic behavior of quantum mechanics, device noise in NISQ hardware, and hybrid quantum-classical execution pipelines introduce new risks that prevent reliable deployment of QML in real-world, safety-critical settings. This research offers a broad roadmap for Trustworthy Quantum Machine Learning (TQML), integrating three foundational pillars of reliability: (i) uncertainty quantification for calibrated and risk-aware decision making, (ii) adversarial robustness against classical and quantum-native threat models, and (iii) privacy preservation in distributed and delegated quantum learning scenarios. We formalize quantum-specific trust metrics grounded in quantum information theory, including a variance-based decomposition of predictive uncertainty, trace-distance-bounded robustness, and differential privacy for hybrid learning channels. To demonstrate feasibility on current NISQ devices, we validate a unified trust assessment pipeline on parameterized quantum classifiers, uncovering correlations between uncertainty and prediction risk, an asymmetry in attack vulnerability between classical and quantum state perturbations, and privacy-utility trade-offs driven by shot noise and quantum channel noise. This roadmap seeks to define trustworthiness as a first-class design objective for quantum AI.
Connecting AI-generated quantum programs to executable experiments requires more than syntactically valid code: the workflow must also control execution authority and preserve the basis for interpreting its results. This paper develops a conceptual architecture organized around three responsibilities: AI-assisted circuit proposal, deterministic classical validation, and quantum measurement execution. A quantum-job contract binds circuit artifacts, measurement settings, resource allocations, backend information, and provenance to explicit admission conditions. The design separates permission to run an experiment from evidence that its output answers the intended scientific question. An analytical single-qubit variational example demonstrates this distinction through exact energy calculations, finite-shot variance, and budget-constrained measurement allocation. Responsibility allocation, runtime interception, and staged transformation provide the architectural principles, while uncertainty reporting and reference calculations supply the scientific checks. A prospective evaluation protocol covers accuracy, policy violations, reproducibility, end-to-end cost, and researcher effort. The framework is presented as a design proposal supported by mathematical illustration, not as a tested implementation; its operational benefits and applicability to larger quantum workloads remain to be established.
This study aims to evaluate the effectiveness of quantum-inspired machine learning (QIML) techniques when applied to high-dimensional data processing problems. Instead of relying on quantum hardware, QIML uses concepts such as amplitude encoding and tensor networks to improve the efficiency of traditional models. We compared the performance of QIML models with traditional machine learning models on three real-world datasets in the fields of finance, medical diagnosis, and natural language processing. The study used metrics of accuracy, training speed, and generalization properties for comparison. Our results show that hybrid QIML models achieve up to a 10% improvement in accuracy and a 40% improvement in training speed compared to traditional models. We also discuss current limitations in scalability and computational cost and suggest future research directions for developing QIML as an effective tool for processing complex data.
Quantum Software Engineering (QSE) is essential for ensuring the reliability and maintainability of hybrid quantum-classical systems, yet empirical evidence on how bugs emerge and affect quality in real-world quantum projects remains limited. This study presents the first ecosystem-scale longitudinal analysis of software bugs across 123 open source quantum repositories from 2012 to 2024, spanning eight functional categories, including full-stack libraries, simulators, annealing, algorithms, compilers, assembly, cryptography, and experimental computing. Using a mixed method approach combining repository mining, static code analysis, issue metadata extraction, and a validated rule-based classification framework, we analyze 32,296 verified bug reports. Results show that full-stack libraries and compilers are the most bug-prone categories due to circuit, gate, and transpilation-related issues, while simulators are mainly affected by measurement and noise modeling errors. Classical bugs primarily impact usability and interoperability, whereas quantum-specific bugs disproportionately degrade performance, maintainability, and reliability. Longitudinal analysis indicates ecosystem maturation, with bug densities peaking between 2017 and 2021 and declining thereafter. High-severity bugs cluster in cryptography, experimental computing, and compiler toolchains. Repositories employing automated testing detect more bugs and resolve issues faster. A negative binomial regression further shows that automated testing is associated with an approximate 60 percent reduction in expected bug incidence. Overall, this work provides the first large-scale data-driven characterization of quantum software bugs and offers empirical guidance for improving testing, documentation, and maintainability practices in QSE.
Quantum machine learning (QML) is an emerging paradigm that aims to achieve high expressive power by leveraging quantum advantage. However, realizing these advantages in practice inevitably requires executing inference on remote, noisy quantum hardware. Such hardware produces probabilistic and non-reproducible outcomes, leaving classical users without a principled way to verify reported results. We proposezkQML, the first framework that enables a fully classical verifier to certify that a reported QML inference result is consistent with a committed model up to a device-calibrated noise tolerance, by leveraging zero-knowledge succinct non-interactive argument of knowledge (zk-SNARKs). zkQML arithmetizes the ideal semantics of quantum inference and enforces consistency using cryptographic zk-SNARKs, while explicitly accounting for device noise through a noise-bounded correctness notion. Experiments on both simulators and real quantum hardware show that the proposed arithmetic modeling closely matches ideal quantum inference and enables verifier-efficient verification with small proof sizes and near-constant verification time. These results demonstrate that zkQML provides a practical and sound foundation for trustworthy quantum inference in realistic, non-reproducible execution environments.