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

ACM/IEEE Design Automation Conference (DAC)

Optimized Time-dependent Hamiltonian Evolution Quantum Solver for Power System Transient Computations

Jiyuan Liu, Yongming Tang, Baoping Wang, Mengdi Sun, He Li

Published Jul 26, 2026• 0 citations
Publisher

Abstract

Quantum computing has been demonstrated as a promising solution for computation-intensive power system electromagnetic transient (EMT) computation. However, existing work have focused on time-independent Hamiltonian evolution to solve ordinary differential equations (ODEs) with heavily classical interactions. This work proposes OHQS, an optimized time-dependent Hamiltonian evolution quantum solver, to enable high-accuracy computation for ODE-dominated EMT problems without classical iterations. The spatiotemporay mapping transformation is discretized to construct iterative quantum circuit evolution, leveraging the spatiotemporal fixed points (SFPs)-enabled automatic optimizer to reduce discretized errors. Experimental results have demonstrated that OHQS can support time-dependent Hamiltonian evolution in practical applications with up to 99.91% accuracy and achieve up to 9.56× error reduction compared to classical methods. The observed exponential decay of the relative error implies that consumed qubits scale as O(log(1/ξ)) and the ξ is the target relative error tolerance.

DOI
10.1145/3770743.3804249

Related papers

Full-quantum variational dynamics simulation for time-dependent Hamiltonians with global spectral discretization

Minchen Qiao, Zi-Ming Li, Yu-xi Liu

The most widely used approach for simulating the dynamics of time-dependent Hamiltonians via quantum computation depends on the quantum-classical hybrid variational quantum time evolution algorithm, in which ordinary differential equations of the variational coefficients for determining time evolution are solved via classical simulations with a time discretization method. We here present a full-quantum approach, in which ordinary differential equations of the variational coefficients are transformed into static linear equations via the Chebyshev spectral discretization method and then solved via the quantum singular value transformation algorithm. Our full quantum algorithm avoids classical feedback, achieves exponential convergence for smooth Hamiltonians, and yields a quantum circuit depth that is independent of the number of time steps. We demonstrate two implementation strategies, with a global formulation designed for fault-tolerant architectures and a sequential formulation tailored to near-term devices, and validate the approach through numerical simulations of proton-hydrogen charge-transfer dynamics, a prototypical time-dependent quantum chemistry problem. This work establishes a systematic pathway from quantum-classical hybrid variational quantum algorithms to full-quantum solvers for general time-dependent Hamiltonians, particularly those whose dynamics admit compact variational descriptions, opening a route toward full quantum computational advantages in time-dependent simulations.

quant-pharXiv:2603.17062•Mar 19, 2026•0 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

Circuit Depth Reduction of One-Ancilla Quantum Differential Equation Solver via Extrapolation

Di Fang, Justin Park

Solving linear differential equations is a fundamental task in scientific computing and an important primitive for quantum computing. A recent one-ancilla quantum differential equation solver provides a hardware-friendly and locality-preserving approach with provable performance guarantees, making it highly suitable for the early fault-tolerant and near-term regimes. Its simple circuit structure comes with a natural trade-off: the maximum single-run circuit depth scales as $O (1/ε)$ in the target accuracy $ε$. In this work, we reduce this depth by combining the solver with classical step-size postprocessing. By running the one-ancilla solver at a logarithmic number of finite time step sizes and using classical post-processing to cancel leading discretization errors, we reduce the maximum single-run circuit depth to $O(\mathrm{polylog}(1/ε))$ without adding quantum ancillae or sacrificing locality. Technically, extending extrapolation ideas beyond Hamiltonian and Lindbladian dynamics requires regularity estimates for observable maps under nonunitary evolution, which we obtain through a holomorphic extension of the adjoint evolution. Numerical experiments on the Hatano-Nelson model (ODE) and the convection-diffusion equation (PDE) demonstrate the effectiveness of the approach.

quant-pharXiv:2607.07389•Jul 9, 2026•1 citation

Variational quantum nonlinear solver for nonlinear dynamics: Implementation and investigation

Teng-Yang Ma, Chuang-Chao Ye, Menghan Dou +1 more

The variational quantum nonlinear solver (VQNLS), a quantum-enhanced computational method for nonlinear dynamical systems, converts solution tasks into global spatiotemporal optimization via parameterized ansatz circuits, thereby eliminating the need for iterative quantum state tomography. Herein, we present an extended implementation scheme of the VQNLS, which is compatible with most numerical discretization schemes and boundary conditions. The method is validated using a nonlinear ordinary differential equation (ODE) and the Burgers' equation using quantum virtual machines and superconducting quantum computers. Experimental results show that (1) the VQNLS can effectively solve nonlinear equations. On an ideal simulator, the ODE's solution achieves a relative error of only 0.17% when the loss function converges to 1×10−6. For the Burgers' equation, VQNLS captures key solution features with an average relative error below 5% on quantum virtual machines, while the average relative error increases to 7.91% on superconducting quantum computers. (2) VQNLS is highly sensitive to the loss function. (3) An appropriate additional loss function mitigates this issue by improving training efficiency and suppressing errors. At a fixed loss threshold of 1×10−3, it reduces training steps from 100 to 56 and cuts the maximum relative error from 15.3% to 4.1%. (4) Furthermore, under the same loss threshold, VQNLS's accuracy improves with the computational scale, with the average relative error decreasing monotonically in a power-law manner. Despite inherent limitations, including high error sensitivity and the challenge of selecting high-performance ansatz circuits, we consider that VQNLS provides a promising framework for engineering-oriented approximate simulations of nonlinear systems.

