Alleviating Post-Linearization Challenges for Solving Nonlinear Systems on a Quantum Computer

• URL: http://arxiv.org/abs/2602.07097v1
• Date: Fri, 06 Feb 2026 14:56:39 GMT
• Title: Alleviating Post-Linearization Challenges for Solving Nonlinear Systems on a Quantum Computer
• Authors: Tayyab Ali,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The linearity inherent in quantum mechanics limits current quantum hardware from directly solving nonlinear systems governed by nonlinear differential equations. One can opt for linearization frameworks such as Carleman linearization, which provides a high dimensional infinite linear system corresponding to a finite nonlinear system, as an indirect way of solving nonlinear systems using current quantum computers. We provide an efficient data access model to load this infinite linear representation of the nonlinear system, upto truncation order $N$, on a quantum computer by decomposing the Hamiltonian into the weighted sum of non-unitary operators, namely the Sigma basis. We have shown that the Sigma basis provides an exponential reduction in the number of decomposition terms compared to the traditional decomposition, which is usually done in a linear combination of Pauli operators. Once the Hamiltonian is decomposed, we then use the concept of unitary completion to construct the circuit for the implementation of each weighted tensor product component $\mathcal{H}_{j}$ of the decomposition.

Related papers

• Explicit Discovery of Nonlinear Symmetries from Dynamic Data [50.20526548924647]
  LieNLSD is the first method capable of determining the number of infinitesimal generators with nonlinear terms and their explicit expressions.<n>LieNLSD shows qualitative advantages over existing methods and improves the long rollout accuracy of neural PDE solvers by over 20%.
  arXiv  Detail & Related papers  (2025-10-02T09:54:08Z)
• 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)
• Quantum-Accelerated Solution of Nonlinear Equations from Variational Principles [0.0]
  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.
  arXiv  Detail & Related papers  (2025-08-25T02:19:17Z)
• A Polynomial Time Quantum Algorithm for Exponentially Large Scale Nonlinear Differential Equations via Hamiltonian Simulation [1.6003521378074745]
  We introduce a class of systems of nonlinear ODEs that can be efficiently solved on quantum computers.<n>Specifically, we employ the Koopman-von Neumann linearization to map the system of nonlinear ODEs to Hamiltonian dynamics.<n>This is the first concrete example of solving systems of nonlinear ODEs with exponential quantum speedup.
  arXiv  Detail & Related papers  (2023-05-01T04:22:56Z)
• Dynamical chaos in nonlinear Schr\"odinger models with subquadratic power nonlinearity [137.6408511310322]
  We deal with a class of nonlinear Schr"odinger lattices with random potential and subquadratic power nonlinearity. We show that the spreading process is subdiffusive and has complex microscopic organization. The limit of quadratic power nonlinearity is also discussed and shown to result in a delocalization border.
  arXiv  Detail & Related papers  (2023-01-20T16:45:36Z)
• Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations [31.986350313948435]
  We construct quantum algorithms to compute the solution and/or physical observables of nonlinear ordinary differential equations. We compare the quantum linear systems algorithms based methods and the quantum simulation methods arising from different numerical approximations.
  arXiv  Detail & Related papers  (2022-09-18T05:50:23Z)
• Exact solutions of interacting dissipative systems via weak symmetries [77.34726150561087]
  We analytically diagonalize the Liouvillian of a class Markovian dissipative systems with arbitrary strong interactions or nonlinearity. This enables an exact description of the full dynamics and dissipative spectrum. Our method is applicable to a variety of other systems, and could provide a powerful new tool for the study of complex driven-dissipative quantum systems.
  arXiv  Detail & Related papers  (2021-09-27T17:45:42Z)
• 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)
• StarNet: Gradient-free Training of Deep Generative Models using Determined System of Linear Equations [47.72653430712088]
  We present an approach for training deep generative models based on solving determined systems of linear equations. A network that uses this approach, called a StarNet, has the following desirable properties.
  arXiv  Detail & Related papers  (2021-01-03T08:06:42Z)
• 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.