Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2411.03599

Structure-preserving quantum algorithms for linear and nonlinear Hamiltonian systems

Hsuan-Cheng Wu, Xiantao Li

Published Nov 6, 2024• 6 citations
arXivHTMLPDF

Abstract

Hamiltonian systems of ordinary and partial differential equations are fundamental mathematical models spanning virtually all physical scales. A critical property for the robustness and stability of computational methods in such systems is the underlying symplectic structure, which preserves geometric properties like phase-space volume over time and energy conservation over an extended period. In this paper, we present quantum algorithms that incorporate symplectic integrators, ensuring the preservation of this key structure. We demonstrate how these algorithms maintain the symplectic properties for both linear and nonlinear Hamiltonian systems. Additionally, we provide a comprehensive theoretical analysis of the computational complexity, showing that our approach offers both accuracy and improved efficiency over classical algorithms. These results highlight the potential application of quantum algorithms for solving large-scale Hamiltonian systems while preserving essential physical properties.

DOI
10.48550/arxiv.2411.03599

Related papers

Cayley Commutator-free Methods for Krotov-Type Algorithms in Quantum Optimal Control

Boris Wembe, Usman Ali, T. Meier +1 more

This paper presents a class of structure-preserving numerical methods for quantum optimal control problems, based on commutator-free Cayley integrators. Starting from the Krotov framework, we reformulate the forward and backward propagation steps using Cayley-type schemes that preserve unitarity and symmetry at the discrete level. This approach eliminates the need for matrix exponentials and commutators, leading to significant computational savings while maintaining higher-order accuracy. We first recall the standard linear setting and then extend the formulation to nonlinear Schrödinger and Gross-Pitaevskii equations using a Cayley-polynomial interpolation strategy. Numerical experiments on state-transfer problems illustrate that the CF-Cayley method achieves the same accuracy as high-order exponential or Cayley-Magnus schemes at substantially lower cost, especially for longtime or highly oscillatory dynamics. In the nonlinear regime, the structure-preserving properties of the method ensure stability and norm conservation, making it a robust tool for large-scale quantum control simulations. The proposed framework thus bridges geometric integration and optimal control, offering an efficient and reliable alternative to existing exponential-based propagators.

arXiv:2603.11697•Mar 12, 2026•1 citation

Quantum Homotopy Algorithm for Solving Nonlinear PDEs and Flow Problems

Sachin S. Bharadwaj, Balasubramanya Nadiga, Stephan Eidenbenz +1 more

Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present a near-optimal, robust, and end-to-end quantum algorithm to solve time-dependent, dissipative, nonlinear PDEs. We embed the PDEs in a truncated, high-dimensional linear space on the basis of quantum homotopy analysis. The linearized system is discretized and integrated using finite-difference methods with a compact quantum algorithm. The present approach can adapt its input to the nature of nonlinearity and underlying physics. The complexity estimates improve existing approaches in terms of the time-marching system size, simulation time, accuracy parameters, and post-selection parameters. We provide a general embedding strategy, bounds on stability criteria, accuracy, gate counts, and query complexity. A physically motivated measure of nonlinearity is connected to a parameter similar to the flow Reynolds number $Re_{\textrm{H}}$, whose inverse marks the allowed integration window, for given accuracy and complexity. We illustrate the embedding scheme with numerical simulations of Burgers, Fisher--KPP, damped Kuramoto--Sivashinsky, and real Ginzburg--Landau/Allen--Cahn equations. Together, these examples encompass cubic nonlinearity and saturation, quadratic transport, and fourth-order dissipative stiffness. This work shows the potential of hybrid quantum algorithms for simulating nonlinear problems on near-term and fault-tolerant devices.

quant-pharXiv:2512.21033•Dec 25, 2025•4 citations

A Polynomial Time Quantum Algorithm for Exponentially Large Scale Nonlinear Differential Equations via Hamiltonian Simulation

Yu Tanaka, Keisuke Fujii

