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:2609.36710

Block-Wise Variational Quantum Algorithms for PDEs with Interface Penalty Constraints

Hangran Jie, Yuntao Cui, Sunho Kim

quant-phSubmitted Sep 29, 2026• Announced Sep 30, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether spatially localized complexity in PDE solutions can be handled by separate variational quantum representations rather than one global ansatz. It proposes domain decomposition with monitor-based grid allocation, Fourier/QFT representations on smooth blocks, layered circuits on rough blocks, and penalties enforcing interface values and physical fluxes. Adaptive reblocking uses the reconstructed field, with transfer-error accounting and hysteresis. The analysis separates time, spatial, ansatz, optimization, sampling, interface, and transfer errors. Under an additional PDE-dependent residual-stability assumption isolating interface effects, it obtains $E_{\mathrm{int}}\le C_\Gamma\sqrt{\mathcal J_\Gamma/\lambda_{\min}}$. The approximation estimates and resource allocation build on standard spectral approximation and adaptive discretization results; no general performance advantage is proved. Four one-dimensional residual-minimization studies compare matched grid budgets and equal or neighboring parameter counts. In an elliptic transmission problem, adding flux control reduces block error from $0.8441$ to $0.003466$. Block errors are 33.4% lower for a moderate-budget advection–diffusion test and 76.3% lower for Burgers, while peak register width decreases by one qubit. Adaptive reblocking improves time-averaged error by 4.70% over static blocks; hysteresis reduces reblocking events from 78 to three. The main simulations optimize ansatz-space residuals, with rough blocks represented by expressive amplitude subspaces, not full circuits. A separate five-qubit circuit study tests target-state fitting; sampling tests inject Gaussian estimator noise. Global representations outperform blocks at a higher linear-test budget and after diffusive smoothing. Full finite-shot circuit trajectories, hardware noise, total execution costs, and higher-dimensional interfaces remain untested; quantum advantage is not established.

Likely largely AI-generatedIncrementalSmall numerics onlyStrong assumptionsOverclaims

Central claim may not hold: The abstract's claim of high-fidelity solutions on near-term quantum devices is not established by the predominantly classical ansatz-space PDE simulations and separate target-state and Gaussian-noise proxy tests. The abstract's lower-error comparison requires an operating-regime qualification because the global method wins at a higher tested parameter budget and at the adaptive experiment's final time. The local Fourier error bounds omit periodic compatibility or a boundary lifting/extension, so analyticity of a block restriction alone does not imply the asserted exponential or derivative convergence.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
25 pages, 5 figures, 3 tables

Related papers

Quantum Error Mitigation Strategies for Variational PDE-Constrained Circuits on Noisy Hardware

Prasad Nimantha Madusanka Ukwatta Hewage, Midhun Chakkravarthy, Ruvan Kumara Abeysekara

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.

quant-pharXiv:2604.10099•Apr 14, 2026•0 citations

Mitigating Barren Plateaus via Domain Decomposition in Variational Quantum Algorithms for Nonlinear PDEs

Laila S. Busaleh, Jeonghyeuk Kwon, Orlane Zang +2 more

Barren plateaus present a major challenge in the training of variational quantum algorithms (VQAs), particularly for large-scale discretizations of nonlinear partial differential equations. In this work, we introduce a domain decomposition framework to mitigate barren plateaus by localizing the cost functional. Our strategy is based on partitioning the spatial domain into overlapping subdomains, each associated with a localized parameterized quantum circuit and measurement operator. Numerical results for the time-independent Gross-Pitaevskii equation show that the domain-decomposed formulation, allowing subdomain iterations to be interleaved with optimization iterations, exhibits improved solution accuracy and stable optimization compared to the global VQA formulation.

arXiv:2603.24523•Mar 25, 2026•1 citation

Mitigating Barren Plateaus in Variational Quantum Circuits through PDE-Constrained Loss Functions

Prasad Nimantha Madusanka Ukwatta Hewage, Midhun Chakkravarthy, Ruvan Kumara Abeysekara

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.

quant-pharXiv:2604.09957•Apr 14, 2026•0 citations

Performance evaluation of variational quantum eigensolver and quantum dynamics algorithms on the advection-diffusion equation

A. Barış Özgüler

