A Scalable Approach to Solve the Carleman Linearized Burgers' Equation on a Quantum Computer

• URL: http://arxiv.org/abs/2607.08976v1
• Date: Thu, 09 Jul 2026 22:44:18 GMT
• Title: A Scalable Approach to Solve the Carleman Linearized Burgers' Equation on a Quantum Computer
• Abstract summary: The Carleman linearization method has been proposed to transform a nonlinear ordinary differential equation into a linear system of equations.<n>Here, we address several major challenges enabling us to solve the Carleman linearized one-dimensional Burgers' equation on real and simulated quantum hardware.<n> circuits with a combined number of spatial and temporal discretization points totaling up to $280 approx 1024$ are transpiled onto real quantum hardware.
• Score: 0.16311150636417257
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Efficiently solving nonlinear ordinary and partial differential equations using a quantum computer is a major challenge due its inherent linearity. To circumvent this challenge, the Carleman linearization method has been proposed to transform a nonlinear ordinary differential equation into a linear system of equations, the primary advantage being that existing quantum linear systems algorithms may then be applied to obtain a solution. However, this methodology also brings forth several major challenges that must be addressed to attain a quantum advantage. Herein, we address several of these challenges enabling us to solve the Carleman linearized one-dimensional Burgers' equation on real and simulated quantum hardware. All simulations were performed on BlueQubit's platform allowing for quantum circuits to be run on GPU or QPU's seamlessly. We first demonstrate that the Carleman linearized Burgers' equation can be efficiently loaded onto a quantum computer using the linear combination of non-unitaries method, an alternative to the linear combintaiton of unitaries approach. Once loaded, the linear system is then solved using the variational quantum linear solver. Since a naive implementation of this solver is hindered by the barren plateau phenomenon, we introduce a multigridding method to solve the problem in a series of stages with the solution of the previous stage acting as a warm start for the next stage. This approach is found to significantly improve the accuracy of the solution compared with a naive cold start. Finally, circuits with a combined number of spatial and temporal discretization points totaling up to $2^{80} \approx 10^{24}$ are transpiled onto real quantum hardware demonstrating that the proposed methodology could feasibly produce a quantum advantage on future hardware.

Related papers

• Provably Efficient Quantum Algorithms for Solving Nonlinear Differential Equations Using Multiple Bosonic Modes Coupled with Qubits [9.366500214140164]
  We present an analog, continuous-variable algorithm based on bosonic modes with qubit-based adaptive measurements that avoids Hilbert-space digitization.<n>Unlike many analog schemes, the algorithm is provably efficient: advancing a first-order, $L$-grid point, $d$-dimensional, order-$K$ spatial-derivative, degree-$r$-nonline.
  arXiv  Detail & Related papers  (2025-11-13T04:09:32Z)
• New Quantum Algorithm For Solving Linear System of Equations [0.0]
  We introduce a new quantum algorithm for solving linear systems based on the gradient descent method.<n>Inspired by the vector/density state formalism, we represent a point, or vector, as a density state-like entity.<n>The operator corresponding to the intermediate solution is updated iteratively, with a provable guarantee of convergence.
  arXiv  Detail & Related papers  (2025-02-19T11:08:56Z)
• An N-Point Linear Solver for Line and Motion Estimation with Event Cameras [45.67822962085412]
  Event cameras respond primarily to edges--formed by strong gradients--that are well-suited for motion estimation. Recent work has shown that events generated by single lines satisfy a novel constraint which describes a manifold in space-time volume. We show that, with suitable line parametrization, this system of constraints is actually linear in the unknowns.
  arXiv  Detail & Related papers  (2024-04-01T00:47:02Z)
• Solving nonlinear differential equations on Quantum Computers: A Fokker-Planck approach [5.0401589279256065]
  We propose to transform a nonlinear dynamical system into a linear system, which we integrate with quantum algorithms. Key to the method is the Fokker-Planck equation, which is a non-normal partial differential equation. We emulate the integration of nonlinear systems with the proposed quantum solvers, and compare the output with the benchmark solutions of classical equations.
  arXiv  Detail & Related papers  (2024-01-24T14:48:55Z)
• 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)
• Improving the convergence of an iterative algorithm for solving arbitrary linear equation systems using classical or quantum binary optimization [39.58317527488534]
  We propose a novel method for solving linear systems. We transform the linear system into a binary optimization problem, drawing inspiration from the geometry of the original problem. We demonstrate that by leveraging partial knowledge of the problem's intrinsic geometry, we can decompose the original problem into smaller, independent sub-problems.
  arXiv  Detail & Related papers  (2023-09-18T16:51:03Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Accelerating the training of single-layer binary neural networks using the HHL quantum algorithm [58.720142291102135]
  We show that useful information can be extracted from the quantum-mechanical implementation of Harrow-Hassidim-Lloyd (HHL) This paper shows, however, that useful information can be extracted from the quantum-mechanical implementation of HHL, and used to reduce the complexity of finding the solution on the classical side.
  arXiv  Detail & Related papers  (2022-10-23T11:58:05Z)
• How viable is quantum annealing for solving linear algebra problems? [0.0]
  We evaluate the meta-heuristic for various problems in linear algebra using quantum annealers. We use simulations based on the adiabatic principle to provide new insights for previously observed phenomena. We propose a hybrid approach which uses a quantum annealer to provide a initial guess of the solution.
  arXiv  Detail & Related papers  (2022-06-21T17:55: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)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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)

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.