Quantum algorithm for simulating the wave equation
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A family of embedded Runge-Kutta formulae
Dormand, J. R., & Prince, P. J. (1980) · Journal of Computational and Applied Mathematics · doi:10.1016/0771-050x(80)90013-3 · Cited by 3,634
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 3×
“endent wave equation through nite element methods such as the Galerkin method. In [7] Montanaro and Pallister analyze, in a general context, the degree to which quantum linear algebra methods such as [8,9] allow speedup for nite element methods. Detailed analysis of how this can be applied to the wave equation specica…”
MethodInfluentialSurvey of the stability of linear finite difference equations
Lax, P. D., & Richtmyer, R. D. (1956) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160090206 · Cited by 826
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C. (2007) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0150-x · Cited by 692
Childs, A. M., Kothari, R., & Somma, R. D. (2017) · SIAM Journal on Computing · doi:10.1137/16m1087072 · Cited by 646 · cited 4×
“onds in the continuum limit to the solution to the following system of equations. r~ ˚~ E = i˚_ 0 (36) ~r ˚~ E = 0: (37) To construct the state (35) we can use the quantum linear systems algorithm of [8]. Specically, we wish to prepare the state proportional to the solution to Ax= bwhere A = 1 0 0 ia 1B (38) b = ˚ 0 ˚…”
MethodInfluentialHamiltonian Simulation with Nearly Optimal Dependence on all Parameters
Berry, D. W., Childs, A. M., & Kothari, R. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.54 · Cited by 372 · cited 4×
“Our quantum algorithm is implemented on a gate model quantum computer, and time evolution is discretized into a sequence of elementary gates through the method of [9].”
BackgroundMethodInfluentialPreconditioned Quantum Linear System Algorithm
Clader, B. D., Jacobs, B. C., & Sprouse, C. R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.250504 · Cited by 288
High-order quantum algorithm for solving linear differential equations
Berry, D. W. (2014) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/47/10/105301 · Cited by 277 · cited 3×
“…the wave equation in a region of diameter (cid:2) can be discretized onto a lattice of spacing a and transformed into a system of linear first-order differential equations, which could then in general be solved by the quantum algorithms of [1,2] with complexity of order ( (cid:2)/a ) 2 (see Sec.”
BackgroundMethodQuantum algorithms and the finite element method
Montanaro, A., & Pallister, S. (2016) · Physical Review A · doi:10.1103/physreva.93.032324 · Cited by 192
A quantum algorithm to solve nonlinear differential equations
Leyton, S. K., & Osborne, T. J. (2008) · arXiv · doi:10.48550/arxiv.0812.4423 · Cited by 65
Cited by
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
“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).”
MethodSolving nonlinear differential equations with differentiable quantum circuits
Kyriienko, O., Paine, A. E., & Elfving, V. E. (2021) · Physical Review A · doi:10.1103/physreva.103.052416 · Cited by 185
Solving nonlinear differential equations with differentiable quantum circuits
Kyriienko, O., Paine, A. E., & Elfving, V. E. (2020) · arXiv · doi:10.48550/arxiv.2011.10395 · Cited by 185
Quantum Spectral Methods for Differential Equations
Childs, A. M., & Liu, J.-P. (2020) · Communications in Mathematical Physics · doi:10.1007/s00220-020-03699-z · Cited by 133
Metadata
- Authors
- Costa, P. C. S., Jordan, S., & Ostrander, A.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2019-01-15
- Volume
- 99
- Issue
- 1
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W2770725152
- Cited by
- 160
- References
- 10
- FWCI
- 5.41
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.