Quantum algorithm for solving nonlinear differential equations based on physics-informed effective Hamiltonians

• URL: http://arxiv.org/abs/2504.13174v1
• Date: Thu, 17 Apr 2025 17:59:33 GMT
• Title: Quantum algorithm for solving nonlinear differential equations based on physics-informed effective Hamiltonians
• Authors: Hsin-Yu Wu, Annie E. Paine, Evan Philip, Antonio A. Gentile, Oleksandr Kyriienko,
• Abstract summary: We propose a distinct approach to solving differential equations on quantum computers by encoding the problem into ground states of effective Hamiltonian operators.<n>Our algorithm relies on constructing such operators in the Chebyshev space, where an effective Hamiltonian is a sum of global differential and data constraints.
• Score: 14.379311972506791
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a distinct approach to solving linear and nonlinear differential equations (DEs) on quantum computers by encoding the problem into ground states of effective Hamiltonian operators. Our algorithm relies on constructing such operators in the Chebyshev space, where an effective Hamiltonian is a sum of global differential and data constraints. Once the effective Hamiltonian is formed, solutions of differential equations can be obtained using the ground state preparation techniques (e.g. imaginary-time evolution and quantum singular value transformation), bypassing variational search. Unlike approaches based on discrete grids, the algorithm enables evaluation of solutions beyond fixed grid points and implements constraints in the physics-informed way. Our proposal inherits the best traits from quantum machine learning-based DE solving (compact basis representation, automatic differentiation, nonlinearity) and quantum linear algebra-based approaches (fine-grid encoding, provable speed-up for state preparation), offering a robust strategy for quantum scientific computing in the early fault-tolerant era.

Related papers

• Hamiltonian Neural Networks approach to fuzzball geodesics [39.58317527488534]
  Hamiltonian Neural Networks (HNNs) are tools that minimize a loss function to solve Hamilton equations of motion.<n>In this work, we implement several HNNs trained to solve, with high accuracy, the Hamilton equations for a massless probe moving inside a smooth and horizonless geometry known as D1-D5 circular fuzzball.
  arXiv  Detail & Related papers  (2025-02-28T09:25:49Z)
• 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)
• Explicit near-optimal quantum algorithm for solving the advection-diffusion equation [0.0]
  An explicit quantum algorithm is proposed for modeling dissipative initial-value problems.<n>We propose a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function.<n>The proposed algorithm can be used for modeling a wide class of nonunitary initial-value problems.
  arXiv  Detail & Related papers  (2025-01-19T19:03:29Z)
• Quantum algorithms to simulate quadratic classical Hamiltonians and optimal control [0.0]
  We develop quantum algorithms to estimate quantities of interest in a given classical mechanical system. We consider the problem of designing optimal control of classical systems, which can be cast as the second variation of the Lagrangian. We give an efficient quantum algorithm to solve the Riccati differential equation well into the nonlinear regime.
  arXiv  Detail & Related papers  (2024-04-10T18:53:22Z)
• 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)
• 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)
• 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 gradient descent algorithms for nonequilibrium steady states and linear algebraic systems [0.17188280334580192]
  gradient descent is a key ingredient in variational quantum algorithms and machine learning tasks. We present approaches to simulate the nonequilibrium steady states of Markovian open quantum many-body systems. We adapt the quantum gradient descent algorithm to solve linear algebra problems including linear systems of equations and matrix-vector multiplications.
  arXiv  Detail & Related papers  (2022-04-15T01:20:33Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• 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)
• 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.