Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2510.20686

Classical Noise Inversion for Error-Propagatable Circuits with Minimal Overhead under General Gate-Dependent Noise

Dayue Qin, Li, Ying, You Zhou

Published Oct 23, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum error mitigation (QEM) is critical for extracting reliable computations from noisy quantum processors, proving itself essential not only in the near term but also as a valuable supplement to fully fault-tolerant systems in the future. Despite the necessity, practical QEM deployment still confronts challenges, including the excessive cost of sampling quantum circuits and reliance on unrealistic assumptions such as gate-independent noise. In this paper, we propose Classical Noise Inversion (CNI), which shifts the QEM from sampling diverse quantum circuits to repeated single-circuit measurement, a drastic cost reduction given that the former incurs far heavier time overhead than the latter on realistic quantum hardware. We target general noise models and establish critical conditions for their classical tractability, under which CNI remains effective. For noise models that violate the condition, we propose partial CNI, which mitigates the classically tractable factor of noise via CNI and mitigates the other part via probabilistic error cancellation tailored to gate-dependent noise. To minimize the sampling overhead, we introduce noise compression, which groups noise components with equivalent effects on measurement outcomes, thereby attaining theoretically optimal error-mitigation overhead. The proposed protocols are particularly efficient for error-propagatable circuits, including adaptive universal quantum computing represented by Clifford+T fault-tolerant circuits, and generalized measurement represented by classical shadows. To demonstrate the practical merits of CNI, we integrate it with thrifty classical shadow, and use analysis and numerical simulations to show its advantages in both efficiency and accuracy over existing approaches.

DOI
10.48550/arxiv.2510.20686

Related papers

Sample-efficient quantum error mitigation via classical learning surrogates

Wei-You Liao, Ge Yan, Yujin Song +5 more

The pursuit of practical quantum utility on near-term quantum processors is critically challenged by their inherent noise. Quantum error mitigation (QEM) techniques are leading solutions to improve computation fidelity with relatively low qubit-overhead, while full-scale quantum error correction remains a distant goal. However, QEM techniques incur substantial measurement overheads, especially when applied to families of quantum circuits parameterized by classical inputs. Focusing on zero-noise extrapolation (ZNE), a widely adopted QEM technique, here we devise the surrogate-enabled ZNE (S-ZNE), which leverages classical learning surrogates to perform ZNE entirely on the classical side. Unlike conventional ZNE, whose measurement cost scales linearly with the number of circuits, S-ZNE requires only constant measurement overhead for an entire family of quantum circuits, offering superior scalability. Theoretical analysis indicates that S-ZNE achieves accuracy comparable to conventional ZNE in many practical scenarios, and numerical experiments on up to 100-qubit ground-state energy and quantum metrology tasks confirm its effectiveness. Our approach provides a template that can be effectively extended to other quantum error mitigation protocols, opening a promising path toward scalable error mitigation.

quant-pharXiv:2511.07092•Communications Physics•Nov 11, 2025•1 citation

Compilation-informed probabilistic logical-error cancellation

Giancarlo Camilo, Thiago O. Maciel, Allan Tosta +4 more

The potential of quantum computers to outperform classical ones in practically useful tasks remains challenging in the near term due to scaling limitations and high error rates of current quantum hardware. While quantum error correction (QEC) offers a clear path towards fault tolerance, overcoming the scalability issues will take time. Early applications will likely rely on QEC combined with quantum error mitigation (QEM). We introduce a QEM scheme against both compilation errors and logical-gate noise that is circuit-, QEC code-, and compiler-agnostic. The scheme builds on quasi-probability methods and uses information about the circuit's gates' compilations to attain an unbiased estimation of noiseless expectation values incurring a constant sample-complexity overhead. Moreover, it features maximal circuit size and code distance both independent of the target precision, in contrast to strategies based on QEC alone. We formulate the mitigation procedure as a linear program, demonstrate its efficacy through numerical simulations, and illustrate it for estimating the Jones polynomials of knots. Our method significantly reduces quantum resource requirements for high-precision estimations, offering a practical route towards fault-tolerant quantum computation with precision-independent overheads for fixed circuit size and code distance.

