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:1711.05394 · Physical Review A

Quantum algorithm for simulating the wave equation

Pedro C. S. Costa, Stephen P. Jordan, Aaron Ostrander

Published Jan 15, 2019• 196 citations
arXivHTMLPDF

Abstract

We present a quantum algorithm for simulating the wave equation under Dirichlet and Neumann boundary conditions. The algorithm uses Hamiltonian simulation and quantum linear system algorithms as subroutines. It relies on factorizations of discretized Laplacian operators to allow for polynomially improved scaling in truncation errors and improved scaling for state preparation relative to general purpose quantum algorithms for solving linear differential equations. Relative to classical algorithms for simulating the $D$-dimensional wave equation, our quantum algorithm achieves exponential space savings and achieves a speedup which is polynomial for fixed $D$ and exponential in $D$. We also consider using Hamiltonian simulation for Klein-Gordon equations and Maxwell's equations.

DOI
10.1103/physreva.99.012323

Related papers

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

Quantum wave simulation with sources and loss functions

Cyrill Bösch, Malte Schade, Giacomo Aloisi +2 more

We present a quantum algorithmic framework for simulating linear, anti-Hermitian (lossless) wave equations in heterogeneous, anisotropic, and time-independent media. This framework encompasses a broad class of wave equations, including the acoustic wave equation, Maxwell’s equations, and the elastic wave equation. Our formulation is compatible with standard numerical discretization schemes and allows for the efficient implementation of multiple practically relevant time- and space-dependent sources. Furthermore, we demonstrate that subspace energies can be extracted and wave fields compared through an l 2 loss function, achieving optimal precision scaling with the number of samples taken. Additionally, we introduce techniques for incorporating boundary conditions and linear constraints that preserve the anti-Hermitian nature of the equations. Leveraging the Hamiltonian simulation algorithm, our framework achieves a quartic speedup over classical solvers in three-dimensional simulations, under conditions of sufficiently global measurements and compactly supported sources and initial conditions. This quartic speedup is optimal for time-domain solutions, as the Hamiltonian of the discretized wave equations has local couplings. In summary, our framework provides a versatile approach for simulating wave equations on quantum computers, offering substantial speedups over state-of-the-art classical methods.

arXiv:2411.17630•Physical Review Research•Jul 28, 2025•7 citations

Quantum Algorithm for Solving the Wave Equation on a Hexagonal Grid

Roman Novak

Numerical methods based on finite differences for solving the wave equation are prone to various errors, a challenge that also applies to the semi-discrete case of a recently proposed quantum algorithm that preserves continuous time while discretizing space into a quantum state vector. The inherent limitations of quantum processing, which affect the generality and extensibility of the quantum algorithm compared to classical numerical solvers, are offset by the logarithmic scaling of the number of qubits with the number of grid points. The higher grid density in combination with the higher-order approximation of the continuous Laplacian operator improves the numerical accuracy. In contrast to the Dirichlet boundary condition, however, the Neumann boundary condition in the quantum algorithm cannot exceed a second-order Laplacian approximation. Moreover, the anisotropy error is inherent to the lattice geometry. In this work, we propose a quantum wave equation solver on a hexagonal grid, which exhibits intrinsic grid dispersion comparable to that of a fourth-order accurate method on a rectangular grid and provides a quadratic improvement in the anisotropy measures. We show that the graph Laplacian on a hexagonal grid embedding the Neumann boundary condition is a bidirected graph. To make it suitable for use as a system Hamiltonian, a symmetrization and factorization based on the asymmetric adjacency matrix is proposed. Dispersion relations for quantum algorithms solving the wave equation on different lattices are derived and compared. The algorithms are analyzed as a limiting case of Yee’s finite-difference time-domain method in the context of electromagnetic wave propagation.

IEEE Access•Jan 1, 2024•2 citations

Quantum framework for simulating linear PDEs with Robin boundary conditions

Nikita Guseynov, Xiajie Huang, Nana Liu

Abstract We propose an explicit quantum framework for numerically simulating general linear partial differential equations (PDEs), extending previous work (Guseynov et al 2025 Phys. Rev. Res. 7 033100) to incorporate (a) Robin boundary conditions—which include Neumann and Dirichlet conditions as special cases–(b) inhomogeneous terms, and (c) variable coefficients in space and time. Our approach begins with a general finite-difference discretization and applies the Schrödingerisation technique to transform the resulting system into one that admits unitary quantum evolution, enabling quantum simulation. For the Schrödinger equation corresponding to the discretized PDE, we construct an efficient block-encoding of the Hamiltonian H that scales polylogarithmically with the number of grid points N . This encoding is compatible with quantum signal processing and allows for the implementation of the evolution operator e − i H t . The explicit circuit construction in our method permits complexity to be measured in fundamental gate units–namely, CNOT gates and single-qubit rotations–bypassing the inefficiencies of oracle queries. Consequently, the overall algorithm scales polynomially with N and linearly with the spatial dimension d . Under certain input/output assumptions our method achieves a polynomial speedup in N and an exponential advantage in d for a wide class of PDEs, thereby mitigating the classical curse of dimensionality. The validity and efficiency of the proposed approach are further substantiated by numerical simulations. By explicitly defining the quantum operations and quantifying their resource requirements, our approach offers a practical alternative for numerically solving PDEs, distinct from others that rely on oracle queries and purely asymptotic scaling methods.

