Quantum circuits for partial differential equations in Fourier space
Michael Lubasch, Yuta Kikuchi, Lewis Wright, Conor Mc Keever

TL;DR
This paper demonstrates how quantum Fourier transform-based circuits can efficiently solve various partial differential equations, offering a promising approach for high-dimensional problems on quantum computers.
Contribution
It introduces simple, hardware-efficient quantum circuits for PDEs using QFT and quantum singular value transformation, advancing quantum PDE solving methods.
Findings
Explicit QFT-based circuits for multiple PDEs
Circuits are of near-optimal computational complexity
Approximations for smooth initial conditions reduce hardware demands
Abstract
For the solution of partial differential equations (PDEs), we show that the quantum Fourier transform (QFT) can enable the design of quantum circuits that are particularly simple, both conceptually and with regard to hardware requirements. This is shown by explicit circuit constructions for the incompressible advection, heat, isotropic acoustic wave, and Poisson's equations as canonical examples. We utilize quantum singular value transformation to develop circuits that are expected to be of optimal computational complexity. Additionally, we consider approximations suited for smooth initial conditions and describe circuits that make lower demands on hardware. The simple QFT-based circuits are efficient with respect to dimensionality and pave the way for current quantum computers to solve high-dimensional PDEs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum many-body systems · Quantum Information and Cryptography
