Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0210092

An efficient quantum algorithm for the one-dimensional Burgers equation

Jeffrey Yepez

Published Oct 11, 2002• 16 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0210092

Related papers

Two-dimensional quantum lattice gas algorithm for anisotropic Burger-like equations

Niccoló Fonio, Pierre Sagaut, Giuseppe Di Molfetta

Building on hybrid quantum lattice gas algorithm, we revisit the possibilities of this quantum lattice model. By deriving a correction to the predicted viscosity, we provide analytical and numerical results that refine original formulation. We introduce a minimal 2D generalization of the algorithm, which allows to simulate anisotropic Burgers like equations while retaining only two lattice velocities. This approach opens a promising route toward embedding momentum conservation and advancing toward Navier Stokes dynamics in 2D, going beyond Frisch, Hasslacher and Pomeau (FHP) and lattice Boltzmann method (LBM) with a quantum native model. We highlight how the presented algorithm results more efficient in full state evolution than other quantum nonlinear solvers, nonetheless its advantages respect to classical lattice gas methods. Being this model between classical and quantum computation, it gives a unique perspective on simulating nonlinearities with quantum computers, confirming quantum lattice gas models as a crucial playground for quantum simulations of nonlinearities.

quant-pharXiv:2602.17303•Physical Review A•Feb 20, 2026•2 citations

Open quantum system model of the one-dimensional Burgers equation with tunable shear viscosity

Jeffrey Yepez

Presented is an analysis of an open quantum model of the time-dependent evolution of a flow field governed by the nonlinear Burgers equation in one spatial dimension. The quantum model is a system of qubits where there exists a minimum time interval in the time-dependent dynamics. Each temporally discrete unitary quantum-mechanical evolution is followed by state reduction of the quantum state. The mesoscopic behavior of this quantum model is described by a quantum Boltzmann equation with a naturally emergent entropy function and $H$ theorem and the model obeys the detailed balance principle. The macroscopic-scale effective field theory for the quantum model is derived using a perturbative Chapman-Enskog expansion applied to the linearized quantum Boltzmann equation. The entropy function is consistent with the quantum-mechanical collision process and a Fermi-Dirac single-particle distribution function for the occupation probabilities of the qubit's energy eigenstates. Comparisons are presented between analytical predictions and numerical predictions and the agreement is excellent, indicating that the nonlinear Burgers equation with a tunable shear viscosity is the operative macroscopic scale effective field theory.

Physical Review A•Oct 23, 2006•20 citations

QUANTUM LATTICE-GAS MODEL FOR THE DIFFUSION EQUATION

Jeffrey Yepez

Presented is a factorized quantum lattice-gas algorithm to model the diffusion equation. It is a minimal model with two qubits per node of a one-dimensional lattice and it is suitable for implementation on a large array of small quantum computers interconnected by nearest-neighbor classical communication channels. The quantum lattice-gas system is described at the mesoscopic scale by a lattice-Boltzmann equation whose collision term is unconditionally stable and obeys the principle of detailed balance. An analytical treatment of the model is given to predict a macroscopic effective field theory. The numerical simulations are in excellent agreement with the analytical results. In particular, numerical simulations confirm the value of the analytically calculated diffusion constant. The algorithm is time-explicit with numerical convergence that is first-order accurate in time and second-order accurate in space.

International Journal of Modern Physics C•Nov 1, 2001•38 citations

Quantum Computation of Fluid Dynamics

Jeffrey Yepez

Presented is a quantum lattice gas for Navier-Stokes fluid dynamics simulation. The quantum lattice-gas transport equation at the microscopic scale is presented as a generalization of the classical lattice-gas transport equation. A special type of quantum computer network is proposed that is suitable for implementing the quantum lattice gas. The quantum computer network undergoes a partial collapse of the wavefunction at every time step of the dynamical evolution. Each quantum computer in the network comprises only a few qubits, which are entangled for only a short time period. A Chapman-Enskog type analysis of the quantum computer network indicates that the total system of qubits behaves exactly like a viscous lattice-gas fluid at the macroscopic scale. Because of the quantum mechanical nature of the scattering process, superposition of outgoing collisional possibilities occurs. The quantum lattice gas obeys detail balance in its collisions and is therefore an unconditionally stable algorithm for fluid dynamics simulation.

•Feb 16, 1998•3 citations

Fully quantum algorithm for mesoscale fluid simulations with application to partial differential equations

Sriharsha Kocherla, Zhixin Song, Fatima Ezahra Chrit +4 more

Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based mesoscale numerical methods can be executed as efficient quantum algorithms due to their statistical features. This approach revises a quantum algorithm for lattice gas automata to reduce classical computations and state preparation at every time step. For this, the algorithm approximates the qubit relative phases and subtracts them at the end of each time step. Phases are evaluated using the iterative phase estimation algorithm and subtracted using single-qubit rotation phase gates. This method optimizes the quantum resource required and makes it more appropriate for near-term quantum hardware. We also demonstrate how the checkerboard deficiency that the D1Q2 scheme presents can be resolved using the D1Q3 scheme. The algorithm is validated by simulating two canonical partial differential equations: the diffusion and Burgers' equations on different quantum simulators. We find good agreement between quantum simulations and classical solutions for the presented algorithm.

arXiv:2305.07148•AVS Quantum Science•Sep 1, 2024•28 citations

Unconditionally successful quantum Time-Marching algorithm via LCU for nonlinear Burgers equation

Niccolo Fonio, Giuseppe Di Molfetta, Pierre Sagaut

