An efficient quantum algorithm for the one-dimensional Burgers equation

Simple item page
dc.creatorYepez, Jeffrey
dc.date2002-10-11
dc.date.accessioned2026-07-07T06:05:14Z
dc.date.available2026-07-07T06:05:14Z
dc.descriptionWe 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.
dc.description4 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0210092
dc.identifierhttp://arxiv.org/abs/quant-ph/0210092
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90568
dc.subjectQuantum Physics
dc.titleAn efficient quantum algorithm for the one-dimensional Burgers equation
dc.typetext

Files

Collections

arXiv