arXiv:2508.20174•Aug 27, 2025•0 citations

Orders of magnitude sampling overhead reduction in quantum error mitigation

Raam Uzdin

Quantum error mitigation (QEM) infers noiseless expectation values from noisy variants of a target quantum circuit. Unlike quantum error correction, QEM requires no additional hardware resources and is therefore routinely employed in experiments on contemporary quantum processors. QEM strategies based on agnostic noise amplification (ANA) are intrinsically resilient to temporal noise drift during the execution of the experiment, but their sampling cost (runtime overhead) remains a major practical bottleneck. In this work, we introduce the virtual noise scaling framework and combine it with layered mitigation to further enhance performance. While virtual noise scaling consistently reduces sampling overhead, we identify a specific noise threshold for the layered mitigation approach. When the noise level is above this threshold, layered mitigation decreases the sampling overhead; conversely, when below it, the overhead increases. Notably, this threshold is circuit-independent and depends solely on the number of layers. For strong noise, the combination of virtual noise scaling and layered mitigation yields several orders of magnitude reduction in sampling overhead compared with conventional zero-noise extrapolation post-processing. As a result, mitigation tasks that once seemed unrealistic are now challenging but achievable. The proposed approach is compatible with dynamic circuits and can be seamlessly integrated with error detection and quantum error correction schemes. In addition, it is also applicable to ANA-based mitigation of mid-circuit measurements and preparation errors. Our findings extend to any constant-step amplification factors and therefore also apply to probabilistic error amplification (PEA) QEM. We validate our post-processing approach by applying it to previously reported experimental data, where we observe a substantial improvement in mitigation efficiency and accuracy.

quant-pharXiv:2601.22785•Feb 2, 2026•1 citation

Scalable Quantum Error Mitigation with Neighbor-Informed Learning

Zhenyu Chen, Bin Cheng, Minbo Gao +4 more

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.

quant-pharXiv:2512.12578•Dec 16, 2025•0 citations

Error-Mitigated Hamiltonian Simulation: Complexity Analysis and Optimization for Near-Term and Early-Fault-Tolerant Quantum Computers

Keisuke Murota, Synge Todo, Suguru Endo

Simulating real-time dynamics under a Hamiltonian is a central goal of quantum information science. While numerous Hamiltonian-simulation quantum algorithms have been proposed, the effects of physical noise have rarely been incorporated into their performance analysis, despite the non-negligible noise levels of quantum devices. We present an end-to-end complexity analysis of noisy Hamiltonian simulation combined with quantum error mitigation (QEM) to answer how many circuit runs are required to reach a given target accuracy. Because the QEM sampling overhead grows exponentially with the circuit depth while the algorithmic error decreases with it, the circuit depth becomes an optimization variable, and we derive an analytic depth-selection rule for two algorithm families. For the order-$k$ Suzuki--Trotter formula, the optimized cost exhibits a critical error $ε_c$, below which the required number of circuit runs grows exponentially. QEM improves the noise dependence of $ε_c$ from sublinear to $k$th-power scaling, an exponent improvement by a factor of $k+1$. For randomized-LCU-based simulation, optimizing the repetition number yields a square-root improvement in the simulation-time dependence of the sampling-overhead exponent over the standard parameter choice. We further quantify the noise-characterization cost required for error mitigation via gate set tomography and the recently proposed space-time noise inversion method, showing that the latter can significantly reduce this cost.

quant-pharXiv:2603.11527•Mar 13, 2026•0 citations

Sample-efficient quantum error mitigation via classical learning surrogates

He-Liang Huang, Wei-You Liao, Ge Yan +5 more

