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:2605.29423

Quantum Implicit-Explicit Schemes for Multiscale Ordinary and Partial Differential Equations via Schrödingerization

Qitong Hu, Xiaoyang He, Shi Jin, Xiao-Dong Zhang

math.NAmath-phquant-phSubmitted May 28, 2026• Announced May 29, 2026• 1 citation
arXivHTMLPDF

Abstract

In this paper, we present a quantum implicit-explicit (IMEX) scheme for multiscale ordinary and partial differential equations whose discretization parameters are independent of the scaling parameter $\varepsilon$. A key ingredient of our approach is a continuous-time formulation of classical IMEX schemes, which decouples the evolution time of the quantum algorithm from the physical time of the differential equation and is therefore particularly useful in multiscale settings. Building on this idea, we employ the Schrödingerization framework [Phys. Rev. Lett. 133 (2024), 230602] to implement IMEX schemes on quantum computers. Compared to previous HHL type quantum AP scheme [J. Comput. Phys. 471 (2022), 111641], this new method requires narrower -- an extra logarithmic factor -- auxiliary register numerical examples on linear heat and multiscale telegraph equations demonstrate the independence in $\varepsilon$ of the method.

Comments
41 pages, 3 figures, 2 tables. Qitong Hu and Xiaoyang He contributes equally

Related papers

Schrödingerization Based Computationally Stable Algorithms for Ill-Posed Problems in Partial Differential Equations

Shi Jin, Nana Liu, Chuwen Ma

Abstract. We introduce a simple and stable computational method for ill-posed partial differential equation (PDE) problems. The method is based on Schrödingerization, introduced in [S. Jin, N. Liu, and Y. Yu, Phys. Rev. Lett., 133 (2024), 230602; S. Jin, N. Liu, and Y. Yu, Phys. Rev. A, 108 (2023), 032603], which maps all linear PDEs into Schrödinger-type equations in one higher dimension, for quantum simulations of these PDEs. Although the original problem is ill-posed, the Schrödingerized equations are Hamiltonian systems and time-reversible, allowing stable computation both forward and backward in time. The original variable can be recovered by data from suitably chosen domain in the extended dimension. We will use the (constant and variable coefficient) backward heat equation and the linear convection equation with imaginary wave speed as examples. Error analysis of these algorithms are conducted and verified numerically. The methods are applicable to both classical and quantum computers, and we also lay out quantum algorithms for these methods. Moreover, we introduce a smooth initialization for the Schrödingerized equation, which will lead to essentially spectral accuracy for the approximation in the extended space, if a spectral method is used. Consequently, the extra qubits needed due to the extra dimension, if a qubit-based quantum algorithm is used, for both well-posed and ill-posed problems, becomes almost [Formula: see text] where [Formula: see text] is the desired precision. This optimizes the complexity of the Schrödingerization based quantum algorithms for any nonunitary dynamical system introduced in [S. Jin, N. Liu, and Y. Yu, Phys. Rev. Lett., 133 (2024), 230602; S. Jin, N. Liu, and Y. Yu, Phys. Rev. A, 108 (2023), 032603].

arXiv:2403.19123•SIAM Journal on Scientific Computing•Aug 25, 2025•28 citations

Quantum Algorithms for Multiscale Partial Differential Equations

Junpeng Hu, Shi Jin, Lei Zhang

Abstract. Partial differential equation (PDE) models with multiple temporal/spatial scales are prevalent in several disciplines such as physics, engineering, and many others. These models are of great practical importance but notoriously difficult to solve due to prohibitively small mesh and time step sizes limited by the scaling parameter and CFL condition. Another challenge in scientific computing could come from curse-of-dimensionality. In this paper, we aim to provide a quantum algorithm, based on either direct approximations of the original PDEs or their homogenized models, for prototypical multiscale problems inPDEs, including elliptic, parabolic, and hyperbolic PDEs. To achieve this, we will lift these problems to higher dimensions and leverage the recently developed Schrödingerization based quantum simulation algorithms to efficiently reduce the computational cost of the resulting high-dimensional and multiscale problems. We will examine the error contributions arising from discretization, homogenization, and relaxation, and analyze and compare the complexities of these algorithms in order to identify the best algorithms in terms of complexities for different equations in different regimes.

