An efficient quantum algorithm for the one-dimensional Burgers equation

Details An efficient quantum algorithm for the one-dimensional Burgers equation An efficient quantum algorithm for the one-dimensional Burgers equation

2002-10-11

arxiv.org/abs/quant-ph/0210092v1

Physics

Quantum Physics

4 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An efficient quantum algorithm for the one-dimensional Burgers equation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An efficient quantum algorithm for the one-dimensional Burgers equation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient quantum algorithm for the one-dimensional Burgers equation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-372598