Detailed assessment of calculating drag force with quantum computers: Explicit time-evolution precludes exponential advantage for nonlinear differential equations
J. Penuel, A. Katabarwa, P. D. Johnson, P. Kuklinski, B. Rempfer, C. Farquhar, Y. Cao, M. C. Garrett · 2024 · arXiv（DARPA Quantum Benchmarking 系列）
| 编号 QC010 | 主题 综述与基础 | 链接 arXiv:2406.06323 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
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 T-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 encod ings 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 (Re). We estimate the required (logical qubits)×(T-gates), finding them to be prohibitively large, ranging from to . While classical simulations scale as , our QREs exhibit a modest polynomial scaling of , indicating no exponential quantum advantage. We attribute this limitation to an intrinsic power-law relationship between spatial grid resolution and time-stepping requirements that is a fundamental characteristic of explicit methods for evolving nonlinear differential equations. Thus, quantum computers are unlikely to provide utility in applications that require time-evolving fluids and other systems of nonlinear differential equations.
本站词条在引用该文献时，会以 wikilink（sources/QC010）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。