arXiv:2304.06902•Multiscale Modeling and Simulation•Jul 30, 2024•19 citations

Quantum Simulation of Multiscale Linear Transport Equations via Schrödingerization and Exponential Integrators

Xiaoyang He, Shi Jin

In this paper, we present two Hamiltonian simulation algorithms for multiscale linear transport equations, combining the Schrödingerization method [S. Jin, N. Liu and Y. Yu, Phys. Rev. Lett, 133(2024), 230602] [S. Jin, N. Liu and Y. Yu, Phys. Rev. A, 108 (2023), 032603] and exponential integrator while incorporating incoming boundary conditions. These two algorithms each have advantages in terms of design easiness and scalability, and the query complexity of both algorithms, outperforms classical algorithms for solving this equation. In terms of the theoretical framework, these are the first quantum Hamiltonian simulation algorithms for multiscale linear transport equation to combine the Schrödingerization method with effective asymptotic-preserving schemes, which are efficient for handling multiscale problems with stiff terms.

arXiv:2507.18970•Communications in Computational Physics•Sep 23, 2026•1 citation

Quantum Simulation of Partial Differential Equations via Schrödingerization

Shi Jin, Nana Liu, Yue Yu

We present a novel new way-called Schrödingerization-to simulate general (quantum and nonquantum) systems of linear ordinary and partial differential equations (PDEs) via quantum simulation. We introduce a new transform, referred to as the warped phase transformation, where any linear-including nonautonamous-system of ordinary or partial differential equation can be recast into a system of Schrödinger's equations, in real time, in a straightforward way. This approach is not only applicable to PDEs for classical problems but is also useful for quantum problems, including the preparation of quantum ground states and Gibbs thermal states, the simulation of quantum states in random media in the semiclassical limit, simulation of Schrödinger's equation in a bounded domain with artificial boundary conditions, and other non-Hermitian physics. This formulation is versatile enough to be applicable in a simple way to both digital quantum simulation as well as to analog quantum simulation, and using either qubits or continuous-variable quantum systems (qumodes).

arXiv:2212.13969•Physical Review Letters•Dec 4, 2024•141 citations

On Schrödingerization-Based Quantum Algorithms for Linear Dynamical Systems with Inhomogeneous Terms

Shi Jin, Nana Liu, Chuwen Ma

Abstract. We analyze the Schrödingerization method for quantum simulation of a general class of nonunitary dynamics with inhomogeneous source terms. The Schrödingerization technique, introduced in [S. Jin, N. Liu, and Y. Yu, Phys. Rev. Lett., 133 (2024), 230602], transforms any linear ordinary and partial differential equations with nonunitary dynamics into a system under unitary dynamics via a warped phase transition that maps the equations into a higher dimension, making them suitable for quantum simulation. This technique can also be applied to these equations with inhomogeneous terms modeling source or forcing terms, or boundary and interface conditions, and discrete dynamical systems such as iterative methods in numerical linear algebra, through extra equations in the system. Difficulty arises with the presence of inhomogeneous terms since they can change the stability of the original system. In this paper, we systematically study—both theoretically and numerically—the important issue of recovering the original variables from the Schrödingerized equations, even when the evolution operator contains unstable modes. We show that even with unstable modes, one can still construct a stable scheme; however, to recover the original variable, one needs to use suitable data in the extended space. We analyze and compare both the discrete and continuous Fourier transforms used in the extended dimension and derive corresponding error estimates, which allow one to use the more appropriate transform for specific equations. We also provide a smoother initialization for the Schrödingerized system to gain higher-order accuracy in the extended space. We homogenize the inhomogeneous terms with a stretch transformation, making it easier to recover the original variable. Our recovery technique also provides a simple and generic framework to solve general ill-posed problems in a computationally stable way.

arXiv:2402.14696•SIAM Journal on Numerical Analysis•Aug 20, 2025•39 citations

Quantum Circuits for partial differential equations via Schrödingerisation

