Detailed assessment of calculating drag force with quantum computers: Explicit time-evolution precludes exponential advantage for nonlinear differential equations
John Penuel, Amara Katabarwa, Peter D. Johnson, Parker Kuklinski, Benjamin Rempfer, Collin Farquhar, Yudong Cao, Michael C. Garrett

TL;DR
This paper evaluates the potential of fault-tolerant quantum computers for fluid dynamics simulations, specifically drag force calculations, and finds that explicit time-evolution methods do not offer exponential speedup due to fundamental limitations.
Contribution
The study provides detailed quantum resource estimates for fluid dynamics simulations and demonstrates that explicit time-evolution algorithms do not yield exponential quantum advantage for nonlinear differential equations.
Findings
Quantum resource estimates are prohibitively large, ranging from 10^{21} to 10^{39} logical qubits and T-gates.
Quantum algorithms show polynomial scaling with Reynolds number, similar to classical methods.
Explicit time-evolution methods inherently limit quantum advantage in nonlinear fluid dynamics simulations.
Abstract
This study examines the potential for fault-tolerant quantum computers to provide utility in fluid dynamics simulations, with a focus on drag force calculations for ship hull design. We assess whether quantum algorithms can surpass classical computational limits by generating detailed quantum resource estimates (QREs) in terms of logical qubits and -gate counts. Our analysis is based on a quantum algorithm leveraging Carleman linearization of the lattice Boltzmann method (LBM), which has been suggested to offer exponential speedup. We develop efficient block encodings for LBM matrices and a method for amplitude-encoding drag force. We apply the method to the simple case of fluid flow past a sphere across a range of Reynolds numbers (). We estimate the required (logical qubits)(-gates), finding them to be prohibitively large, ranging from to…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Cloud Computing and Resource Management · Distributed and Parallel Computing Systems
