Quantum algorithm for differential equations via permutation matrix representation with application to the Burgers equation

• URL: http://arxiv.org/abs/2608.19508v1
• Date: Wed, 19 Aug 2026 23:52:03 GMT
• Title: Quantum algorithm for differential equations via permutation matrix representation with application to the Burgers equation
• Abstract summary: We develop a quantum algorithm for solving the dynamics of the nonlinear Burgers equation.<n>We show that our algorithm scales with the off-diagonal norm of the Carleman generator instead of the matrix norm.<n>We extend the PMR scheme to general fluid equations that may contain higher-order derivatives or nonlinear terms.
• Score: 0.1274452325287335
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a quantum algorithm for solving the dynamics of the nonlinear viscous Burgers equation. We apply the Carleman linearization procedure on the spatially discretized equation, followed by a padding scheme that allows implementation on qubit registers. Existing Carleman-based quantum algorithms commonly formulate the lifted linear differential equation in an oracle model. Here we decompose the padded generator into diagonal masks and reversible arithmetic permutations using the Permutation Matrix Representation (PMR), which we show to be naturally compatible with the Linear Combination of Hamiltonian Simulations (LCHS) algorithm. Under the assumptions required by LCHS - most importantly positive semidefiniteness of the Hermitian part of the linear generator, possibly after a stabilizing shift - the algorithm prepares a normalized quantum state proportional to the solution of the truncated lifted system; the stabilizing shift introduces an exponential postselection overhead, which we quantify and mitigate through a rescaling scheme. We show that our algorithm scales with the off-diagonal norm of the Carleman generator instead of the matrix norm, which can be advantageous for other generators that are diagonally dominant. We also extend the PMR scheme to general fluid equations that may contain higher-order derivatives or nonlinear terms, or may involve multiple fluid variables or spatial dimensions. The construction illustrates how PMR can serve as a convenient Hamiltonian-simulation primitive for a broader class of LCU-based algorithms.

Related papers

• Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems [0.007807026251125201]
  We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations.<n>For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query $widetildemathcalO(mathcalL t/)$.<n>We demonstrate the utility of the algorithm through an end-to-end application, namely the simulation of dissipative dynamics for non-interacting fermions.
  arXiv  Detail & Related papers  (2026-05-15T17:11:07Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• A Hybrid Quantum Solver for Gaussian Process Regression [0.0]
  Variational Quantum Linear solver is a hybrid quantum-classical algorithm that solves linear systems of equations.<n>It can be used to compute the posterior distribution of a Gaussian process by reformulating the matrix inversion into a set of linear systems of equations.
  arXiv  Detail & Related papers  (2025-10-17T09:57:27Z)
• Self-Supervised Coarsening of Unstructured Grid with Automatic Differentiation [55.88862563823878]
  In this work, we present an original algorithm to coarsen an unstructured grid based on the concepts of differentiable physics.<n>We demonstrate performance of the algorithm on two PDEs: a linear equation which governs slightly compressible fluid flow in porous media and the wave equation.<n>Our results show that in the considered scenarios, we reduced the number of grid points up to 10 times while preserving the modeled variable dynamics in the points of interest.
  arXiv  Detail & Related papers  (2025-07-24T11:02:13Z)
• A Quantum-Inspired Algorithm for Wave Simulation Using Tensor Networks [0.0]
  We present an efficient classical algorithm for simulating the Isotropic Wave Equation (IWE) in one, two, or three dimensions.<n>Exact diagonalization of the unitary circuit in combination with Networks allows simulation of the wave equation with a resolution of $1013$ grid points on a laptop.
  arXiv  Detail & Related papers  (2025-04-15T13:36:08Z)
• An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations [0.0]
  We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS)<n>This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions.<n>We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation.
  arXiv  Detail & Related papers  (2025-01-19T19:03:29Z)
• Quantum Algorithm for Solving the Advection Equation using Hamiltonian Simulation [0.0]
  One-dimensional advection can be simulated directly since the central finite difference operator for first-order derivatives is anti-Hermitian. A single copy of the initial quantum state is required and the circuit depth grows linearly with the required number of time steps.
  arXiv  Detail & Related papers  (2023-12-15T13:39:27Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Quantum algorithms for generator coordinate methods [12.744157326232749]
  This paper discusses quantum algorithms for the generator coordinate method (GCM) that can be used to benchmark molecular systems. We illustrate the performance of the quantum algorithm for constructing a discretized form of the Hill-Wheeler equation for ground and excited state energies.
  arXiv  Detail & Related papers  (2022-12-19T01:22:19Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)

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.