Quantum computers have the potential to efficiently solve a system of nonlinear ordinary differential equations (ODEs), which play a crucial role in various industries and scientific fields. However, it remains unclear which system of nonlinear ODEs, and under what assumptions, can achieve exponential speedup using quantum computers. In this work, we introduce a class of systems of nonlinear ODEs that can be efficiently solved on quantum computers, where the efficiency is defined as solving the system with computational complexity of $O(T {\rm log}(N) {\rm polylog}(1/ε))$, where $T$ is the evolution time, $ε$ is the allowed error, and $N$ is the number of variables in the system. Specifically, we employ the Koopman-von Neumann linearization to map the system of nonlinear ODEs to Hamiltonian dynamics and find conditions where the norm of the mapped Hamiltonian is preserved and the Hamiltonian is sparse. This allows us to use the optimal Hamiltonian simulation technique for solving the nonlinear ODEs with $O({\rm log}(N))$ overhead. Furthermore, we show that the nonlinear ODEs include a wide range of systems of nonlinear ODEs, such as the nonlinear harmonic oscillators and the short-range Kuramoto model. This is the first concrete example of solving systems of nonlinear ODEs with exponential quantum speedup by the Koopman-von Neumann linearization, although it is noted that this assumes efficient preparation of the initial state and computation of the output. These findings contribute significantly to the application of quantum computers in solving nonlinear problems.

arXiv:2305.00653•May 1, 2023•15 citations

Symplectic perspective to quantum computing for Hamiltonian systems

Efstratios Koukoutsis, Kyriakos Hizanidis, Lucas I Inigo Gamiz +4 more

This work develops a symplectic framework for quantum computing to be applied to classical Hamiltonian systems, exploiting the intrinsic geometric compatibility between unitary quantum evolution and symplectic phase-space dynamics in a two-fold way. The first part is devoted in establishing an exact correspondence between quantum evolution and classical Hamiltonian flow on a Kahler manifold. This correspondence enables a geometric quantization scheme that identifies a family of classical Hamiltonian systems admitting exponentially compressed quantum representations-appropriate for quantum simulation. In the second part we demonstrate that Liouville-integrable Hamiltonian dynamics induce finite-dimensional unitary evolution through action-angle variables and Koopman-von Neumann encoding. This allows efficient quantum representation and parallel evolution of large phase-space ensembles, where entangled encodings provide exponential compression in ensemble size and enable quantum speed-ups in observable estimation via amplitude estimation techniques. For non-integrable systems, Lie canonical perturbation theory is incorporated to construct near-symplectic transformations that map dynamics to approximately integrable forms, preserving unitary evolution up to a controlled error. We derive the resulting quantum computational complexity of the proposed quantum-symplectic scheme, revealing both an exponential compression in memory requirements and a potential polynomial speed-up with respect to the system size. Finally, the transport evolution equation governing the quantum phase-space observables is obtained.

quant-pharXiv:2604.10794•Apr 14, 2026•1 citation

Structure preserving Quantum Algorithms for Linear Ordinary Differential Equations

Mohit Rohida, Alok Shukla, Prakash Vedula

Many scientific and engineering problems are governed by differential equations whose analytical solutions are unavailable, making numerical discretization indispensable. Classical numerical schemes generally fail to preserve the geometric and symmetry properties of the underlying differential equations, which can adversely affect numerical accuracy. In this work, we combine Lie symmetry-preserving numerical discretization with Quantum Linear Systems Algorithms (QLSAs) to develop a quantum framework for solving first-order linear ordinary differential equations. Using the moving-frame invariantization method, we construct a Lie symmetry-preserving variant of the classical Euler method, referred to as the Lie-Euler scheme. Both the classical Euler and Lie-Euler discretizations are formulated as sparse linear systems and solved using the Harrow-Hassidim-Lloyd algorithm. The Lie-Euler discretization preserves the underlying Lie symmetry and improves the global discretization error from O(h) to O(h 2 ), allowing a prescribed accuracy to be achieved using fewer discretization points and hence smaller linear systems with reduced qubit requirements. Furthermore, for an important class of dissipative problems, we prove that the associated Lie-Euler matrices possess uniformly bounded spectral condition numbers, yielding stronger asymptotic complexity guarantees for modern QLSAs. Numerical examples demonstrate the effectiveness of the proposed framework.

•Jul 6, 2026•0 citations

Quantum algorithms for differential equations in finance and physics

González Conde, Javier

