Solving the 3D Heat Equation with VQA via Remeshing-Based Warm Starts

• URL: http://arxiv.org/abs/2510.15645v1
• Date: Fri, 17 Oct 2025 13:34:42 GMT
• Title: Solving the 3D Heat Equation with VQA via Remeshing-Based Warm Starts
• Authors: Samuel Donachie, Ulysse Remond, Arthur Mathorel, Kyryl Kazymyrenko,
• Abstract summary: Variational Quantum Algorithms (VQAs) have emerged as a leading candidate for near-term applications.<n>In this work, we investigate the use of VQAs to solve PDEs arising in stationary heat transfer.<n>This work provides a practical methodology for applying VQAs to PDEs, offering insight into the capabilities and limitations of current quantum hardware.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing holds great promise for solving classically intractable problems such as linear systems and partial differential equations (PDEs). While fully fault-tolerant quantum computers remain out of reach, current noisy intermediate-scale quantum (NISQ) devices enable the exploration of hybrid quantum-classical algorithms. Among these, Variational Quantum Algorithms (VQAs) have emerged as a leading candidate for near-term applications. In this work, we investigate the use of VQAs to solve PDEs arising in stationary heat transfer. These problems are discretized via the finite element method (FEM), yielding linear systems of the form Ku=f, where K is the stiffness matrix. We define a cost function that encodes the thermal energy of the system, and optimize it using various ansatz families. To improve trainability and bypass barren plateaus, we introduce a remeshing strategy which gradually increases resolution by reusing optimized parameters from coarser discretizations. Our results demonstrate convergence of scalar quantities with mesh refinement. This work provides a practical methodology for applying VQAs to PDEs, offering insight into the capabilities and limitations of current quantum hardware.

Related papers

• A Quantum Linear Systems Pathway for Solving Differential Equations [0.0]
  We present a systematic pathway for solving differential equations within the quantum linear systems framework.<n>The approach is demonstrated on a complex tridiagonal linear system and extended to problems in computational fluid dynamics.<n>This pathway lays a foundation for advancing quantum linear system methods toward large-scale applications.
  arXiv  Detail & Related papers  (2025-10-08T10:01:38Z)
• Solving wave equation problems on D-Wave quantum annealers [44.99833362998488]
  We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by the D-Wave systems within a pseudospectral scheme.<n>We assess the performance of different strategies of encoding based on algebraic arguments and the adiabatic condition.
  arXiv  Detail & Related papers  (2025-07-18T08:06:43Z)
• On Quantum BSDE Solver for High-Dimensional Parabolic PDEs [8.072353085704627]
  This study employs the pure Variational Quantum Circuit (VQC) as the core solver without trainable classical neural networks.<n>We benchmark VQCbased and classical deep neural network (DNN) solvers on two canonical PDEs as representatives.<n>The VQC achieves lower variance and improved accuracy in most cases, particularly in highly nonlinear regimes.
  arXiv  Detail & Related papers  (2025-06-17T15:10:42Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Demonstration of Scalability and Accuracy of Variational Quantum Linear Solver for Computational Fluid Dynamics [0.0]
  This paper presents an exploration of quantum methodologies aimed at achieving high accuracy in solving such a large system of equations. We consider the 2D, transient, incompressible, viscous, non-linear coupled Burgers equation as a test problem. Our findings demonstrate that our quantum methods yield results comparable in accuracy to traditional approaches.
  arXiv  Detail & Related papers  (2024-09-05T04:42:24Z)
• Hybrid quantum-classical and quantum-inspired classical algorithms for solving banded circulant linear systems [0.8192907805418583]
  We present an efficient algorithm based on convex optimization of combinations of quantum states to solve for banded circulant linear systems. By decomposing banded circulant matrices into cyclic permutations, our approach produces approximate solutions to such systems with a combination of quantum states linear to $K$. We validate our methods with classical simulations and actual IBM quantum computer implementation, showcasing their applicability for solving physical problems such as heat transfer.
  arXiv  Detail & Related papers  (2023-09-20T16:27:16Z)
• Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
  "Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
  arXiv  Detail & Related papers  (2023-07-06T17:54:08Z)
• A Performance Study of Variational Quantum Algorithms for Solving the Poisson Equation on a Quantum Computer [0.0]
  Partial differential equations (PDEs) are used in material or flow simulation. The most promising route to useful deployment of quantum processors in the short to near term are so-called hybrid variational quantum algorithms (VQAs) We conduct an extensive study of utilizing VQAs on real quantum devices to solve the simplest prototype of a PDE -- the Poisson equation.
  arXiv  Detail & Related papers  (2022-11-25T12:39:13Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.