Data-Efficient Quantum Noise Modeling via Machine Learning

Abstract

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.

References in corpus (29)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• A Quantum Engineer's Guide to Superconducting Qubits
• Trapped-Ion Quantum Computing: Progress and Challenges
• Extending the computational reach of a noisy superconducting quantum processor
• Quantum Error Mitigation
• A Theory of Trotter Error
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• A Race Track Trapped-Ion Quantum Processor
• Characterization of addressability by simultaneous randomized benchmarking
• Efficient learning of quantum noise
• Faster quantum simulation by randomization
• Demonstration of non-Markovian process characterisation and control on a quantum processor
• Modelling and Simulating the Noisy Behaviour of Near-term Quantum Computers
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Benchmarking the performance of portfolio optimization with QAOA
• Randomizing multi-product formulas for Hamiltonian simulation
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm
• Predicting non-Markovian superconducting qubit dynamics from tomographic reconstruction
• Modeling Noisy Quantum Circuits Using Experimental Characterization
• MQT Predictor: Automatic Device Selection with Device-Specific Circuit Compilation for Quantum Computing
• Optimizing Quantum Algorithms on Bipotent Architectures
• Algorithm-Oriented Qubit Mapping for Variational Quantum Algorithms
• Calibration-Aware Transpilation for Variational Quantum Optimization
• Markovian Noise Modelling and Parameter Extraction Framework for Quantum Devices
• Synergistic Dynamical Decoupling and Circuit Design for Enhanced Algorithm Performance on Near-Term Quantum Devices
• The Munich Quantum Software Stack: Connecting End Users, Integrating Diverse Quantum Technologies, Accelerating HPC
• Improving the Performance of Digitized Counterdiabatic Quantum Optimization via Algorithm-Oriented Qubit Mapping