Quantum-Accelerated Solution of Nonlinear Equations from Variational Principles
- URL: http://arxiv.org/abs/2508.17606v1
- Date: Mon, 25 Aug 2025 02:19:17 GMT
- Title: Quantum-Accelerated Solution of Nonlinear Equations from Variational Principles
- Authors: Katsuhiro Endo, Kazuaki Z. Takahashi,
- Abstract summary: We introduce a novel algorithm tailored for fault-tolerant quantum computers (FTQCs)<n>Our approach recasts the static nonlinear problem as a time-evolution process, enabling an effective linearization amenable to quantum acceleration.<n>This work paves the way toward leveraging fault-tolerant quantum computing for complex nonlinear systems across physics and engineering disciplines.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The variational principle serves as a fundamental framework for describing equilibrium states of physical systems via the minimization or extremization of an energy-like functional. While quantum algorithms have demonstrated promising advances in efficiently solving linear problems rooted in this principle, extending these techniques to nonlinear equilibrium equations--ubiquitous in structural mechanics, fluid dynamics, and electromagnetism--remains an outstanding challenge. Here, we introduce a novel algorithm tailored for fault-tolerant quantum computers (FTQCs) that directly addresses nonlinear equilibrium conditions governed by the variational principle. Our approach recasts the static nonlinear problem as a time-evolution process, enabling an effective linearization amenable to quantum acceleration. This construction permits quantum acceleration of nonlinear equilibrium computations on FTQCs. Compared to classical solvers, our method offers significant memory savings without compromising accuracy, with computational complexity scaling linearly in simulation time and independent of system size. We validate the algorithm through accurate prediction of nonlinear deformation in springs and truss systems, demonstrating its potential for scalable quantum acceleration of nonlinear physical phenomena. This work paves the way toward leveraging fault-tolerant quantum computing for complex nonlinear systems across physics and engineering disciplines.
Related papers
- Alleviating Post-Linearization Challenges for Solving Nonlinear Systems on a Quantum Computer [0.0]
Carleman linearization provides a high dimensional infinite linear system corresponding to a finite nonlinear system.<n>We decompose the Hamiltonian into the weighted sum of non-unitary operators, namely the Sigma basis.<n>Once the Hamiltonian is decomposed, we then use the concept of unitary completion to construct the circuit.
arXiv Detail & Related papers (2026-02-06T14:56:39Z) - Quantum Homotopy Algorithm for Solving Nonlinear PDEs and Flow Problems [0.0]
Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing.<n>We present here a near-optimal, robust, and end-to-end quantum algorithm to solve time-dependent, dissipative, and nonlinear PDEs.
arXiv Detail & Related papers (2025-12-24T07:56:34Z) - Quantum algorithms for general nonlinear dynamics based on the Carleman embedding [2.5272147028897476]
We show that efficient quantum algorithms exist for a much wider class of nonlinear systems than previously known.<n>We also obtain several results related to the Poincar'e-Dulac theorem and diagonalization of the Car matrix.
arXiv Detail & Related papers (2025-09-08T19:09:05Z) - A time-marching quantum algorithm for simulation of the nonlinear Lorenz dynamics [0.0]
We develop a quantum algorithm that implements the time evolution of a second order time-discretized version of the Lorenz model.<n> Notably, we showcase that it accurately captures the structural characteristics of the Lorenz system.
arXiv Detail & Related papers (2025-06-26T15:08:00Z) - Quantum Speedup in Dissecting Roots and Solving Nonlinear Algebraic Equations [0.0]
It is shown that quantum computer can detect the existence of root of a function almost exponentially more efficient than the classical counterpart.<n>Various applications and implications are discussed, including a quantum algorithm for solving dense linear systems.
arXiv Detail & Related papers (2025-03-09T13:27:11Z) - A robust quantum nonlinear solver based on the asymptotic numerical method [14.736884598380557]
We introduce the quantum numerical method, a novel quantum nonlinear solver.<n>By linearizing nonlinear problems using the Taylor series, the method transforms them into sequences of linear equations solvable by quantum algorithms.<n>We perform experiments on a superconducting quantum processor from Quafu, successfully achieving up to 98% accuracy in the obtained nonlinear solution path.
arXiv Detail & Related papers (2024-12-05T07:39:29Z) - Quantum Simulation of Nonlinear Dynamical Systems Using Repeated Measurement [42.896772730859645]
We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations.
We apply this approach to the classic logistic and Lorenz systems in both integrable and chaotic regimes.
arXiv Detail & Related papers (2024-10-04T18:06:12Z) - Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers.
The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
arXiv Detail & Related papers (2024-03-25T14:06:18Z) - Probing the limits of variational quantum algorithms for nonlinear ground states on real quantum hardware: The effects of noise [1.3713777868185868]
We study the expressionivity of real-amplitude, hardware-efficient ansatz to capture the ground state of a nonlinear Schr"odinger equation.
Although quantum hardware noise impairs the evaluation of the energy cost function, certain small instances of the problem consistently converge to the ground state.
arXiv Detail & Related papers (2024-03-25T05:11:04Z) - 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) - Canonically consistent quantum master equation [68.8204255655161]
We put forth a new class of quantum master equations that correctly reproduce the state of an open quantum system beyond the infinitesimally weak system-bath coupling limit.
Our method is based on incorporating the knowledge of the reduced steady state into its dynamics.
arXiv Detail & Related papers (2022-05-25T15:22:52Z) - 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) - Designing Kerr Interactions for Quantum Information Processing via
Counterrotating Terms of Asymmetric Josephson-Junction Loops [68.8204255655161]
static cavity nonlinearities typically limit the performance of bosonic quantum error-correcting codes.
Treating the nonlinearity as a perturbation, we derive effective Hamiltonians using the Schrieffer-Wolff transformation.
Results show that a cubic interaction allows to increase the effective rates of both linear and nonlinear operations.
arXiv Detail & Related papers (2021-07-14T15:11:05Z) - Linear embedding of nonlinear dynamical systems and prospects for
efficient quantum algorithms [74.17312533172291]
We describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding)
We then explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation)
arXiv Detail & Related papers (2020-12-12T00:01:10Z)
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.