Most recently proposed quantum algorithms for solving linear and nonlinear partial differential equations rely on non-unitary operations. These operations are typically implemented probabilistically, requiring postselection and thus increasing the computational cost. We show that quantum lattice gas algorithms enable unconditionally successful quantum simulation of nonlinearities, yielding, to our knowledge, the first quantum algorithm for Burgers equation whose time steps can be concatenated without probabilistic failure. The key idea is to exploit the correspondence between the stochasticity of quantum measurement in the linear combination of unitaries framework and the intrinsic randomness of the classical lattice gas algorithm. In doing so, we identify general properties that characterize probabilistic classical algorithms amenable to this time-marching formulation, and illustrate the approach with an additional application.

quant-pharXiv:2608.02130•Aug 4, 2026•0 citations
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.
Building on hybrid quantum lattice gas algorithm, we revisit the possibilities of this quantum lattice model. By deriving a correction to the predicted viscosity, we provide analytical and numerical results that refine original formulation. We introduce a minimal 2D generalization of the algorithm, which allows to simulate anisotropic Burgers like equations while retaining only two lattice velocities. This approach opens a promising route toward embedding momentum conservation and advancing toward Navier Stokes dynamics in 2D, going beyond Frisch, Hasslacher and Pomeau (FHP) and lattice Boltzmann method (LBM) with a quantum native model. We highlight how the presented algorithm results more efficient in full state evolution than other quantum nonlinear solvers, nonetheless its advantages respect to classical lattice gas methods. Being this model between classical and quantum computation, it gives a unique perspective on simulating nonlinearities with quantum computers, confirming quantum lattice gas models as a crucial playground for quantum simulations of nonlinearities.
Presented is an analysis of an open quantum model of the time-dependent evolution of a flow field governed by the nonlinear Burgers equation in one spatial dimension. The quantum model is a system of qubits where there exists a minimum time interval in the time-dependent dynamics. Each temporally discrete unitary quantum-mechanical evolution is followed by state reduction of the quantum state. The mesoscopic behavior of this quantum model is described by a quantum Boltzmann equation with a naturally emergent entropy function and HHH theorem and the model obeys the detailed balance principle. The macroscopic-scale effective field theory for the quantum model is derived using a perturbative Chapman-Enskog expansion applied to the linearized quantum Boltzmann equation. The entropy function is consistent with the quantum-mechanical collision process and a Fermi-Dirac single-particle distribution function for the occupation probabilities of the qubit's energy eigenstates. Comparisons are presented between analytical predictions and numerical predictions and the agreement is excellent, indicating that the nonlinear Burgers equation with a tunable shear viscosity is the operative macroscopic scale effective field theory.
Presented is a factorized quantum lattice-gas algorithm to model the diffusion equation. It is a minimal model with two qubits per node of a one-dimensional lattice and it is suitable for implementation on a large array of small quantum computers interconnected by nearest-neighbor classical communication channels. The quantum lattice-gas system is described at the mesoscopic scale by a lattice-Boltzmann equation whose collision term is unconditionally stable and obeys the principle of detailed balance. An analytical treatment of the model is given to predict a macroscopic effective field theory. The numerical simulations are in excellent agreement with the analytical results. In particular, numerical simulations confirm the value of the analytically calculated diffusion constant. The algorithm is time-explicit with numerical convergence that is first-order accurate in time and second-order accurate in space.
Presented is a quantum lattice gas for Navier-Stokes fluid dynamics simulation. The quantum lattice-gas transport equation at the microscopic scale is presented as a generalization of the classical lattice-gas transport equation. A special type of quantum computer network is proposed that is suitable for implementing the quantum lattice gas. The quantum computer network undergoes a partial collapse of the wavefunction at every time step of the dynamical evolution. Each quantum computer in the network comprises only a few qubits, which are entangled for only a short time period. A Chapman-Enskog type analysis of the quantum computer network indicates that the total system of qubits behaves exactly like a viscous lattice-gas fluid at the macroscopic scale. Because of the quantum mechanical nature of the scattering process, superposition of outgoing collisional possibilities occurs. The quantum lattice gas obeys detail balance in its collisions and is therefore an unconditionally stable algorithm for fluid dynamics simulation.
Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based mesoscale numerical methods can be executed as efficient quantum algorithms due to their statistical features. This approach revises a quantum algorithm for lattice gas automata to reduce classical computations and state preparation at every time step. For this, the algorithm approximates the qubit relative phases and subtracts them at the end of each time step. Phases are evaluated using the iterative phase estimation algorithm and subtracted using single-qubit rotation phase gates. This method optimizes the quantum resource required and makes it more appropriate for near-term quantum hardware. We also demonstrate how the checkerboard deficiency that the D1Q2 scheme presents can be resolved using the D1Q3 scheme. The algorithm is validated by simulating two canonical partial differential equations: the diffusion and Burgers' equations on different quantum simulators. We find good agreement between quantum simulations and classical solutions for the presented algorithm.
Most recently proposed quantum algorithms for solving linear and nonlinear partial differential equations rely on non-unitary operations. These operations are typically implemented probabilistically, requiring postselection and thus increasing the computational cost. We show that quantum lattice gas algorithms enable unconditionally successful quantum simulation of nonlinearities, yielding, to our knowledge, the first quantum algorithm for Burgers equation whose time steps can be concatenated without probabilistic failure. The key idea is to exploit the correspondence between the stochasticity of quantum measurement in the linear combination of unitaries framework and the intrinsic randomness of the classical lattice gas algorithm. In doing so, we identify general properties that characterize probabilistic classical algorithms amenable to this time-marching formulation, and illustrate the approach with an additional application.