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

Effective-Hamiltonian Quantum Solvers for Differential Equations: Alternative Constructions and Function Encodings

Annie E. Paine

quant-phSubmitted Sep 22, 2026• Announced Sep 23, 2026• 0 citations
arXivHTMLPDF

Abstract

Differential equations can be encoded as ground-state problems by constructing a positive-semidefinite effective Hamiltonian whose minimum-energy state represents the solution. We extend this framework in several directions. First, we show how multiple nonzero initial, boundary, and data conditions can be incorporated into the homogeneous formulation $A | f\rangle=0$ using a known nonzero reference condition. We then analyse an alternative formulation based on $A |f\rangle = | b\rangle$, with Hamiltonian $H_b=A^\dagger(I-|b\rangle\langle b|)A$, which incorporates source terms and nonzero constraints through an augmented system. For nonlinear differential equations, we examine the unphysical ground-state degeneracy introduced by tensor-product representations and consider both Hamiltonian constraints and ansatz-level restrictions for targeting physically valid product states. Finally, we develop grid-value amplitude-encoded versions of both Hamiltonian constructions and compare them with spectral coefficient encoding. Through linear and nonlinear examples, we assess how the choice of Hamiltonian formulation and function representation affects solution recovery, spectral gap, degeneracy, and readout. These results broaden the applicability of ground-state-based quantum differential-equation solvers while clarifying their principal practical trade-offs.

AI Summary

The paper studies how ground-state encodings of differential equations can accommodate nonzero constraints, alternative function representations, and polynomial nonlinearities. It extends the homogeneous residual formulation $A|f\rangle=0$ by expressing multiple initial, boundary, or data conditions relative to a known nonzero reference condition. It also adapts the linear-system Hamiltonian $H_b=A^\dagger(I-|b\rangle\langle b|)A$, augmenting the system with constraints to incorporate source terms and nonzero data. This construction requires a nonzero right-hand side and sufficient constraints to exclude unwanted null-space solutions. Both constructions are developed for spectral-coefficient and grid-value amplitude encodings and tested using noiseless statevector VQE simulations. Linear examples cover RC charging, the Airy equation, and composite-wall conduction using 3–4 qubits. For RC charging with eight coefficients or grid values, maximum errors are approximately $2\times10^{-6}$ for Chebyshev encoding versus $5\times10^{-3}$ for the grid discretisation. The wall example illustrates the need for distinct one-sided derivatives at material interfaces; domain decomposition resolves the incompatibility of a single smooth spectral representation. For a quadratic Fisher–KPP equation, tensor-product lifting produces ground-space degeneracies of 34–240. A shared-parameter repeated-product ansatz excludes unphysical states from the variational search; numerical continuation is additionally used to reach the desired solution branch. The paper explains why a Hamiltonian cannot select exactly all repeated-product states as its ground space. The simulations establish neither efficient ground-state preparation nor quantum advantage. Stated limitations include conditioning, spectral gaps, operator implementation, readout costs, variational convergence and noise, and increasing register requirements for higher-degree nonlinearities.

Little sign of AI-generated textIncrementalSmall numerics only

Error found: The RC example incorrectly excludes the general A0 framework when beta=0, because u'(0)=1 supplies the nonzero derivative reference explicitly allowed by that framework. The composite-wall Ab construction leaves B0 undefined and misdefines B1; the intended hot-boundary row is B0=(X_{s_0^-},0), while B1 should retain its previously defined cold-boundary row.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Quantum algorithm for solving nonlinear differential equations based on physics-informed effective Hamiltonians

Hsin‐Yu Wu, Annie E. Paine, Evan Philip +2 more

We propose a distinct approach to solving linear and nonlinear differential equations (DEs) on quantum computers by encoding the problem into ground states of effective Hamiltonian operators. Our algorithm relies on constructing such operators in the Chebyshev space, where an effective Hamiltonian is a sum of global differential and data constraints. Once the effective Hamiltonian is formed, solutions of differential equations can be obtained using the ground state preparation techniques (e.g. imaginary-time evolution and quantum singular value transformation), bypassing variational search. Unlike approaches based on discrete grids, the algorithm enables evaluation of solutions beyond fixed grid points and implements constraints in the physics-informed way. Our proposal inherits the best traits from quantum machine learning-based DE solving (compact basis representation, automatic differentiation, nonlinearity) and quantum linear algebra-based approaches (fine-grid encoding, provable speed-up for state preparation), offering a robust strategy for quantum scientific computing in the early fault-tolerant era.