arXiv:2506.20478•Quantum Science and Technology•Jan 27, 2026•5 citations

Hamiltonian simulation for hyperbolic partial differential equations by scalable quantum circuits

Yuki Sato, Ruho Kondo, Ikko Hamamura +2 more

Solving partial differential equations for extremely large-scale systems within a feasible computation time serves in accelerating engineering developments. Quantum computing algorithms, particularly the Hamiltonian simulations, present a potential and promising approach to achieve this purpose. Actually, there are several oracle-based Hamiltonian simulations with potential quantum speedup, but their detailed implementations and accordingly the detailed computational complexities are all unclear. This paper presents a method that enables us to explicitly implement the quantum circuit for Hamiltonian simulation; the key technique is the explicit gate construction of differential operators contained in the target partial differential equation discretized by the finite difference method. Moreover, we show that the space and time complexities of the constructed circuit are exponentially smaller than those of conventional classical algorithms. We also provide numerical experiments and an experiment on a real device for the wave equation to demonstrate the validity of our proposed method. Published by the American Physical Society 2024

arXiv:2402.18398•Physical Review Research•Sep 4, 2024•50 citations

Quantum algorithms for the fractional Poisson equation via rational approximation

Yin Yang, Yue Yu, Long Zhang +1 more

This paper presents a quantum algorithm for solving the fractional Poisson equation \((-Δ)^s u = f\) with \(s \in (0,1)\) on bounded domains. The proposed approach combines rational approximation techniques with quantum linear system solvers to achieve exponential quantum advantage. The rational approximation represents the inverse fractional Laplacian as a weighted sum of standard resolvents, transforming the original nonlocal problem into a collection of shifted integer-order partial differential equations. These equations are consolidated into a single large linear system through a modified right-hand side construction that simplifies the quantum implementation. To enable practical implementation, we develop explicit quantum circuits via the Schrödingerization technique, which converts the non-unitary dynamics of the linear system into a higher-dimensional Schrödinger-type equation, allowing the use of standard Hamiltonian simulation. The circuit construction leverages the decomposition of shift operators to realize the discrete Laplacian and employs controlled operations to implement the select oracle. Under finite difference discretization, we provide detailed algorithmic procedures utilizing block-encoding techniques for the coefficient matrices. A comprehensive complexity analysis demonstrates that the quantum algorithm achieves a dependence on the inverse mesh size \(h^{-1}\) that is independent of the spatial dimension \(d\), in stark contrast to classical methods which suffer from exponential growth in high dimensions. This establishes an exponential quantum advantage for high-dimensional fractional problems, effectively overcoming the curse of dimensionality that limits classical approaches.

