An efficient quantum algorithm for the one-dimensional Burgers equation

J. Yepez · 2002 · arXiv

| 编号 QC033 | 主题 量子 PDE 求解 | 链接 arXiv:quant-ph/0210092 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

We analyze one-dimensional classical and quantum microscopic lattice-gas models governed by a lattice Boltzmann equation at the mesoscopic scale, achieved by ensemble averaging over microscopic realizations. The models are governed by the Burgers equation at the macroscopic scale, achieved by taking the limit where the grid size and time step both approach zero and by performing a perturbative Chapman-Enskog expansion. The quantum algorithm exploiting superposition and entanglement is more efficient than the classical one because the quantum algorithm requires less memory. Furthermore, its viscosity can be made arbitrarily small.

本站词条在引用该文献时，会以 wikilink（sources/QC033）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。