arXiv:2504.13174•Apr 17, 2025•8 citations

Efficient quantum ultraspherical transform and a well-conditioned quantum spectral method

Trong Duong, Norbert Hosters

Solving differential equations is a promising application of quantum computing. Spectral methods, where the solution is represented by coefficients in a basis, are particularly well suited to quantum solvers because their structured discretizations can enable efficient linear-algebra operations while providing rapid convergence. Their quantum implementation, however, requires an efficient transform between amplitudes encoding function values and amplitudes encoding expansion coefficients. This work develops two key components of a quantum spectral method. First, we construct the quantum ultraspherical transform (QUT) for orthonormal ultraspherical polynomials, a basis that supports sparse and well-conditioned discretizations of differential equations. For the basis parameters $m=0$ and $1$, this transform reduces to the discrete cosine and sine transforms with known efficient circuits. Our contribution covers every fixed integer $m\geq2$: for dimensions $N$ with $N+m=2^n$, where $n$ is the number of qubits, the QUT achieves error at most $\varepsilon$ using a gate count polynomial in $n$ and $\log(1/\varepsilon)$. The construction builds on the quantum Fourier transform, augmented by approximations whose accuracy guarantees are independent of $N$. Second, we develop a quantum spectral solver for regular linear ordinary differential equations based on the QUT. Under suitable boundary conditions and data-access assumptions, preconditioning keeps condition numbers bounded independently of the basis size, allowing the solution state to be prepared at polylogarithmic cost in system size and inverse error. Together, these contributions provide a framework for quantum spectral methods with the potential to solve linear differential equations efficiently.

arXiv:2611.06651•Nov 4, 2026•0 citations

Physics-Informed Quantum Machine Learning: Solving nonlinear differential equations in latent spaces without costly grid evaluations

Annie E. Paine, Vincent E. Elfving, Oleksandr Kyriienko

We propose a physics-informed quantum algorithm to solve nonlinear and multidimensional differential equations (DEs) in a quantum latent space. We suggest a strategy for building quantum models as state overlaps, where exponentially large sets of independent basis functions are used for implicitly representing solutions. By measuring the overlaps between states which are representations of DE terms, we construct a loss that does not require independent sequential function evaluations on grid points. In this sense, the solver evaluates the loss in an intrinsically parallel way, utilizing a global type of the model. When the loss is trained variationally, our approach can be related to the differentiable quantum circuit protocol, which does not scale with the training grid size. Specifically, using the proposed model definition and feature map encoding, we represent function- and derivative-based terms of a differential equation as corresponding quantum states. Importantly, we propose an efficient way for encoding nonlinearity, for some bases requiring only an additive linear increase of the system size $\mathcal{O}(N + p)$ in the degree of nonlinearity $p$. By utilizing basis mapping, we show how the proposed model can be evaluated explicitly. This allows to implement arbitrary functions of independent variables, treat problems with various initial and boundary conditions, and include data and regularization terms in the physics-informed machine learning setting. On the technical side, we present toolboxes for exponential Chebyshev and Fourier basis sets, developing tools for automatic differentiation and multiplication, implementing nonlinearity, and describing multivariate extensions. The approach is compatible with, and tested on, a range of problems including linear, nonlinear and multidimensional differential equations.

arXiv:2308.01827•Aug 3, 2023•27 citations

QUANTUM ALGORITHMS FOR DIFFERENTIAL EQUATIONS

Aaron Ostrander

