2019
DOI: 10.1103/physreva.99.012323
|View full text |Cite
|
Sign up to set email alerts
|

Quantum algorithm for simulating the wave equation

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 improved scaling in truncation errors and improved scaling for state preparation relative to general purpose linear differential equation algorithms. We also consider using Hamiltonian simulation for Klein-Gordon equations and Maxw… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
75
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 116 publications
(75 citation statements)
references
References 20 publications
0
75
0
Order By: Relevance
“…And a number of potentially useful applications have been suggested. For example, we can use this matrix inversion algorithm to find approximate solutions to classical linear field equations [41,42,43] (after discretizing the field on a spatial lattice, and applying a suitable preconditioner). This procedure could be used, say, to solve the equations of electromagnetism in a complex three-dimensional geometry, for the purpose of optimizing the performance of an antenna.…”
Section: Quantum Matrix Inversionmentioning
confidence: 99%
“…And a number of potentially useful applications have been suggested. For example, we can use this matrix inversion algorithm to find approximate solutions to classical linear field equations [41,42,43] (after discretizing the field on a spatial lattice, and applying a suitable preconditioner). This procedure could be used, say, to solve the equations of electromagnetism in a complex three-dimensional geometry, for the purpose of optimizing the performance of an antenna.…”
Section: Quantum Matrix Inversionmentioning
confidence: 99%
“…Since quantum computers can only perform linear unitary operations, it is not clear how nonlinear nonunitary simulations can be performed efficiently. While efficient quantum algorithms for linear ordinary differential equations (ODEs) are known [6,7], an attempt to simulate nonlinear dynamics by measuring the full state at each time step and feeding this information into the next time step would require an exponential amount of resources. The method of Ref.…”
Section: A Motivationmentioning
confidence: 99%
“…It is already known that there are quantum algorithms that can speed up the solution of a linear system of ordinary differential equations [6] and linear partial differential equations, such as wave equations [7]. Can this be extended to nonlinear systems?…”
Section: Complexity Estimatesmentioning
confidence: 99%
“…The initial theoretical success in applying quantum computing to cryptanalysis was quickly replicated in other fields, such as computational chemistry and optimization research. With respect to the electromagnetic field modeling, a quantum algorithm was already developed that simulates the wave equation [102]. That led to the proposal of a quantum based TLM algorithm [103] for the simulations of electromagnetic structures.…”
Section: Prospects Of Quantum Computingmentioning
confidence: 99%