Mitigating Barren Plateaus via Domain Decomposition in Variational Quantum Algorithms for Nonlinear PDEs
Year: 2026
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Institutions: Imam Abdulrahman Bin Faisal University, Kyung Hee University, Université de Picardie Jules Verne, Technical University of Munich, Centre National de la Recherche Scientifique, Université Paris Cité, Sorbonne Université, Laboratoire Jacques-Louis Lions, King Abdullah University of Science and Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7140613352