Physics of Fluids•Apr 1, 2026•0 citations

Time-Dependent Hamiltonian Simulation Using Discrete-Clock Constructions

Jacob Watkins, Nathan Wiebe, Alessandro Roggero +1 more

Compared with time-independent Hamiltonians, the dynamics of generic quantum Hamiltonians H ( t ) are complicated by the presence of time ordering in the evolution operator. In the context of digital quantum simulation, this difficulty prevents a direct adaptation of many time-independent simulation algorithms for time-dependent simulation. However, there exists a framework within the theory of dynamical systems that eliminates time ordering by adding a “clock” degree of freedom. In this work, we provide a computational framework, based on this reduction, for encoding time-dependent dynamics as time-independent systems. As a result, we make two advances in digital Hamiltonian simulation. First, we create a time-dependent simulation algorithm based on performing qubitization on the augmented clock system and, in doing so, provide the first qubitization-based approach to time-dependent Hamiltonians that goes beyond Trotterization of the ordered exponential. Second, we define a natural generalization of multiproduct formulas for time-ordered exponentials and then propose and analyze an algorithm based on these formulas. Unlike other algorithms of similar accuracy, the multiproduct approach achieves commutator scaling, meaning that this method outperforms existing methods for physically local time-dependent Hamiltonians with sufficient smoothness. Our work reduces the disparity between time-dependent and time-independent simulation and indicates a step toward optimal quantum simulation of time-dependent Hamiltonians. Published by the American Physical Society 2024

arXiv:2203.11353•PRX Quantum•Oct 31, 2024•48 citations

Initialization-Wise Quantum Electromagnetic Transient Program

Qi Lou, Yijun Xu, Wei Gu +1 more

With the increasing penetration of renewable energy sources and power electronic devices, the Electromagnetic Transients Program (EMTP) has become indispensable for modern power system analysis. Classical EMTP faces a conflict between computational efficiency and real-time requirements, while the rapid advancement of quantum computing offers a pathway for a quantum leap. However, existing QEMTP methods suffer from slow convergence, requiring numerous iterations that consume substantial quantum resources and drastically reduce computational efficiency. This paper proposes an initialization-wise QEMTP framework that leverages physics-informed initialization to accelerate convergence. A detailed analysis of the cost function incorporating the Gram–Schmidt procedure guides the selection of initial parameters, while a cross-initialization method—applied in QEMTP for the first time—mitigates switching-induced errors. Simulation results demonstrate the framework’s efficiency, accuracy, and robustness.