Junpeng Hu, Shi Jin, Nana Liu +1 more

Quantum computing has emerged as a promising avenue for achieving significant speedup, particularly in large-scale PDE simulations, compared to classical computing. One of the main quantum approaches involves utilizing Hamiltonian simulation, which is directly applicable only to Schrödinger-type equations. To address this limitation, Schrödingerisation techniques have been developed, employing the warped transformation to convert general linear PDEs into Schrödinger-type equations. However, despite the development of Schrödingerisation techniques, the explicit implementation of the corresponding quantum circuit for solving general PDEs remains to be designed. In this paper, we present detailed implementation of a quantum algorithm for general PDEs using Schrödingerisation techniques. We provide examples of the heat equation, and the advection equation approximated by the upwind scheme, to demonstrate the effectiveness of our approach. Complexity analysis is also carried out to demonstrate the quantum advantages of these algorithms in high dimensions over their classical counterparts.

arXiv:2403.10032•Quantum•Dec 12, 2024•48 citations
In this paper, we present a quantum implicit-explicit (IMEX) scheme for multiscale ordinary and partial differential equations whose discretization parameters are independent of the scaling parameter ε\varepsilonε. A key ingredient of our approach is a continuous-time formulation of classical IMEX schemes, which decouples the evolution time of the quantum algorithm from the physical time of the differential equation and is therefore particularly useful in multiscale settings. Building on this idea, we employ the Schrödingerization framework [Phys. Rev. Lett. 133 (2024), 230602] to implement IMEX schemes on quantum computers. Compared to previous HHL type quantum AP scheme [J. Comput. Phys. 471 (2022), 111641], this new method requires narrower -- an extra logarithmic factor -- auxiliary register numerical examples on linear heat and multiscale telegraph equations demonstrate the independence in ε\varepsilonε of the method.
Abstract. We introduce a simple and stable computational method for ill-posed partial differential equation (PDE) problems. The method is based on Schrödingerization, introduced in [S. Jin, N. Liu, and Y. Yu, Phys. Rev. Lett., 133 (2024), 230602; S. Jin, N. Liu, and Y. Yu, Phys. Rev. A, 108 (2023), 032603], which maps all linear PDEs into Schrödinger-type equations in one higher dimension, for quantum simulations of these PDEs. Although the original problem is ill-posed, the Schrödingerized equations are Hamiltonian systems and time-reversible, allowing stable computation both forward and backward in time. The original variable can be recovered by data from suitably chosen domain in the extended dimension. We will use the (constant and variable coefficient) backward heat equation and the linear convection equation with imaginary wave speed as examples. Error analysis of these algorithms are conducted and verified numerically. The methods are applicable to both classical and quantum computers, and we also lay out quantum algorithms for these methods. Moreover, we introduce a smooth initialization for the Schrödingerized equation, which will lead to essentially spectral accuracy for the approximation in the extended space, if a spectral method is used. Consequently, the extra qubits needed due to the extra dimension, if a qubit-based quantum algorithm is used, for both well-posed and ill-posed problems, becomes almost [Formula: see text] where [Formula: see text] is the desired precision. This optimizes the complexity of the Schrödingerization based quantum algorithms for any nonunitary dynamical system introduced in [S. Jin, N. Liu, and Y. Yu, Phys. Rev. Lett., 133 (2024), 230602; S. Jin, N. Liu, and Y. Yu, Phys. Rev. A, 108 (2023), 032603].
Abstract. Partial differential equation (PDE) models with multiple temporal/spatial scales are prevalent in several disciplines such as physics, engineering, and many others. These models are of great practical importance but notoriously difficult to solve due to prohibitively small mesh and time step sizes limited by the scaling parameter and CFL condition. Another challenge in scientific computing could come from curse-of-dimensionality. In this paper, we aim to provide a quantum algorithm, based on either direct approximations of the original PDEs or their homogenized models, for prototypical multiscale problems inPDEs, including elliptic, parabolic, and hyperbolic PDEs. To achieve this, we will lift these problems to higher dimensions and leverage the recently developed Schrödingerization based quantum simulation algorithms to efficiently reduce the computational cost of the resulting high-dimensional and multiscale problems. We will examine the error contributions arising from discretization, homogenization, and relaxation, and analyze and compare the complexities of these algorithms in order to identify the best algorithms in terms of complexities for different equations in different regimes.
In this paper, we present two Hamiltonian simulation algorithms for multiscale linear transport equations, combining the Schrödingerization method [S. Jin, N. Liu and Y. Yu, Phys. Rev. Lett, 133(2024), 230602] [S. Jin, N. Liu and Y. Yu, Phys. Rev. A, 108 (2023), 032603] and exponential integrator while incorporating incoming boundary conditions. These two algorithms each have advantages in terms of design easiness and scalability, and the query complexity of both algorithms, outperforms classical algorithms for solving this equation. In terms of the theoretical framework, these are the first quantum Hamiltonian simulation algorithms for multiscale linear transport equation to combine the Schrödingerization method with effective asymptotic-preserving schemes, which are efficient for handling multiscale problems with stiff terms.
We present a novel new way-called Schrödingerization-to simulate general (quantum and nonquantum) systems of linear ordinary and partial differential equations (PDEs) via quantum simulation. We introduce a new transform, referred to as the warped phase transformation, where any linear-including nonautonamous-system of ordinary or partial differential equation can be recast into a system of Schrödinger's equations, in real time, in a straightforward way. This approach is not only applicable to PDEs for classical problems but is also useful for quantum problems, including the preparation of quantum ground states and Gibbs thermal states, the simulation of quantum states in random media in the semiclassical limit, simulation of Schrödinger's equation in a bounded domain with artificial boundary conditions, and other non-Hermitian physics. This formulation is versatile enough to be applicable in a simple way to both digital quantum simulation as well as to analog quantum simulation, and using either qubits or continuous-variable quantum systems (qumodes).
Abstract. We analyze the Schrödingerization method for quantum simulation of a general class of nonunitary dynamics with inhomogeneous source terms. The Schrödingerization technique, introduced in [S. Jin, N. Liu, and Y. Yu, Phys. Rev. Lett., 133 (2024), 230602], transforms any linear ordinary and partial differential equations with nonunitary dynamics into a system under unitary dynamics via a warped phase transition that maps the equations into a higher dimension, making them suitable for quantum simulation. This technique can also be applied to these equations with inhomogeneous terms modeling source or forcing terms, or boundary and interface conditions, and discrete dynamical systems such as iterative methods in numerical linear algebra, through extra equations in the system. Difficulty arises with the presence of inhomogeneous terms since they can change the stability of the original system. In this paper, we systematically study—both theoretically and numerically—the important issue of recovering the original variables from the Schrödingerized equations, even when the evolution operator contains unstable modes. We show that even with unstable modes, one can still construct a stable scheme; however, to recover the original variable, one needs to use suitable data in the extended space. We analyze and compare both the discrete and continuous Fourier transforms used in the extended dimension and derive corresponding error estimates, which allow one to use the more appropriate transform for specific equations. We also provide a smoother initialization for the Schrödingerized system to gain higher-order accuracy in the extended space. We homogenize the inhomogeneous terms with a stretch transformation, making it easier to recover the original variable. Our recovery technique also provides a simple and generic framework to solve general ill-posed problems in a computationally stable way.
Quantum computing has emerged as a promising avenue for achieving significant speedup, particularly in large-scale PDE simulations, compared to classical computing. One of the main quantum approaches involves utilizing Hamiltonian simulation, which is directly applicable only to Schrödinger-type equations. To address this limitation, Schrödingerisation techniques have been developed, employing the warped transformation to convert general linear PDEs into Schrödinger-type equations. However, despite the development of Schrödingerisation techniques, the explicit implementation of the corresponding quantum circuit for solving general PDEs remains to be designed. In this paper, we present detailed implementation of a quantum algorithm for general PDEs using Schrödingerisation techniques. We provide examples of the heat equation, and the advection equation approximated by the upwind scheme, to demonstrate the effectiveness of our approach. Complexity analysis is also carried out to demonstrate the quantum advantages of these algorithms in high dimensions over their classical counterparts.