This thesis describes quantum algorithms for Hamiltonian simulation, ordinary differential equations (ODEs), and partial differential equations (PDEs). Product formulas are used to simulate Hamiltonians which can be expressed as a sum of terms which can each be simulated individually. By simulating each of these terms in sequence, the net effect approximately simulates the total Hamiltonian. We find that the error of product formulas can be improved by randomizing over the order in which the Hamiltonian terms are simulated. We prove that this approach is asymptotically better than ordinary product formulas and present numerical comparisons for small numbers of qubits. The ODE algorithm applies to the initial value problem for time-independent first order linear ODEs. We approximate the propagator of the ODE by a truncated Taylor series, and we encode the initial value problem in a large linear system. We solve this linear system with a quantum linear system algorithm (QLSA) whose output we perform a post-selective measurement on. The resulting state encodes the solution to the initial value problem. We prove that our algorithm is asymptotically optimal with respect to several system parameters. The PDE algorithms apply the finite difference method (FDM) to Poisson's equation, the wave equation, and the Klein-Gordon equation. We use high order FDM approximations of the Laplacian operator to develop linear systems for Poisson's equation in cubic volumes under periodic, Neumann, and Dirichlet boundary conditions. Using QLSAs, we output states encoding solutions to Poisson's equation. We prove that our algorithm is exponentially faster with respect to the spatial dimension than analogous classical algorithms. We also consider how high order Laplacian approximations can be used for simulating the wave and Klein-Gordon equations. We consider under what conditions it suffices to use Hamiltonian simulation for time evolution, and we propose an algorithm for these cases that uses QLSAs for state preparation and post-processing.

•Jan 1, 2019•0 citations

Development and analysis of variational quantum algorithms to solve engineering differential equations

Josephine Hunout

Differential equations underpin a vast range of scientific and engineering domains, including structural mechanics, fluid dynamics, and financial modelling. Their intricate nature often renders classical numerical methods computationally demanding, requiring fine discretization or large basis expansions, which can lead to prohibitive costs. Quantum computing offers a fundamentally different paradigm, leveraging superposition and entanglement with the promise of computational speedup. However, in the current Noisy Intermediate-Scale Quantum (NISQ) era, fully fault-tolerant quantum computers remain decades away, motivating the development of hybrid strategies such as Variational Quantum Algorithms (VQAs), which train parametrised quantum circuits using classical optimizers. This work investigates spectral VQAs for solving differential equations, extending the Chebyshev-encoded VQA of Kyriienko et al. and introducing a novel quantum spectral approach: the Lagrange-encoded VQA. This approach shifts the paradigm by incorporating entanglement directly within the encoding block while maintaining a shallow variational ansatz. Inspired by the Hadamard test structure, the design enables an efficient representation of the complete set of Lagrange polynomial basis functions using a limited number of gates and facilitates the use of the Hadamard test differentiation method, thereby reducing the computational load. VQA performance is analysed through the accuracy of the result in combination with the gate count and circuit count metrics, which serve as proxies for runtime and noise accumulation on NISQ devices. The proposed VQA is benchmarked on multiple problems: (i) a first-order linear ODEs and (ii) the second-order ODEs damped mass-spring system, both comparing Lagrange- and Chebyshev-encoded VQAs, (iii) the Poisson equation, comparing the Lagrange-encoded VQA with the discretized approach of Sato et al., and (iv) a first-order ODE with nonlinear coefficients addressed with the Lagrange-encoded VQA. Across these cases, the Lagrange-encoded VQA consistently achieves comparable or improved accuracy while significantly reducing circuit depth and computational overload, making it a promising candidate for NISQ devices.

•Sep 1, 2025•0 citations

A novel quantum Fourier ordinary differential equation solver for solving linear and nonlinear partial differential equations

Yang Xiao, Liming Yang, Chang Shu +2 more

