Variational quantum circuits (VQCs) solving partial differential equations (PDEs) on near-term quantum hardware face a critical challenge: hardware noise degrades solution fidelity and disrupts convergence. We present a systematic study of three noise channels; depolarizing, amplitude damping, and bit-flip on VQCs constrained by PDE residual loss functions for the heat equation, Burgers' equation, and the Saint-Venant shallow water equations. We benchmark three error mitigation strategies: zero-noise extrapolation (ZNE) via Richardson polynomial fitting, probabilistic error cancellation (PEC), and measurement error mitigation through inverse confusion matrices. Our numerical experiments on 6-qubit, 4-layer circuits demonstrate that ZNE reduces absolute error by 82-96% at low noise (p = 0.001), with effectiveness degrading gracefully at higher noise strengths. We prove analytically and confirm numerically that physics-constrained circuits exhibit inherent noise resilience: at p = 0.01, constrained circuits maintain 25-47% higher fidelity than unconstrained counterparts, with the advantage scaling with PDE complexity. PEC provides near-exact correction at low gate counts but incurs exponential sampling overhead, rendering it impractical beyond ~60 gates at p >= 0.02. Error budget decomposition reveals that systematic errors dominate at all noise levels (43-58%), while the PDE residual component grows from ~10% to ~31% as noise increases, indicating that physics constraints absorb noise through structured gradient information. These results establish practical guidelines for deploying variational PDE solvers on NISQ hardware.
Variational quantum circuits (VQCs) solving partial differential equations (PDEs) on near-term quantum hardware face a critical challenge: hardware noise degrades solution fidelity and disrupts convergence. We present a systematic study of three noise channels; depolarizing, amplitude damping, and bit-flip on VQCs constrained by PDE residual loss functions for the heat equation, Burgers' equation, and the Saint-Venant shallow water equations. We benchmark three error mitigation strategies: zero-noise extrapolation (ZNE) via Richardson polynomial fitting, probabilistic error cancellation (PEC), and measurement error mitigation through inverse confusion matrices. Our numerical experiments on 6-qubit, 4-layer circuits demonstrate that ZNE reduces absolute error by 82-96% at low noise (p = 0.001), with effectiveness degrading gracefully at higher noise strengths. We prove analytically and confirm numerically that physics-constrained circuits exhibit inherent noise resilience: at p = 0.01, constrained circuits maintain 25-47% higher fidelity than unconstrained counterparts, with the advantage scaling with PDE complexity. PEC provides near-exact correction at low gate counts but incurs exponential sampling overhead, rendering it impractical beyond ~60 gates at p >= 0.02. Error budget decomposition reveals that systematic errors dominate at all noise levels (43-58%), while the PDE residual component grows from ~10% to ~31% as noise increases, indicating that physics constraints absorb noise through structured gradient information. These results establish practical guidelines for deploying variational PDE solvers on NISQ hardware.
The barren plateau phenomenon; where cost function gradients vanish exponentially with system size; remains a fundamental obstacle to training variational quantum circuits (VQCs) at scale. We demonstrate, both theoretically and numerically, that embedding partial differential equation (PDE) constraints into the VQC loss function provides a natural and effective mitigation mechanism against barren plateaus. We derive analytical gradient variance lower bounds showing that physics-constrained loss functions composed of local PDE residuals evaluated at spatial collocation points inherit the favorable polynomial scaling of local cost functions, while additionally benefiting from constraint-induced landscape narrowing that concentrates gradient information. Systematic numerical experiments on the one-dimensional heat equation, Burgers' equation, and the Saint-Venant shallow water equations quantify the gradient variance across 4-8 qubits and 1-5 layer depths, comparing global cost, local cost, PDE-constrained, and PDE-constrained with structured ansatz configurations. We find that PDE-constrained circuits exhibit favorable gradient variance scaling with system size, with the physics constraints creating a stabilizing effect that resists exponential gradient vanishing. Entanglement entropy analysis reveals that structured ansatze operate in a sub-maximal entanglement regime consistent with trainability. Convergence experiments confirm that physics-constrained VQCs achieve lower loss values in fewer epochs. These results establish PDE constraints as a principled, physically motivated strategy for designing trainable variational quantum circuits, with direct implications for quantum physics-informed neural networks and variational quantum simulation.
Preparing smooth real-amplitude quantum states is a key subroutine in quantum solvers for dissipative PDEs, such as LCHS, where discretized positive weights must be encoded into amplitudes. Exact state-preparation decompositions can reach unit fidelity ideally, but their two-qubit depth grows quickly and causes severe fidelity loss on NISQ hardware. We propose a low-depth, hardware-aware variational ansatz tailored to smooth, weakly entangled, near-real target distributions typical of damped PDE dynamics. The circuit uses one layer of local Ry rotations to generate real amplitudes, a nearest-neighbor CZ entangling layer to introduce limited entanglement, and additional Rz rotations implemented virtually as frame updates. Virtual Rz operations add no physical pulses and do not increase circuit duration, providing extra degrees of freedom without enlarging the gate footprint; in simulation they are treated as ideal to isolate their benefit. From a tensor-network viewpoint, the alternating structure restricts the state to a low-bond-dimension MPS, matching the target smoothness (for 3 qubits, bond dimension <= 2). We optimize parameters with COBYLA to minimize infidelity and benchmark against exact state preparation (Qiskit) and a RealAmplitudes (CZ) baseline. Under depolarizing noise representative of NISQ and early fault-tolerant regimes, the proposed single-layer circuit achieves high ideal fidelity with O(n) depth and substantially higher noisy fidelity than deeper exact constructions. In coherent-noise sweeps, virtual Rz parameters absorb systematic phase errors and axis mismatch, maintaining near-unity fidelity over a wide error range. These results indicate that virtual-Rz-enabled, low-depth circuits provide a practical, noise-resilient state-preparation primitive for PDE solvers on NISQ and early FTQC hardware.
Variational quantum circuits (VQCs) are central to near-term quantum computing, yet their practical deployment is severely hindered by noise. While existing error mitigation methods, such as zero-noise extrapolation (ZNE), typically assume static noise, real noisy intermediate-scale quantum (NISQ) systems exhibit dynamic, time-varying noise that remains largely unaddressed. To overcome this critical gap, our work introduces a novel adaptive noise mitigation framework for VQCs that integrates ZNE with contextual multi-armed bandits (CMAB), enabling dynamic, context-aware selection of circuit-folding levels based on ansatz parameters (e.g., depth, parameter count) and the evolving noise environment. Unlike fixed-fold or heuristic ZNE, our approach uses online adaptation to improve the accuracy of ZNE and reduce redundant quantum circuit executions. Our extensive simulations and experiments on real quantum hardware reveal the following important properties: (i) deeper VQCs accumulate noise, degrading accuracy and increasing the number of quantum circuit executions; (ii) ZNE restores estimator fidelity when the folding level is chosen appropriately; and (iii) CMAB-guided folding cuts quantum circuit execution round trips by up to 40\%, bytes exchanged by up to 35\%, and end-to-end cost by up to 30\% under a 10~Mbps budget, with up to 6.9\% higher estimator fidelity (CIFAR-10, depth 3, noise band η=0.05), versus fixed-fold and grid-search ZNE. These results demonstrate substantial performance gains over existing noise mitigation methods, underscoring the effectiveness of our design in supporting robust noise mitigation for VQCs. The source code is also publicly released to support reproducibility.
Quantum noise poses a significant challenge for current near-term quantum computing. Quantum error mitigation (QEM) has therefore emerged as a key strategy, offering a practical and effective solution to reduce error impacts and enhance the performance of near-term variational quantum circuits (VQC). Given the lack of a comprehensive survey on this important topic in the literature, this article provides a dedicated overview of QEM, including both during and after the training of VQC. Specifically, during VQC training, we explore and discuss key QEM techniques such as optimal control and dynamical decoupling. For the post-processing stage of VQC, we will examine and discuss mitigation techniques such as zero-noise extrapolation (ZNE) and probabilistic error cancellation (PEC). For each of these QEM techniques, we will investigate the fundamentals, mitigation concepts, and recent advances. Subsequently, we also explore research toolboxes, including Mitiq and Qiskit Aer, as well as provide a case study that demonstrates contextual multi-armed bandit-guided ZNE. Finally, we discuss ongoing problems and future research initiatives, including ML-assisted mitigation and integration with error correction. This survey article aims to synthesize the state-of-the-art in QEM, offer organized insights across approaches, and propose potential paths towards error-resilient quantum computing.
Global variational quantum algorithm (VQA) frameworks for solving partial differential equations (PDEs) often rely on a single expressive ansatz over a uniform grid, which becomes structurally inefficient when solutions exhibit spatially heterogeneous complexity such as localized singularities or thin boundary layers. A localized nonsmooth feature can degrade the convergence of the entire global quantum representation, imposing unnecessary circuit depth and amplifying the risk of vanishing gradients in barren plateaus.
To overcome this limitation, we propose a block-wise VQA framework for PDEs characterized by spatially heterogeneous solution complexity. The computational domain is decomposed into locally represented quantum subproblems, where grid budgets and ansatz families are dynamically assigned based on a computable difficulty indicator. Artificial block interfaces are coupled through unified jump penalties for state values, derivatives, and physical fluxes, while adaptive reblocking tracks moving rough regions to maintain local accuracy without excessive global qubit overhead. The error analysis rigorously separates spatial discretization, ansatz expressivity, optimization convergence, finite-shot sampling noise, transfer errors from reblocking, and interface-coupling contributions. Reproducible residual-based simulations on representative elliptic, advection--diffusion, and Burgers problems demonstrate lower approximation errors and reduced peak local circuit width compared to global VQA approaches. These results substantiate block-wise quantum resource localization, confirming that high-fidelity PDE solutions can be achieved on near-term quantum devices without requiring a single globally expressive ansatz.
The paper presents a comprehensive review of current error mitigation strategies within quantum neural networks operating in the NISQ era. The research models complex hardware noise environments using Qiskit Aer simulators to evaluate various error compensation algorithms. Specifically, the study investigates how global depolarizing channels fundamentally flatten the optimization landscape and artificially exacerbate the barren plateaus phenomenon, effectively preventing the convergence of gradient-based optimizers. To address these hardware limitations, the study tests the efficiency of Zero-Noise Extrapolation (ZNE), Probabilistic Error Cancellation (PEC), Readout Error Mitigation (REM), and Clifford Data Regression (CDR). The empirical analysis demonstrates that quantum error mitigation techniques successfully restore the true direction of the gradient vector by compensating for the amplitude attenuation caused by decoherence. Consequently, the optimization process strictly requires an exponential or linear increase in the number of measurement shots to compensate for the heavily inflated statistical variance introduced by the mitigation models. The investigation identifies REM as a mandatory baseline classical processing step that corrects asymmetric measurement biases without incurring additional quantum sampling costs. Simultaneously, the study restricts the practical utility of ZNE to shallow quantum circuits to prevent the accumulation of severe extrapolation inaccuracies, which otherwise cause destabilizing oscillations during the late epochs of gradient descent. Furthermore, the analysis proves that while PEC supplies mathematically unbiased gradient estimators, its exponential sampling overhead renders it intractable for deep parameterized architectures. Moreover, the experiments reveal a complex trade-off between optimization accuracy and computational overhead on the quantum coprocessor, highlighting CDR as a highly scalable alternative that shifts the mitigation burden to classical pre-processing. As a result, the authors propose a dynamic orchestration methodology that strategically combines ZNE, CDR and PEC mitigation strategies throughout the training cycle to ensure stable gradient descent convergence while minimizing resource consumption. The findings provide a robust theoretical foundation for designing resilient hybrid quantum-classical machine learning architectures and integrating them into modern MLOps pipelines.