We introduce a novel physics-guided linear mapper (PGLM) for quantum error mitigation that uses seven distinct interpretable features derived from circuit complexity and device calibration data. The goal is to provide a data-efficient, interpretable, and low-latency alternative to the black-box machine learning for quantum error mitigation in noisy-intermediate scale quantum devices. Evaluated on 52 simulated benchmark circuits (1--4 qubits), PGLM demonstrates strong performance in noise-accumulation regimes: 50.1% RMSE reduction on 3-qubit circuits and 32.3% on 4-qubit circuits, while single-qubit circuits show degraded performance. A circuit-size-aware deployment policy achieves 32.6% aggregate improvement. Sub-millisecond inference enables integration into variational algorithms, and analysis of learned coefficients reveals that circuit depth and CNOT count dominate error prediction, consistent with decoherence mechanisms. Results are simulator-based with idealized noise models; hardware validation remains essential future work.
Journal reference
Intelligent Computing, Lecture Notes in Networks and Systems, vol. 1949, pp. 749-765, Springer, 2026
18 pages, 7 figures. Published in Intelligent Computing: Proceedings of the 2026 Computing Conference, Lecture Notes in Networks and Systems, vol. 1949, Springer, 2026
We introduce a novel physics-guided linear mapper (PGLM) for quantum error mitigation that uses seven distinct interpretable features derived from circuit complexity and device calibration data. The goal is to provide a data-efficient, interpretable, and low-latency alternative to the black-box machine learning for quantum error mitigation in noisy-intermediate scale quantum devices. Evaluated on 52 simulated benchmark circuits (1--4 qubits), PGLM demonstrates strong performance in noise-accumulation regimes: 50.1% RMSE reduction on 3-qubit circuits and 32.3% on 4-qubit circuits, while single-qubit circuits show degraded performance. A circuit-size-aware deployment policy achieves 32.6% aggregate improvement. Sub-millisecond inference enables integration into variational algorithms, and analysis of learned coefficients reveals that circuit depth and CNOT count dominate error prediction, consistent with decoherence mechanisms. Results are simulator-based with idealized noise models; hardware validation remains essential future work.
Maximizing the computational utility of near-term quantum processors requires predictive noise models that inform robust, noise-aware compilation and error mitigation. Conventional models often fail to capture the complex error dynamics of real hardware or require prohibitive characterization overhead. We introduce a data-efficient framework that first constructs a physically motivated, parameterized noise model, and subsequently employs machine-learning-driven Bayesian optimization to identify its parameters. Our approach circumvents costly characterization protocols by estimating algorithm- and hardware-specific error parameters directly from readily available experimental data derived from existing application and benchmark circuit executions. The generality and robustness of the framework are demonstrated across diverse algorithms and superconducting devices, yielding high-fidelity predictions by estimating an independent parameter set tailored to each specific algorithm-hardware context. Crucially, we show that a model calibrated exclusively on small-scale circuits accurately predicts the behavior of larger validation circuits. Our data-efficient approach achieves up to a 65% improvement in model fidelity quantified by the Hellinger distance between predicted and experimental circuit output distributions, compared to standard noise models derived from device properties. This work establishes a practical paradigm for application-aware noise characterization, enabling compilation and error-mitigation strategies tailored to the specific interplay between quantum algorithms and device-specific noise dynamics.
Machine Learning-based quantum error mitigation (ML-QEM) has emerged as a promising approach for improving the performance of noisy quantum algorithms. However, existing ML-QEM methods often have restricted applicability to variational circuits and rely on inaccessible noiseless training data. In this work, we propose a practical ML-QEM protocol tailored to variational quantum algorithms, which generates training data by simulating (near-)Clifford circuits. This data is used for model selection and training, producing a mitigation model that can correct variational circuits with arbitrary parameters and transfer across different target Hamiltonians of similar structure. We benchmark the proposed method on the Variational Quantum Eigensolver (VQE) task for the Sherrington-Kirkpatrick Hamiltonian of up to n=12 qubits under various noise models, analyzing its effect on trainability and comparing its performance against standard Zero-Noise Extrapolation (ZNE). The results demonstrate consistent several-fold error suppression across all tested settings and superior performance over ZNE in the high-noise regime, providing evidence for the applicability of the proposed protocol to present-day NISQ processors.
Hybridizing machine learning (ML) with quantum computing has become an attractive strategy to increase computational power on Noisy Intermediate Scale Quantum (NISQ) devices. Although these can be potentially quantum advantage devices, their qubit numbers and noise are bounded and there are challenges when it comes to practical quantum circuit realization. This work concentrates on the creation of optimized quantum circuits via ML-based strategies, to enhance the performance of the circuits, to reduce the error rate and to accommodate the particular noise profile of the hardware of NISQ devices. The resulting suboptimal mappings with little or no consideration of noise and hardware topology in traditional quantum compilers can ruin the fidelity of quantum algorithm. Leveraging machine learning, and specifically reinforcement and supervised learning methods, our method learns to optimize compilation strategy for specific quantum hardware architecture. The paper proposes a framework that uses machine learning models to predict qubit mappings, gate decompositions, and transpilation paths that minimize gate depth and error accumulation. We also investigate transfer learning methods for propagating the learned compilation strategies to novel NISQ machines. Such methods are empirically validated on both simulated and real quantum hardware backends, providing evidence of circuit depth, execution time and error reductions. The results show that ML-assisted compilation can achieve better success probabilities for benchmark quantum algorithms like VQE and QAOA than conventional compilers. Furthermore, the work examines the interpretability of ML models providing hardware-aware optimization recommendations and understanding the noise patterns and methods of error correction. Our work highlights the key role of ML for transferring between theoretical quantum algorithms and their practical NISQ implementations. This integration boosts the immediate applicability of existing quantum devices and provides a basis for adaptive and scalable likelihood-based compilation for the era of fault-tolerant quantum computation. Our results motivate further investigation of hybrid classical-quantum workflows, in which ML iteratively improves compilation in accordance with changing hardware noise and capabilities. By improving quantum circuit compilation onNISQ computers, this work is taking steps toward the realization of quantum advantage in application scenarios such as optimization, cryptography, and quantum simulation without needing to wait for fully fault-tolerant large-scale quantum computers.
Quantum computing offers exponential advantages for problems in cryptography, optimization, and quantum simulation, yet the practicality of current Noisy Intermediate-Scale Quantum (NISQ) devices is severely constrained by decoherence, gate imperfections, and measurement noise. Conventional quantum error correction (QEC) codes such as Steane and surface codes impose large qubit overheads and require high-fidelity logical operations, making them unsuitable for near-term hardware. To address this gap, this work introduces ML-QEM, an adaptive quantum error mitigation framework that employs machine learning to identify and correct dominant Pauli error patterns in real time using only 3–5 ancillary qubits. By integrating Qiskit Aer noise modeling with a lightweight TensorFlow-based classifier, ML-QEM learns device-specific noise characteristics and applies targeted recovery operations with minimal latency. Evaluations across depolarizing, amplitude damping, and thermal relaxation noise models demonstrate a 28.4% average fidelity improvement, 60–84% lower overhead than Steane and surface codes, and a classical processing delay of only 21.7 ms. ML-QEM thus provides an effective and resource-efficient pathway toward enhancing quantum computation fidelity in the NISQ era.
Learning-based Quantum Error Mitigation (QEM) has emerged as a promising approach for reducing noise-induced bias on near-term Noisy Intermediate-Scale Quantum (NISQ) hardware. While simulated noise models enable scalable training of learning-based mitigators, real hardware data more accurately reflect device-specific error mechanisms, but are expensive and sparse. Understanding how these two data regimes interact is therefore critical for the practical deployment of learning-based QEM. In this paper, we present a systematic and empirical analysis on the nature of the data (simulated versus hardware noise) for learning-based QEM. Using a recently developed attention-based graph transformer for small- and large-scale quantum error mitigation, we compare various training regimes, starting from exclusively simulated noise and progressively integrating more measurements from real quantum hardware. Our study spans two distinct circuit families: 1) randomly generated circuits with relatively homogeneous structure; and 2) targeted quantum circuits derived from a specific problem, in this case the one-dimensional Burgers’ equation. Across five-fold cross validation, we analyze how hardware data affects generalization performance as measured by mean absolute error (MAE). Our results demonstrate that the impact of hardware data strongly depends on circuit structure and diversity. For random circuits, simulated data already guarantees lower absolute error, while hardware data yields consistent, but moderate improvements. In contrast, for targeted circuits, like the structured Burgers’ circuits, simulated noise can be less representative of the actual (testing) quantum error, and incorporating hardware data produces substantially larger relative reductions in MAE – despite the intrinsically higher MAE. These findings indicate the value of the nature of the training data in learning-based QEM, which is governed not only by the data’s ability to approximate reality – as expected – but also by how difficult it may be to capture circuit-induced error mechanisms in quantum simulations. In general, this work highlights the urgency of quantum circuit coverage in designing scalable and cost-effective learning-based QEM pipelines for devices in this new NISQ-era.
Noise in quantum hardware is the primary obstacle to realizing the transformative potential of quantum computing. Quantum error mitigation (QEM) offers a promising pathway to enhance computational accuracy on near-term devices, yet existing methods face a difficult trade-off between performance, resource overhead, and theoretical guarantees. In this work, we introduce neighbor-informed learning (NIL), a versatile and scalable QEM framework that unifies and strengthens existing methods such as zero-noise extrapolation (ZNE) and probabilistic error cancellation (PEC), while offering improved flexibility, accuracy, efficiency, and robustness.
NIL learns to predict the ideal output of a target quantum circuit from the noisy outputs of its structurally related ``neighbor'' circuits. A key innovation is our 2-design training method, which generates training data for our machine learning model. In contrast to conventional learning-based QEM protocols that create training circuits by replacing non-Clifford gates with uniformly random Clifford gates, our approach achieves higher accuracy and efficiency, as demonstrated by both theoretical analysis and numerical simulation. Furthermore, we prove that the required size of the training set scales only \emph{logarithmically} with the total number of neighbor circuits, enabling NIL to be applied to problems involving large-scale quantum circuits. Our work establishes a theoretically grounded and practically efficient framework for QEM, paving a viable path toward achieving quantum advantage on noisy hardware.