Near-term quantum algorithms are a promising route to solving partial differential equations, but gauging their true potential requires separating algorithmic performance from sampling and hardware noise. We benchmark a ground-state variational quantum eigensolver (VQE), cast as a variational quantum linear solver, against the Trotterization, variational quantum imaginary time evolution, and adaptive variational quantum dynamics simulation methods applied to the one-dimensional advection-diffusion equation in the recent quantum-dynamics study by Alipanah et al. [Phys. Rev. Res. 7, 043318 (2025)2643-156410.1103/ndc3-bdwt] at matched grid and problem size. On a noiseless state-vector simulator the N=4 VQE drives the final-time infidelity to a numerical floor (∼10^{-14}) once the depth reaches L≈5, an algorithmic ceiling set by exact expectation values. Evaluating the same solver with a finite number S of measurement shots, still without hardware noise, makes the infidelity sampling limited, following 1-f≈c/S (a best-case readout-sampling estimate, with the solution's signs assumed known), providing a regime-matched comparison with the shot-based emulator of Alipanah et al. and explaining the gap to their noisy hardware runs (>10^{-1}). The benchmark thus decomposes the near-term error budget into algorithmic, sampling, and hardware contributions, with a matched-depth resource comparison. The formulation applies without modification across N=4,5,6 qubits and to a two-dimensional (eight-qubit, 16×16) problem evolved to t=1, where the state-vector VQE holds a ∼10^{-7} algorithmic-ceiling infidelity against the sampling-limited ∼10^{-5} of the corresponding shot-based simulation, a difference of measurement regime rather than algorithmic superiority.

arXiv:2503.24045•Physical review. E•Jul 13, 2026•1 citation

Boundary treatment for variational quantum simulations of partial differential equations on quantum computers

Paul Over, Sergio Bengoechea, Thomas Rung +4 more

The paper presents a variational quantum algorithm to solve initial–boundary value problems described by second-order partial differential equations. The approach uses hybrid classical/quantum framework that is well suited for quantum computers of the current noisy intermediate-scale quantum era. The partial differential equation is initially translated into an optimal control problem with a modular control-to-state operator (ansatz). The objective function and its derivatives required by the optimizer can efficiently be evaluated on a quantum computer by measuring an ancilla qubit, while the optimization procedure employs classical hardware. The focal aspect of the study is the treatment of boundary conditions, which is tailored to the properties of the quantum hardware using a correction technique. For this purpose, the boundary conditions and the discretized terms of the partial differential equation are decomposed into a sequence of unitary operations and subsequently compiled into quantum gates. The accuracy and gate complexity of the approach are assessed for second-order partial differential equations by classically emulating the quantum hardware. The examples include steady and unsteady diffusive transport equations for a scalar property in combination with various Dirichlet, Neumann, or Robin conditions. The results of this flexible approach display a robust behavior and a strong predictive accuracy in combination with a remarkable polylog complexity scaling in the number of qubits of the involved quantum circuits. Remaining challenges refer to adaptive ansatz strategies that speed up the optimization procedure.

arXiv:2402.18619•Computers & Fluids•Dec 10, 2024•23 citations

Variational quantum algorithms for local Hamiltonian problems

Alexey Uvarov

Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization algorithm. The appeal of VQAs lies in their versatility, resistance to noise, and ability to demonstrate some results even with circuits of small depth. We primarily focus on the algorithm called variational quantum eigensolver (VQE), which takes a qubit Hamiltonian and returns its approximate ground state. We first present our numerical findings regarding VQE applied to two spin models and a variant of the Hubbard model. Next, we briefly touch the topic of quantum machine learning by developing a quantum classifier to partition quantum data. We further study the phenomenon of vanishing derivatives in VQAs, also known as barren plateaus phenomenon. We derive a new lower bound on variance of the derivatives, which depends on the causal structure of the ansatz circuit and the individual terms entering the Pauli decomposition of the problem Hamiltonian. In the final chapter of the thesis, we present our results on bounding the fidelity of experimentally prepared Clifford states using their parent Hamiltonians.

arXiv:2208.11220•Aug 23, 2022•0 citations
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 asks whether spatially localized complexity in PDE solutions can be handled by separate variational quantum representations rather than one global ansatz. It proposes domain decomposition with monitor-based grid allocation, Fourier/QFT representations on smooth blocks, layered circuits on rough blocks, and penalties enforcing interface values and physical fluxes. Adaptive reblocking uses the reconstructed field, with transfer-error accounting and hysteresis.
The analysis separates time, spatial, ansatz, optimization, sampling, interface, and transfer errors. Under an additional PDE-dependent residual-stability assumption isolating interface effects, it obtains Eint≤CΓJΓ/λmin⁡E_{\mathrm{int}}\le C_\Gamma\sqrt{\mathcal J_\Gamma/\lambda_{\min}}Eint​≤CΓ​JΓ​/λmin​​. The approximation estimates and resource allocation build on standard spectral approximation and adaptive discretization results; no general performance advantage is proved.
Four one-dimensional residual-minimization studies compare matched grid budgets and equal or neighboring parameter counts. In an elliptic transmission problem, adding flux control reduces block error from 0.84410.84410.8441 to 0.0034660.0034660.003466. Block errors are 33.4% lower for a moderate-budget advection–diffusion test and 76.3% lower for Burgers, while peak register width decreases by one qubit. Adaptive reblocking improves time-averaged error by 4.70% over static blocks; hysteresis reduces reblocking events from 78 to three.
The main simulations optimize ansatz-space residuals, with rough blocks represented by expressive amplitude subspaces, not full circuits. A separate five-qubit circuit study tests target-state fitting; sampling tests inject Gaussian estimator noise. Global representations outperform blocks at a higher linear-test budget and after diffusive smoothing. Full finite-shot circuit trajectories, hardware noise, total execution costs, and higher-dimensional interfaces remain untested; quantum advantage is not established.
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.
Barren plateaus present a major challenge in the training of variational quantum algorithms (VQAs), particularly for large-scale discretizations of nonlinear partial differential equations. In this work, we introduce a domain decomposition framework to mitigate barren plateaus by localizing the cost functional. Our strategy is based on partitioning the spatial domain into overlapping subdomains, each associated with a localized parameterized quantum circuit and measurement operator. Numerical results for the time-independent Gross-Pitaevskii equation show that the domain-decomposed formulation, allowing subdomain iterations to be interleaved with optimization iterations, exhibits improved solution accuracy and stable optimization compared to the global VQA formulation.
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.
Near-term quantum algorithms are a promising route to solving partial differential equations, but gauging their true potential requires separating algorithmic performance from sampling and hardware noise. We benchmark a ground-state variational quantum eigensolver (VQE), cast as a variational quantum linear solver, against the Trotterization, variational quantum imaginary time evolution, and adaptive variational quantum dynamics simulation methods applied to the one-dimensional advection-diffusion equation in the recent quantum-dynamics study by Alipanah et al. [Phys. Rev. Res. 7, 043318 (2025)2643-156410.1103/ndc3-bdwt] at matched grid and problem size. On a noiseless state-vector simulator the N=4 VQE drives the final-time infidelity to a numerical floor (∼10^{-14}) once the depth reaches L≈5, an algorithmic ceiling set by exact expectation values. Evaluating the same solver with a finite number S of measurement shots, still without hardware noise, makes the infidelity sampling limited, following 1-f≈c/S (a best-case readout-sampling estimate, with the solution's signs assumed known), providing a regime-matched comparison with the shot-based emulator of Alipanah et al. and explaining the gap to their noisy hardware runs (>10^{-1}). The benchmark thus decomposes the near-term error budget into algorithmic, sampling, and hardware contributions, with a matched-depth resource comparison. The formulation applies without modification across N=4,5,6 qubits and to a two-dimensional (eight-qubit, 16×16) problem evolved to t=1, where the state-vector VQE holds a ∼10^{-7} algorithmic-ceiling infidelity against the sampling-limited ∼10^{-5} of the corresponding shot-based simulation, a difference of measurement regime rather than algorithmic superiority.
The paper presents a variational quantum algorithm to solve initial–boundary value problems described by second-order partial differential equations. The approach uses hybrid classical/quantum framework that is well suited for quantum computers of the current noisy intermediate-scale quantum era. The partial differential equation is initially translated into an optimal control problem with a modular control-to-state operator (ansatz). The objective function and its derivatives required by the optimizer can efficiently be evaluated on a quantum computer by measuring an ancilla qubit, while the optimization procedure employs classical hardware. The focal aspect of the study is the treatment of boundary conditions, which is tailored to the properties of the quantum hardware using a correction technique. For this purpose, the boundary conditions and the discretized terms of the partial differential equation are decomposed into a sequence of unitary operations and subsequently compiled into quantum gates. The accuracy and gate complexity of the approach are assessed for second-order partial differential equations by classically emulating the quantum hardware. The examples include steady and unsteady diffusive transport equations for a scalar property in combination with various Dirichlet, Neumann, or Robin conditions. The results of this flexible approach display a robust behavior and a strong predictive accuracy in combination with a remarkable polylog complexity scaling in the number of qubits of the involved quantum circuits. Remaining challenges refer to adaptive ansatz strategies that speed up the optimization procedure.
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization algorithm. The appeal of VQAs lies in their versatility, resistance to noise, and ability to demonstrate some results even with circuits of small depth. We primarily focus on the algorithm called variational quantum eigensolver (VQE), which takes a qubit Hamiltonian and returns its approximate ground state. We first present our numerical findings regarding VQE applied to two spin models and a variant of the Hubbard model. Next, we briefly touch the topic of quantum machine learning by developing a quantum classifier to partition quantum data. We further study the phenomenon of vanishing derivatives in VQAs, also known as barren plateaus phenomenon. We derive a new lower bound on variance of the derivatives, which depends on the causal structure of the ansatz circuit and the individual terms entering the Pauli decomposition of the problem Hamiltonian. In the final chapter of the thesis, we present our results on bounding the fidelity of experimentally prepared Clifford states using their parent Hamiltonians.