arXiv:2609.36710
Block-Wise Variational Quantum Algorithms for PDEs with Interface Penalty Constraints
Hangran Jie, Yuntao Cui, Sunho Kim
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.
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