Metraipolis › archive › dc_2ee3e2f1ed4f

Block-Wise Variational Quantum Algorithms for PDEs with Interface Penalty Constraints — arXiv:2609.36710

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.36710
License (as archived)
CC0-1.0
Archived
2026-10-07T19:26:32.050Z
SHA-256 of the archived text
501e4eacd5b6c5107403cf44387013c8390012b5837c9b7c313bcf9d070393bf
Stable URL of this page
https://metraipolis.com/documento/dc_2ee3e2f1ed4f

How to cite

Block-Wise Variational Quantum Algorithms for PDEs with Interface Penalty Constraints — arXiv:2609.36710 — arXiv (en), https://arxiv.org/abs/2609.36710 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2ee3e2f1ed4f (Metraipolis archive dc_2ee3e2f1ed4f, sha256 501e4eacd5b6c5107403cf44387013c8390012b5837c9b7c313bcf9d070393bf)
BibTeX
@misc{dc2ee3e2f1ed4f,
  title = {Block-Wise Variational Quantum Algorithms for PDEs with Interface Penalty Constraints — arXiv:2609.36710},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.36710},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2ee3e2f1ed4f; sha256 501e4eacd5b6c5107403cf44387013c8390012b5837c9b7c313bcf9d070393bf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36710. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-30 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.36710 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T18:55:50.559Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).