In this thesis, we investigate the end-to-end implementation of quantum algorithms for solving differential equations through Hamiltonian simulation, with applications in finance, semi-classical physics, and hardware benchmarking. We particularly focus on the challenge of efficiently loading an initial state into a quantum computer, an area of research that has received limited exploration and whose existing methods have faced scrutiny regarding their robustness and efficiency. This work includes developing advanced techniques for encoding discretized real functions into quantum states and demonstrates how Hamiltonian simulation can be utilized to address the solution of linear partial differential equations through three key examples. These examples illustrate applications ranging from simulating non-Hermitian dynamics in finance to integrating classical Hamiltonian mechanics with quantum mechanics for semi-classical simulations, and introducing time-dependent coefficients for hardware benchmarking. Additionally, it is proposed a novel approach to connect the efficiency of quantum algorithms for nonlinear partial differential equations with physical parameters in fluid dynamics, offering deeper insights about when these algorithms can provide a computational advantage. This thesis establishes a solid foundation for future research and aims to advance the understanding and application of quantum algorithms in solving complex differential equations

•Apr 11, 2025•0 citations
Hamiltonian systems of ordinary and partial differential equations are fundamental mathematical models spanning virtually all physical scales. A critical property for the robustness and stability of computational methods in such systems is the underlying symplectic structure, which preserves geometric properties like phase-space volume over time and energy conservation over an extended period. In this paper, we present quantum algorithms that incorporate symplectic integrators, ensuring the preservation of this key structure. We demonstrate how these algorithms maintain the symplectic properties for both linear and nonlinear Hamiltonian systems. Additionally, we provide a comprehensive theoretical analysis of the computational complexity, showing that our approach offers both accuracy and improved efficiency over classical algorithms. These results highlight the potential application of quantum algorithms for solving large-scale Hamiltonian systems while preserving essential physical properties.
This paper presents a class of structure-preserving numerical methods for quantum optimal control problems, based on commutator-free Cayley integrators. Starting from the Krotov framework, we reformulate the forward and backward propagation steps using Cayley-type schemes that preserve unitarity and symmetry at the discrete level. This approach eliminates the need for matrix exponentials and commutators, leading to significant computational savings while maintaining higher-order accuracy. We first recall the standard linear setting and then extend the formulation to nonlinear Schrödinger and Gross-Pitaevskii equations using a Cayley-polynomial interpolation strategy. Numerical experiments on state-transfer problems illustrate that the CF-Cayley method achieves the same accuracy as high-order exponential or Cayley-Magnus schemes at substantially lower cost, especially for longtime or highly oscillatory dynamics. In the nonlinear regime, the structure-preserving properties of the method ensure stability and norm conservation, making it a robust tool for large-scale quantum control simulations. The proposed framework thus bridges geometric integration and optimal control, offering an efficient and reliable alternative to existing exponential-based propagators.
Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present a near-optimal, robust, and end-to-end quantum algorithm to solve time-dependent, dissipative, nonlinear PDEs. We embed the PDEs in a truncated, high-dimensional linear space on the basis of quantum homotopy analysis. The linearized system is discretized and integrated using finite-difference methods with a compact quantum algorithm. The present approach can adapt its input to the nature of nonlinearity and underlying physics. The complexity estimates improve existing approaches in terms of the time-marching system size, simulation time, accuracy parameters, and post-selection parameters. We provide a general embedding strategy, bounds on stability criteria, accuracy, gate counts, and query complexity. A physically motivated measure of nonlinearity is connected to a parameter similar to the flow Reynolds number ReHRe_{\textrm{H}}ReH​, whose inverse marks the allowed integration window, for given accuracy and complexity. We illustrate the embedding scheme with numerical simulations of Burgers, Fisher--KPP, damped Kuramoto--Sivashinsky, and real Ginzburg--Landau/Allen--Cahn equations. Together, these examples encompass cubic nonlinearity and saturation, quadratic transport, and fourth-order dissipative stiffness. This work shows the potential of hybrid quantum algorithms for simulating nonlinear problems on near-term and fault-tolerant devices.
Quantum computers have the potential to efficiently solve a system of nonlinear ordinary differential equations (ODEs), which play a crucial role in various industries and scientific fields. However, it remains unclear which system of nonlinear ODEs, and under what assumptions, can achieve exponential speedup using quantum computers. In this work, we introduce a class of systems of nonlinear ODEs that can be efficiently solved on quantum computers, where the efficiency is defined as solving the system with computational complexity of O(Tlog(N)polylog(1/ε))O(T {\rm log}(N) {\rm polylog}(1/ε))O(Tlog(N)polylog(1/ε)), where TTT is the evolution time, εεε is the allowed error, and NNN is the number of variables in the system. Specifically, we employ the Koopman-von Neumann linearization to map the system of nonlinear ODEs to Hamiltonian dynamics and find conditions where the norm of the mapped Hamiltonian is preserved and the Hamiltonian is sparse. This allows us to use the optimal Hamiltonian simulation technique for solving the nonlinear ODEs with O(log(N))O({\rm log}(N))O(log(N)) overhead. Furthermore, we show that the nonlinear ODEs include a wide range of systems of nonlinear ODEs, such as the nonlinear harmonic oscillators and the short-range Kuramoto model. This is the first concrete example of solving systems of nonlinear ODEs with exponential quantum speedup by the Koopman-von Neumann linearization, although it is noted that this assumes efficient preparation of the initial state and computation of the output. These findings contribute significantly to the application of quantum computers in solving nonlinear problems.
This work develops a symplectic framework for quantum computing to be applied to classical Hamiltonian systems, exploiting the intrinsic geometric compatibility between unitary quantum evolution and symplectic phase-space dynamics in a two-fold way. The first part is devoted in establishing an exact correspondence between quantum evolution and classical Hamiltonian flow on a Kahler manifold. This correspondence enables a geometric quantization scheme that identifies a family of classical Hamiltonian systems admitting exponentially compressed quantum representations-appropriate for quantum simulation. In the second part we demonstrate that Liouville-integrable Hamiltonian dynamics induce finite-dimensional unitary evolution through action-angle variables and Koopman-von Neumann encoding. This allows efficient quantum representation and parallel evolution of large phase-space ensembles, where entangled encodings provide exponential compression in ensemble size and enable quantum speed-ups in observable estimation via amplitude estimation techniques. For non-integrable systems, Lie canonical perturbation theory is incorporated to construct near-symplectic transformations that map dynamics to approximately integrable forms, preserving unitary evolution up to a controlled error. We derive the resulting quantum computational complexity of the proposed quantum-symplectic scheme, revealing both an exponential compression in memory requirements and a potential polynomial speed-up with respect to the system size. Finally, the transport evolution equation governing the quantum phase-space observables is obtained.
Many scientific and engineering problems are governed by differential equations whose analytical solutions are unavailable, making numerical discretization indispensable. Classical numerical schemes generally fail to preserve the geometric and symmetry properties of the underlying differential equations, which can adversely affect numerical accuracy. In this work, we combine Lie symmetry-preserving numerical discretization with Quantum Linear Systems Algorithms (QLSAs) to develop a quantum framework for solving first-order linear ordinary differential equations. Using the moving-frame invariantization method, we construct a Lie symmetry-preserving variant of the classical Euler method, referred to as the Lie-Euler scheme. Both the classical Euler and Lie-Euler discretizations are formulated as sparse linear systems and solved using the Harrow-Hassidim-Lloyd algorithm. The Lie-Euler discretization preserves the underlying Lie symmetry and improves the global discretization error from O(h) to O(h 2 ), allowing a prescribed accuracy to be achieved using fewer discretization points and hence smaller linear systems with reduced qubit requirements. Furthermore, for an important class of dissipative problems, we prove that the associated Lie-Euler matrices possess uniformly bounded spectral condition numbers, yielding stronger asymptotic complexity guarantees for modern QLSAs. Numerical examples demonstrate the effectiveness of the proposed framework.
In this thesis, we investigate the end-to-end implementation of quantum algorithms for solving differential equations through Hamiltonian simulation, with applications in finance, semi-classical physics, and hardware benchmarking. We particularly focus on the challenge of efficiently loading an initial state into a quantum computer, an area of research that has received limited exploration and whose existing methods have faced scrutiny regarding their robustness and efficiency. This work includes developing advanced techniques for encoding discretized real functions into quantum states and demonstrates how Hamiltonian simulation can be utilized to address the solution of linear partial differential equations through three key examples. These examples illustrate applications ranging from simulating non-Hermitian dynamics in finance to integrating classical Hamiltonian mechanics with quantum mechanics for semi-classical simulations, and introducing time-dependent coefficients for hardware benchmarking. Additionally, it is proposed a novel approach to connect the efficiency of quantum algorithms for nonlinear partial differential equations with physical parameters in fluid dynamics, offering deeper insights about when these algorithms can provide a computational advantage. This thesis establishes a solid foundation for future research and aims to advance the understanding and application of quantum algorithms in solving complex differential equations