Abstract The pursuit of practical quantum utility on near-term quantum processors is critically challenged by their inherent noise. Quantum error mitigation (QEM) techniques are leading solutions to improve computation fidelity with relatively low qubit-overhead, while full-scale quantum error correction remains a distant goal. However, QEM techniques incur substantial measurement overheads, especially when applied to families of quantum circuits parameterized by classical inputs. Focusing on zero-noise extrapolation (ZNE), a widely adopted QEM technique, here we devise the surrogate-enabled ZNE (S-ZNE), which leverages classical learning surrogates to perform ZNE entirely on the classical side. Unlike conventional ZNE, whose measurement cost scales linearly with the number of circuits, S-ZNE requires only constant measurement overhead for an entire family of quantum circuits, offering superior scalability. Theoretical analysis indicates that S-ZNE achieves accuracy comparable to conventional ZNE in many practical scenarios, and numerical experiments on up to 100-qubit ground-state energy and quantum metrology tasks confirm its effectiveness. Our approach provides a template that can be effectively extended to other quantum error mitigation protocols, opening a promising path toward scalable error mitigation.

•Feb 6, 2026•0 citations
Quantum error mitigation (QEM) is critical for extracting reliable computations from noisy quantum processors, proving itself essential not only in the near term but also as a valuable supplement to fully fault-tolerant systems in the future. Despite the necessity, practical QEM deployment still confronts challenges, including the excessive cost of sampling quantum circuits and reliance on unrealistic assumptions such as gate-independent noise. In this paper, we propose Classical Noise Inversion (CNI), which shifts the QEM from sampling diverse quantum circuits to repeated single-circuit measurement, a drastic cost reduction given that the former incurs far heavier time overhead than the latter on realistic quantum hardware. We target general noise models and establish critical conditions for their classical tractability, under which CNI remains effective. For noise models that violate the condition, we propose partial CNI, which mitigates the classically tractable factor of noise via CNI and mitigates the other part via probabilistic error cancellation tailored to gate-dependent noise. To minimize the sampling overhead, we introduce noise compression, which groups noise components with equivalent effects on measurement outcomes, thereby attaining theoretically optimal error-mitigation overhead. The proposed protocols are particularly efficient for error-propagatable circuits, including adaptive universal quantum computing represented by Clifford+T fault-tolerant circuits, and generalized measurement represented by classical shadows. To demonstrate the practical merits of CNI, we integrate it with thrifty classical shadow, and use analysis and numerical simulations to show its advantages in both efficiency and accuracy over existing approaches.
The pursuit of practical quantum utility on near-term quantum processors is critically challenged by their inherent noise. Quantum error mitigation (QEM) techniques are leading solutions to improve computation fidelity with relatively low qubit-overhead, while full-scale quantum error correction remains a distant goal. However, QEM techniques incur substantial measurement overheads, especially when applied to families of quantum circuits parameterized by classical inputs. Focusing on zero-noise extrapolation (ZNE), a widely adopted QEM technique, here we devise the surrogate-enabled ZNE (S-ZNE), which leverages classical learning surrogates to perform ZNE entirely on the classical side. Unlike conventional ZNE, whose measurement cost scales linearly with the number of circuits, S-ZNE requires only constant measurement overhead for an entire family of quantum circuits, offering superior scalability. Theoretical analysis indicates that S-ZNE achieves accuracy comparable to conventional ZNE in many practical scenarios, and numerical experiments on up to 100-qubit ground-state energy and quantum metrology tasks confirm its effectiveness. Our approach provides a template that can be effectively extended to other quantum error mitigation protocols, opening a promising path toward scalable error mitigation.
The potential of quantum computers to outperform classical ones in practically useful tasks remains challenging in the near term due to scaling limitations and high error rates of current quantum hardware. While quantum error correction (QEC) offers a clear path towards fault tolerance, overcoming the scalability issues will take time. Early applications will likely rely on QEC combined with quantum error mitigation (QEM). We introduce a QEM scheme against both compilation errors and logical-gate noise that is circuit-, QEC code-, and compiler-agnostic. The scheme builds on quasi-probability methods and uses information about the circuit's gates' compilations to attain an unbiased estimation of noiseless expectation values incurring a constant sample-complexity overhead. Moreover, it features maximal circuit size and code distance both independent of the target precision, in contrast to strategies based on QEC alone. We formulate the mitigation procedure as a linear program, demonstrate its efficacy through numerical simulations, and illustrate it for estimating the Jones polynomials of knots. Our method significantly reduces quantum resource requirements for high-precision estimations, offering a practical route towards fault-tolerant quantum computation with precision-independent overheads for fixed circuit size and code distance.
Quantum error mitigation (QEM) infers noiseless expectation values from noisy variants of a target quantum circuit. Unlike quantum error correction, QEM requires no additional hardware resources and is therefore routinely employed in experiments on contemporary quantum processors. QEM strategies based on agnostic noise amplification (ANA) are intrinsically resilient to temporal noise drift during the execution of the experiment, but their sampling cost (runtime overhead) remains a major practical bottleneck. In this work, we introduce the virtual noise scaling framework and combine it with layered mitigation to further enhance performance. While virtual noise scaling consistently reduces sampling overhead, we identify a specific noise threshold for the layered mitigation approach. When the noise level is above this threshold, layered mitigation decreases the sampling overhead; conversely, when below it, the overhead increases. Notably, this threshold is circuit-independent and depends solely on the number of layers. For strong noise, the combination of virtual noise scaling and layered mitigation yields several orders of magnitude reduction in sampling overhead compared with conventional zero-noise extrapolation post-processing. As a result, mitigation tasks that once seemed unrealistic are now challenging but achievable. The proposed approach is compatible with dynamic circuits and can be seamlessly integrated with error detection and quantum error correction schemes. In addition, it is also applicable to ANA-based mitigation of mid-circuit measurements and preparation errors. Our findings extend to any constant-step amplification factors and therefore also apply to probabilistic error amplification (PEA) QEM. We validate our post-processing approach by applying it to previously reported experimental data, where we observe a substantial improvement in mitigation efficiency and accuracy.
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.
Simulating real-time dynamics under a Hamiltonian is a central goal of quantum information science. While numerous Hamiltonian-simulation quantum algorithms have been proposed, the effects of physical noise have rarely been incorporated into their performance analysis, despite the non-negligible noise levels of quantum devices. We present an end-to-end complexity analysis of noisy Hamiltonian simulation combined with quantum error mitigation (QEM) to answer how many circuit runs are required to reach a given target accuracy. Because the QEM sampling overhead grows exponentially with the circuit depth while the algorithmic error decreases with it, the circuit depth becomes an optimization variable, and we derive an analytic depth-selection rule for two algorithm families. For the order-kkk Suzuki--Trotter formula, the optimized cost exhibits a critical error εcε_cεc​, below which the required number of circuit runs grows exponentially. QEM improves the noise dependence of εcε_cεc​ from sublinear to kkkth-power scaling, an exponent improvement by a factor of k+1k+1k+1. For randomized-LCU-based simulation, optimizing the repetition number yields a square-root improvement in the simulation-time dependence of the sampling-overhead exponent over the standard parameter choice. We further quantify the noise-characterization cost required for error mitigation via gate set tomography and the recently proposed space-time noise inversion method, showing that the latter can significantly reduce this cost.
Abstract The pursuit of practical quantum utility on near-term quantum processors is critically challenged by their inherent noise. Quantum error mitigation (QEM) techniques are leading solutions to improve computation fidelity with relatively low qubit-overhead, while full-scale quantum error correction remains a distant goal. However, QEM techniques incur substantial measurement overheads, especially when applied to families of quantum circuits parameterized by classical inputs. Focusing on zero-noise extrapolation (ZNE), a widely adopted QEM technique, here we devise the surrogate-enabled ZNE (S-ZNE), which leverages classical learning surrogates to perform ZNE entirely on the classical side. Unlike conventional ZNE, whose measurement cost scales linearly with the number of circuits, S-ZNE requires only constant measurement overhead for an entire family of quantum circuits, offering superior scalability. Theoretical analysis indicates that S-ZNE achieves accuracy comparable to conventional ZNE in many practical scenarios, and numerical experiments on up to 100-qubit ground-state energy and quantum metrology tasks confirm its effectiveness. Our approach provides a template that can be effectively extended to other quantum error mitigation protocols, opening a promising path toward scalable error mitigation.