In this work, a novel quantum Fourier ordinary differential equation (ODE) solver is proposed to solve both linear and nonlinear partial differential equations (PDEs). Traditional quantum ODE solvers transform a PDE into an ODE system via spatial discretization and then integrate it, thereby converting the task of solving the PDE into computing the integral for the driving function f(x). These solvers rely on the quantum amplitude estimation algorithm, which requires the driving function f(x) to be within the range of [0, 1] and necessitates the construction of a quantum circuit for the oracle R that encodes f(x). This construction can be highly complex, even for simple functions like f(x) = x. An important exception arises for the specific case of f(x) = sin2(mx + c), which can be encoded more efficiently using a set of Ry rotation gates. To address these challenges, we expand the driving function f(x) as a Fourier series and propose the quantum Fourier ODE Solver. This approach not only simplifies the construction of the oracle R but also removes the restriction that f(x) must lie within [0,1]. The proposed method was evaluated by solving several representative linear and nonlinear PDEs, including the Navier–Stokes (N–S) equations. The results show that the quantum Fourier ODE solver produces results that closely match both analytical and reference solutions.

arXiv:2504.10218•Physics of Fluids•Jun 1, 2025•7 citations
Differential equations can be encoded as ground-state problems by constructing a positive-semidefinite effective Hamiltonian whose minimum-energy state represents the solution. We extend this framework in several directions. First, we show how multiple nonzero initial, boundary, and data conditions can be incorporated into the homogeneous formulation A∣f⟩=0A | f\rangle=0A∣f⟩=0 using a known nonzero reference condition. We then analyse an alternative formulation based on A∣f⟩=∣b⟩A |f\rangle = | b\rangleA∣f⟩=∣b⟩, with Hamiltonian Hb=A†(I−∣b⟩⟨b∣)AH_b=A^\dagger(I-|b\rangle\langle b|)AHb​=A†(I−∣b⟩⟨b∣)A, which incorporates source terms and nonzero constraints through an augmented system. For nonlinear differential equations, we examine the unphysical ground-state degeneracy introduced by tensor-product representations and consider both Hamiltonian constraints and ansatz-level restrictions for targeting physically valid product states. Finally, we develop grid-value amplitude-encoded versions of both Hamiltonian constructions and compare them with spectral coefficient encoding. Through linear and nonlinear examples, we assess how the choice of Hamiltonian formulation and function representation affects solution recovery, spectral gap, degeneracy, and readout. These results broaden the applicability of ground-state-based quantum differential-equation solvers while clarifying their principal practical trade-offs.
The paper studies how ground-state encodings of differential equations can accommodate nonzero constraints, alternative function representations, and polynomial nonlinearities. It extends the homogeneous residual formulation A∣f⟩=0A|f\rangle=0A∣f⟩=0 by expressing multiple initial, boundary, or data conditions relative to a known nonzero reference condition. It also adapts the linear-system Hamiltonian Hb=A†(I−∣b⟩⟨b∣)AH_b=A^\dagger(I-|b\rangle\langle b|)AHb​=A†(I−∣b⟩⟨b∣)A, augmenting the system with constraints to incorporate source terms and nonzero data. This construction requires a nonzero right-hand side and sufficient constraints to exclude unwanted null-space solutions.
Both constructions are developed for spectral-coefficient and grid-value amplitude encodings and tested using noiseless statevector VQE simulations. Linear examples cover RC charging, the Airy equation, and composite-wall conduction using 3–4 qubits. For RC charging with eight coefficients or grid values, maximum errors are approximately 2×10−62\times10^{-6}2×10−6 for Chebyshev encoding versus 5×10−35\times10^{-3}5×10−3 for the grid discretisation. The wall example illustrates the need for distinct one-sided derivatives at material interfaces; domain decomposition resolves the incompatibility of a single smooth spectral representation.
For a quadratic Fisher–KPP equation, tensor-product lifting produces ground-space degeneracies of 34–240. A shared-parameter repeated-product ansatz excludes unphysical states from the variational search; numerical continuation is additionally used to reach the desired solution branch. The paper explains why a Hamiltonian cannot select exactly all repeated-product states as its ground space.
The simulations establish neither efficient ground-state preparation nor quantum advantage. Stated limitations include conditioning, spectral gaps, operator implementation, readout costs, variational convergence and noise, and increasing register requirements for higher-degree nonlinearities.
We propose a distinct approach to solving linear and nonlinear differential equations (DEs) on quantum computers by encoding the problem into ground states of effective Hamiltonian operators. Our algorithm relies on constructing such operators in the Chebyshev space, where an effective Hamiltonian is a sum of global differential and data constraints. Once the effective Hamiltonian is formed, solutions of differential equations can be obtained using the ground state preparation techniques (e.g. imaginary-time evolution and quantum singular value transformation), bypassing variational search. Unlike approaches based on discrete grids, the algorithm enables evaluation of solutions beyond fixed grid points and implements constraints in the physics-informed way. Our proposal inherits the best traits from quantum machine learning-based DE solving (compact basis representation, automatic differentiation, nonlinearity) and quantum linear algebra-based approaches (fine-grid encoding, provable speed-up for state preparation), offering a robust strategy for quantum scientific computing in the early fault-tolerant era.
Solving differential equations is a promising application of quantum computing. Spectral methods, where the solution is represented by coefficients in a basis, are particularly well suited to quantum solvers because their structured discretizations can enable efficient linear-algebra operations while providing rapid convergence. Their quantum implementation, however, requires an efficient transform between amplitudes encoding function values and amplitudes encoding expansion coefficients. This work develops two key components of a quantum spectral method. First, we construct the quantum ultraspherical transform (QUT) for orthonormal ultraspherical polynomials, a basis that supports sparse and well-conditioned discretizations of differential equations. For the basis parameters m=0m=0m=0 and 111, this transform reduces to the discrete cosine and sine transforms with known efficient circuits. Our contribution covers every fixed integer m≥2m\geq2m≥2: for dimensions NNN with N+m=2nN+m=2^nN+m=2n, where nnn is the number of qubits, the QUT achieves error at most ε\varepsilonε using a gate count polynomial in nnn and log⁡(1/ε)\log(1/\varepsilon)log(1/ε). The construction builds on the quantum Fourier transform, augmented by approximations whose accuracy guarantees are independent of NNN. Second, we develop a quantum spectral solver for regular linear ordinary differential equations based on the QUT. Under suitable boundary conditions and data-access assumptions, preconditioning keeps condition numbers bounded independently of the basis size, allowing the solution state to be prepared at polylogarithmic cost in system size and inverse error. Together, these contributions provide a framework for quantum spectral methods with the potential to solve linear differential equations efficiently.
We propose a physics-informed quantum algorithm to solve nonlinear and multidimensional differential equations (DEs) in a quantum latent space. We suggest a strategy for building quantum models as state overlaps, where exponentially large sets of independent basis functions are used for implicitly representing solutions. By measuring the overlaps between states which are representations of DE terms, we construct a loss that does not require independent sequential function evaluations on grid points. In this sense, the solver evaluates the loss in an intrinsically parallel way, utilizing a global type of the model. When the loss is trained variationally, our approach can be related to the differentiable quantum circuit protocol, which does not scale with the training grid size. Specifically, using the proposed model definition and feature map encoding, we represent function- and derivative-based terms of a differential equation as corresponding quantum states. Importantly, we propose an efficient way for encoding nonlinearity, for some bases requiring only an additive linear increase of the system size O(N+p)\mathcal{O}(N + p)O(N+p) in the degree of nonlinearity ppp. By utilizing basis mapping, we show how the proposed model can be evaluated explicitly. This allows to implement arbitrary functions of independent variables, treat problems with various initial and boundary conditions, and include data and regularization terms in the physics-informed machine learning setting. On the technical side, we present toolboxes for exponential Chebyshev and Fourier basis sets, developing tools for automatic differentiation and multiplication, implementing nonlinearity, and describing multivariate extensions. The approach is compatible with, and tested on, a range of problems including linear, nonlinear and multidimensional differential equations.
This thesis describes quantum algorithms for Hamiltonian simulation, ordinary differential equations (ODEs), and partial differential equations (PDEs). Product formulas are used to simulate Hamiltonians which can be expressed as a sum of terms which can each be simulated individually. By simulating each of these terms in sequence, the net effect approximately simulates the total Hamiltonian. We find that the error of product formulas can be improved by randomizing over the order in which the Hamiltonian terms are simulated. We prove that this approach is asymptotically better than ordinary product formulas and present numerical comparisons for small numbers of qubits. The ODE algorithm applies to the initial value problem for time-independent first order linear ODEs. We approximate the propagator of the ODE by a truncated Taylor series, and we encode the initial value problem in a large linear system. We solve this linear system with a quantum linear system algorithm (QLSA) whose output we perform a post-selective measurement on. The resulting state encodes the solution to the initial value problem. We prove that our algorithm is asymptotically optimal with respect to several system parameters. The PDE algorithms apply the finite difference method (FDM) to Poisson's equation, the wave equation, and the Klein-Gordon equation. We use high order FDM approximations of the Laplacian operator to develop linear systems for Poisson's equation in cubic volumes under periodic, Neumann, and Dirichlet boundary conditions. Using QLSAs, we output states encoding solutions to Poisson's equation. We prove that our algorithm is exponentially faster with respect to the spatial dimension than analogous classical algorithms. We also consider how high order Laplacian approximations can be used for simulating the wave and Klein-Gordon equations. We consider under what conditions it suffices to use Hamiltonian simulation for time evolution, and we propose an algorithm for these cases that uses QLSAs for state preparation and post-processing.
Differential equations underpin a vast range of scientific and engineering domains, including structural mechanics, fluid dynamics, and financial modelling. Their intricate nature often renders classical numerical methods computationally demanding, requiring fine discretization or large basis expansions, which can lead to prohibitive costs. Quantum computing offers a fundamentally different paradigm, leveraging superposition and entanglement with the promise of computational speedup. However, in the current Noisy Intermediate-Scale Quantum (NISQ) era, fully fault-tolerant quantum computers remain decades away, motivating the development of hybrid strategies such as Variational Quantum Algorithms (VQAs), which train parametrised quantum circuits using classical optimizers. This work investigates spectral VQAs for solving differential equations, extending the Chebyshev-encoded VQA of Kyriienko et al. and introducing a novel quantum spectral approach: the Lagrange-encoded VQA. This approach shifts the paradigm by incorporating entanglement directly within the encoding block while maintaining a shallow variational ansatz. Inspired by the Hadamard test structure, the design enables an efficient representation of the complete set of Lagrange polynomial basis functions using a limited number of gates and facilitates the use of the Hadamard test differentiation method, thereby reducing the computational load. VQA performance is analysed through the accuracy of the result in combination with the gate count and circuit count metrics, which serve as proxies for runtime and noise accumulation on NISQ devices. The proposed VQA is benchmarked on multiple problems: (i) a first-order linear ODEs and (ii) the second-order ODEs damped mass-spring system, both comparing Lagrange- and Chebyshev-encoded VQAs, (iii) the Poisson equation, comparing the Lagrange-encoded VQA with the discretized approach of Sato et al., and (iv) a first-order ODE with nonlinear coefficients addressed with the Lagrange-encoded VQA. Across these cases, the Lagrange-encoded VQA consistently achieves comparable or improved accuracy while significantly reducing circuit depth and computational overload, making it a promising candidate for NISQ devices.
In this work, a novel quantum Fourier ordinary differential equation (ODE) solver is proposed to solve both linear and nonlinear partial differential equations (PDEs). Traditional quantum ODE solvers transform a PDE into an ODE system via spatial discretization and then integrate it, thereby converting the task of solving the PDE into computing the integral for the driving function f(x). These solvers rely on the quantum amplitude estimation algorithm, which requires the driving function f(x) to be within the range of [0, 1] and necessitates the construction of a quantum circuit for the oracle R that encodes f(x). This construction can be highly complex, even for simple functions like f(x) = x. An important exception arises for the specific case of f(x) = sin2(mx + c), which can be encoded more efficiently using a set of Ry rotation gates. To address these challenges, we expand the driving function f(x) as a Fourier series and propose the quantum Fourier ODE Solver. This approach not only simplifies the construction of the oracle R but also removes the restriction that f(x) must lie within [0,1]. The proposed method was evaluated by solving several representative linear and nonlinear PDEs, including the Navier–Stokes (N–S) equations. The results show that the quantum Fourier ODE solver produces results that closely match both analytical and reference solutions.