quant-pharXiv:2604.00603•Apr 2, 2026•0 citations
We present a quantum algorithm for simulating the wave equation under Dirichlet and Neumann boundary conditions. The algorithm uses Hamiltonian simulation and quantum linear system algorithms as subroutines. It relies on factorizations of discretized Laplacian operators to allow for polynomially improved scaling in truncation errors and improved scaling for state preparation relative to general purpose quantum algorithms for solving linear differential equations. Relative to classical algorithms for simulating the DDD-dimensional wave equation, our quantum algorithm achieves exponential space savings and achieves a speedup which is polynomial for fixed DDD and exponential in DDD. We also consider using Hamiltonian simulation for Klein-Gordon equations and Maxwell's 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.
We present a quantum algorithmic framework for simulating linear, anti-Hermitian (lossless) wave equations in heterogeneous, anisotropic, and time-independent media. This framework encompasses a broad class of wave equations, including the acoustic wave equation, Maxwell’s equations, and the elastic wave equation. Our formulation is compatible with standard numerical discretization schemes and allows for the efficient implementation of multiple practically relevant time- and space-dependent sources. Furthermore, we demonstrate that subspace energies can be extracted and wave fields compared through an l 2 loss function, achieving optimal precision scaling with the number of samples taken. Additionally, we introduce techniques for incorporating boundary conditions and linear constraints that preserve the anti-Hermitian nature of the equations. Leveraging the Hamiltonian simulation algorithm, our framework achieves a quartic speedup over classical solvers in three-dimensional simulations, under conditions of sufficiently global measurements and compactly supported sources and initial conditions. This quartic speedup is optimal for time-domain solutions, as the Hamiltonian of the discretized wave equations has local couplings. In summary, our framework provides a versatile approach for simulating wave equations on quantum computers, offering substantial speedups over state-of-the-art classical methods.
Numerical methods based on finite differences for solving the wave equation are prone to various errors, a challenge that also applies to the semi-discrete case of a recently proposed quantum algorithm that preserves continuous time while discretizing space into a quantum state vector. The inherent limitations of quantum processing, which affect the generality and extensibility of the quantum algorithm compared to classical numerical solvers, are offset by the logarithmic scaling of the number of qubits with the number of grid points. The higher grid density in combination with the higher-order approximation of the continuous Laplacian operator improves the numerical accuracy. In contrast to the Dirichlet boundary condition, however, the Neumann boundary condition in the quantum algorithm cannot exceed a second-order Laplacian approximation. Moreover, the anisotropy error is inherent to the lattice geometry. In this work, we propose a quantum wave equation solver on a hexagonal grid, which exhibits intrinsic grid dispersion comparable to that of a fourth-order accurate method on a rectangular grid and provides a quadratic improvement in the anisotropy measures. We show that the graph Laplacian on a hexagonal grid embedding the Neumann boundary condition is a bidirected graph. To make it suitable for use as a system Hamiltonian, a symmetrization and factorization based on the asymmetric adjacency matrix is proposed. Dispersion relations for quantum algorithms solving the wave equation on different lattices are derived and compared. The algorithms are analyzed as a limiting case of Yee’s finite-difference time-domain method in the context of electromagnetic wave propagation.
Abstract We propose an explicit quantum framework for numerically simulating general linear partial differential equations (PDEs), extending previous work (Guseynov et al 2025 Phys. Rev. Res. 7 033100) to incorporate (a) Robin boundary conditions—which include Neumann and Dirichlet conditions as special cases–(b) inhomogeneous terms, and (c) variable coefficients in space and time. Our approach begins with a general finite-difference discretization and applies the Schrödingerisation technique to transform the resulting system into one that admits unitary quantum evolution, enabling quantum simulation. For the Schrödinger equation corresponding to the discretized PDE, we construct an efficient block-encoding of the Hamiltonian H that scales polylogarithmically with the number of grid points N . This encoding is compatible with quantum signal processing and allows for the implementation of the evolution operator e − i H t . The explicit circuit construction in our method permits complexity to be measured in fundamental gate units–namely, CNOT gates and single-qubit rotations–bypassing the inefficiencies of oracle queries. Consequently, the overall algorithm scales polynomially with N and linearly with the spatial dimension d . Under certain input/output assumptions our method achieves a polynomial speedup in N and an exponential advantage in d for a wide class of PDEs, thereby mitigating the classical curse of dimensionality. The validity and efficiency of the proposed approach are further substantiated by numerical simulations. By explicitly defining the quantum operations and quantifying their resource requirements, our approach offers a practical alternative for numerically solving PDEs, distinct from others that rely on oracle queries and purely asymptotic scaling methods.
Solving partial differential equations for extremely large-scale systems within a feasible computation time serves in accelerating engineering developments. Quantum computing algorithms, particularly the Hamiltonian simulations, present a potential and promising approach to achieve this purpose. Actually, there are several oracle-based Hamiltonian simulations with potential quantum speedup, but their detailed implementations and accordingly the detailed computational complexities are all unclear. This paper presents a method that enables us to explicitly implement the quantum circuit for Hamiltonian simulation; the key technique is the explicit gate construction of differential operators contained in the target partial differential equation discretized by the finite difference method. Moreover, we show that the space and time complexities of the constructed circuit are exponentially smaller than those of conventional classical algorithms. We also provide numerical experiments and an experiment on a real device for the wave equation to demonstrate the validity of our proposed method. Published by the American Physical Society 2024
This paper presents a quantum algorithm for solving the fractional Poisson equation (−Δ)su=f(-Δ)^s u = f(−Δ)su=f with s∈(0,1)s \in (0,1)s∈(0,1) on bounded domains. The proposed approach combines rational approximation techniques with quantum linear system solvers to achieve exponential quantum advantage. The rational approximation represents the inverse fractional Laplacian as a weighted sum of standard resolvents, transforming the original nonlocal problem into a collection of shifted integer-order partial differential equations. These equations are consolidated into a single large linear system through a modified right-hand side construction that simplifies the quantum implementation. To enable practical implementation, we develop explicit quantum circuits via the Schrödingerization technique, which converts the non-unitary dynamics of the linear system into a higher-dimensional Schrödinger-type equation, allowing the use of standard Hamiltonian simulation. The circuit construction leverages the decomposition of shift operators to realize the discrete Laplacian and employs controlled operations to implement the select oracle. Under finite difference discretization, we provide detailed algorithmic procedures utilizing block-encoding techniques for the coefficient matrices. A comprehensive complexity analysis demonstrates that the quantum algorithm achieves a dependence on the inverse mesh size h−1h^{-1}h−1 that is independent of the spatial dimension ddd, in stark contrast to classical methods which suffer from exponential growth in high dimensions. This establishes an exponential quantum advantage for high-dimensional fractional problems, effectively overcoming the curse of dimensionality that limits classical approaches.