IEEE Power Engineering Society General Meeting•Jul 1, 2026•0 citations
Quantum computing has been demonstrated as a promising solution for computation-intensive power system electromagnetic transient (EMT) computation. However, existing work have focused on time-independent Hamiltonian evolution to solve ordinary differential equations (ODEs) with heavily classical interactions. This work proposes OHQS, an optimized time-dependent Hamiltonian evolution quantum solver, to enable high-accuracy computation for ODE-dominated EMT problems without classical iterations. The spatiotemporay mapping transformation is discretized to construct iterative quantum circuit evolution, leveraging the spatiotemporal fixed points (SFPs)-enabled automatic optimizer to reduce discretized errors. Experimental results have demonstrated that OHQS can support time-dependent Hamiltonian evolution in practical applications with up to 99.91% accuracy and achieve up to 9.56× error reduction compared to classical methods. The observed exponential decay of the relative error implies that consumed qubits scale as O(log(1/ξ)) and the ξ is the target relative error tolerance.
The most widely used approach for simulating the dynamics of time-dependent Hamiltonians via quantum computation depends on the quantum-classical hybrid variational quantum time evolution algorithm, in which ordinary differential equations of the variational coefficients for determining time evolution are solved via classical simulations with a time discretization method. We here present a full-quantum approach, in which ordinary differential equations of the variational coefficients are transformed into static linear equations via the Chebyshev spectral discretization method and then solved via the quantum singular value transformation algorithm. Our full quantum algorithm avoids classical feedback, achieves exponential convergence for smooth Hamiltonians, and yields a quantum circuit depth that is independent of the number of time steps. We demonstrate two implementation strategies, with a global formulation designed for fault-tolerant architectures and a sequential formulation tailored to near-term devices, and validate the approach through numerical simulations of proton-hydrogen charge-transfer dynamics, a prototypical time-dependent quantum chemistry problem. This work establishes a systematic pathway from quantum-classical hybrid variational quantum algorithms to full-quantum solvers for general time-dependent Hamiltonians, particularly those whose dynamics admit compact variational descriptions, opening a route toward full quantum computational advantages in time-dependent simulations.
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.
Solving linear differential equations is a fundamental task in scientific computing and an important primitive for quantum computing. A recent one-ancilla quantum differential equation solver provides a hardware-friendly and locality-preserving approach with provable performance guarantees, making it highly suitable for the early fault-tolerant and near-term regimes. Its simple circuit structure comes with a natural trade-off: the maximum single-run circuit depth scales as O(1/ε)O (1/ε)O(1/ε) in the target accuracy εεε. In this work, we reduce this depth by combining the solver with classical step-size postprocessing. By running the one-ancilla solver at a logarithmic number of finite time step sizes and using classical post-processing to cancel leading discretization errors, we reduce the maximum single-run circuit depth to O(polylog(1/ε))O(\mathrm{polylog}(1/ε))O(polylog(1/ε)) without adding quantum ancillae or sacrificing locality. Technically, extending extrapolation ideas beyond Hamiltonian and Lindbladian dynamics requires regularity estimates for observable maps under nonunitary evolution, which we obtain through a holomorphic extension of the adjoint evolution. Numerical experiments on the Hatano-Nelson model (ODE) and the convection-diffusion equation (PDE) demonstrate the effectiveness of the approach.
The variational quantum nonlinear solver (VQNLS), a quantum-enhanced computational method for nonlinear dynamical systems, converts solution tasks into global spatiotemporal optimization via parameterized ansatz circuits, thereby eliminating the need for iterative quantum state tomography. Herein, we present an extended implementation scheme of the VQNLS, which is compatible with most numerical discretization schemes and boundary conditions. The method is validated using a nonlinear ordinary differential equation (ODE) and the Burgers' equation using quantum virtual machines and superconducting quantum computers. Experimental results show that (1) the VQNLS can effectively solve nonlinear equations. On an ideal simulator, the ODE's solution achieves a relative error of only 0.17% when the loss function converges to 1×10−6. For the Burgers' equation, VQNLS captures key solution features with an average relative error below 5% on quantum virtual machines, while the average relative error increases to 7.91% on superconducting quantum computers. (2) VQNLS is highly sensitive to the loss function. (3) An appropriate additional loss function mitigates this issue by improving training efficiency and suppressing errors. At a fixed loss threshold of 1×10−3, it reduces training steps from 100 to 56 and cuts the maximum relative error from 15.3% to 4.1%. (4) Furthermore, under the same loss threshold, VQNLS's accuracy improves with the computational scale, with the average relative error decreasing monotonically in a power-law manner. Despite inherent limitations, including high error sensitivity and the challenge of selecting high-performance ansatz circuits, we consider that VQNLS provides a promising framework for engineering-oriented approximate simulations of nonlinear systems.
Compared with time-independent Hamiltonians, the dynamics of generic quantum Hamiltonians H ( t ) are complicated by the presence of time ordering in the evolution operator. In the context of digital quantum simulation, this difficulty prevents a direct adaptation of many time-independent simulation algorithms for time-dependent simulation. However, there exists a framework within the theory of dynamical systems that eliminates time ordering by adding a “clock” degree of freedom. In this work, we provide a computational framework, based on this reduction, for encoding time-dependent dynamics as time-independent systems. As a result, we make two advances in digital Hamiltonian simulation. First, we create a time-dependent simulation algorithm based on performing qubitization on the augmented clock system and, in doing so, provide the first qubitization-based approach to time-dependent Hamiltonians that goes beyond Trotterization of the ordered exponential. Second, we define a natural generalization of multiproduct formulas for time-ordered exponentials and then propose and analyze an algorithm based on these formulas. Unlike other algorithms of similar accuracy, the multiproduct approach achieves commutator scaling, meaning that this method outperforms existing methods for physically local time-dependent Hamiltonians with sufficient smoothness. Our work reduces the disparity between time-dependent and time-independent simulation and indicates a step toward optimal quantum simulation of time-dependent Hamiltonians. Published by the American Physical Society 2024
With the increasing penetration of renewable energy sources and power electronic devices, the Electromagnetic Transients Program (EMTP) has become indispensable for modern power system analysis. Classical EMTP faces a conflict between computational efficiency and real-time requirements, while the rapid advancement of quantum computing offers a pathway for a quantum leap. However, existing QEMTP methods suffer from slow convergence, requiring numerous iterations that consume substantial quantum resources and drastically reduce computational efficiency. This paper proposes an initialization-wise QEMTP framework that leverages physics-informed initialization to accelerate convergence. A detailed analysis of the cost function incorporating the Gram–Schmidt procedure guides the selection of initial parameters, while a cross-initialization method—applied in QEMTP for the first time—mitigates switching-induced errors. Simulation results demonstrate the framework’s efficiency, accuracy, and robustness.