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

International Journal of Modern Physics C

QUANTUM LATTICE-GAS MODEL FOR THE DIFFUSION EQUATION

Jeffrey Yepez

Published Nov 1, 2001• 38 citations
Publisher

Abstract

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.

DOI
10.1142/s0129183101002656

Related papers

Simulation of the diffusion equation on a type-II quantum computer

G. P. Berman, Alexandr Alexandrovich Ezhov, D. I. Kamenev +1 more

A lattice-gas algorithm for the one-dimensional diffusion equation is realized using radio frequency pulses in a one-dimensional spin system. The model is a large array of quantum two-qubit nodes interconnected by the nearest-neighbor classical communication channels. We present a quantum protocol for implementation of the quantum collision operator and a method for initialization and reinitialization of quantum states. Numerical simulations of the quantum-classical dynamics are in good agreement with the analytic solution for the diffusion equation.

Physical Review A•Jul 24, 2002•29 citations

Type II Quantum Computing Algorithm for Computational Fluid Dynamics

James Scoville

An algorithm is presented to simulate fluid dynamics on a three qubit type II quantum computer: a lattice of small quantum computers that communicate classical information. The algorithm presented is called a three qubit factorized quantum lattice gas algorithm. It is modeled after classical lattice gas algorithms which move virtual particles along an imaginary lattice and change the particles' momentums using collision rules when they meet at a lattice node. Instead of moving particles, the quantum algorithm presented here moves probabilities, which interact via a unitary collision operator. Probabilities are determined using ensemble measurement and are moved with classical communications channels. The lattice node spacing is defined to be a microscopic scale length. A mesoscopic governing equation for the lattice is derived for the most general three qubit collision operator which preserves particle number. In the continuum limit of the lattice, a governing macroscopic partial differential equation-the diffusion equation-is derived for a particular collision operator using a Chapman-Enskog expansion. A numerical simulation of the algorithm is carried out on a conventional desktop computer and compared to the analytic solution of the diffusion equation. The simulation agrees very well with the known solution.

•Oct 3, 2012•0 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 the 1-dimensional linear Lattice Boltzmann Method

Mohammed Bediche, Matthijs van Waveren, Denis Ricot +1 more

A fully quantum algorithm for solving the one-dimensional linear advection-diffusion equation using the Lattice Boltzmann method as a numerical procedure is presented in this work. We start by presenting a state of the art of the current usage of quantum algorithms for solving ordinary and partial differential equations. We then describe two algorithms for the one-dimensional Lattice Boltzmann method with two degrees of freedom. The first one is an existing hybrid quantum-classical algorithm with measurements at each time step, and the second one is our improved version, viz. a fully quantum algorithm where only one measurement is needed at the end of the algorithm. The fully quantum algorithm is first executed on a quantum simulator and then compared with a classical approach. Subsequently, the fully quantum algorithm is run on a quantum system with 133 qubits to investigate the effect of noise and the depth of the circuit on the output state. We find fluctuations in the final result due to the decoherence noise of the qubits.

quant-pharXiv:2606.16514•Communications in computer and information science•Jun 16, 2026•0 citations

A quantum algorithm for the lattice-Boltzmann method advection-diffusion equation

David M. Wawrzyniak, Josef M. Winter, Steffen J. Schmidt +4 more

We present a versatile and efficient quantum algorithm based on the Lattice Boltzmann method (LBM) approximate solution of the linear advection-diffusion equation (ADE). We emphasize that the LBM approximation modifies the diffusion term of the underlying exact ADE and leads to a modified equation (mADE). Due to its versatility in terms of operator splitting, the proposed quantum LBM algorithm for the mADE provides a building block for future quantum algorithms to solve the linearized Navier-Stokes equation on quantum computers. We split the algorithm into four operations: initialization, collision, streaming, and calculation of the macroscopic quantities. We propose general quantum building blocks for each operator, which adapt intrinsically from the general three-dimensional case to smaller dimensions and apply to arbitrary lattice-velocity sets. Based on (sub-linear) amplitude data encoding, we propose improved initialization and collision operations with reduced complexity and efficient sampling-based simulation. Quantum streaming algorithms are based on previous developments. The proposed quantum algorithm allows for the computation of successive time steps, requiring full state measurement and reinitialization after every time step. It is validated by comparison with a digital implementation and based on analytical solutions in one and two dimensions. Furthermore, we demonstrate the versatility of the quantum algorithm for two cases with non-uniform advection velocities in two and three dimensions. Various velocity sets are considered to further highlight the flexibility of the algorithm. We benchmark our optimized quantum algorithm against previous methods employed in sampling-based quantum simulators. We demonstrate sampling efficiency, with sampling accelerated convergence requiring fewer shots. • Novel LBM quantum algorithm for solving the linear advection-diffusion equation with variable velocity as a building block. • Modular quantum algorithm for 1 through 3 spatial dimensions and all common lattice-velocity sets. • Significant reduction in quantum-algorithm complexity achieved through efficient encoding strategy leveraging symmetries. • Improved collision quantum-algorithm building block leading to higher success rates for the collision operator. • Benchmarking shows faster convergence and reduced shot requirements compared to previous algorithms.

Computer Physics Communications•Sep 10, 2024•38 citations

Quantum lattice gas representation for vector solitons

George Vahala, Linda L. Vahala, Jeffrey Yepez

Quantum lattice gas algorithms are developed for the coupled-nonlinear Schrodinger (coupled-NLS) equations, equations that describe the propagation of pulses in birefringent fibers. When the cross-phase modulation factor is unity, the coupled-NLS reduce to the Manakov equations. The quantum lattice gas algorithm yields vector solitons for the fully integrable Manakov system that are in excellent agreement with exact results. Simulations are also presented for the interaction between a turbulent 2-soliton mode and a simple NLS 2-soliton mode. The quantum algorithm requires 4 qubits for each spatial node, with quantum entanglement required only between pairs of qubits through a unitary collision operator. The coupling between the qubits is achieved through a local phase change in the absolute value of the paired qubit wave functions. On symmetrizing the unitary streaming operators, the resulting quantum algorithm, which is unconditionally stable, is accurate to O(ε2).

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 5, 2003•3 citations
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.
A lattice-gas algorithm for the one-dimensional diffusion equation is realized using radio frequency pulses in a one-dimensional spin system. The model is a large array of quantum two-qubit nodes interconnected by the nearest-neighbor classical communication channels. We present a quantum protocol for implementation of the quantum collision operator and a method for initialization and reinitialization of quantum states. Numerical simulations of the quantum-classical dynamics are in good agreement with the analytic solution for the diffusion equation.
An algorithm is presented to simulate fluid dynamics on a three qubit type II quantum computer: a lattice of small quantum computers that communicate classical information. The algorithm presented is called a three qubit factorized quantum lattice gas algorithm. It is modeled after classical lattice gas algorithms which move virtual particles along an imaginary lattice and change the particles' momentums using collision rules when they meet at a lattice node. Instead of moving particles, the quantum algorithm presented here moves probabilities, which interact via a unitary collision operator. Probabilities are determined using ensemble measurement and are moved with classical communications channels. The lattice node spacing is defined to be a microscopic scale length. A mesoscopic governing equation for the lattice is derived for the most general three qubit collision operator which preserves particle number. In the continuum limit of the lattice, a governing macroscopic partial differential equation-the diffusion equation-is derived for a particular collision operator using a Chapman-Enskog expansion. A numerical simulation of the algorithm is carried out on a conventional desktop computer and compared to the analytic solution of the diffusion equation. The simulation agrees very well with the known solution.
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.
A fully quantum algorithm for solving the one-dimensional linear advection-diffusion equation using the Lattice Boltzmann method as a numerical procedure is presented in this work. We start by presenting a state of the art of the current usage of quantum algorithms for solving ordinary and partial differential equations. We then describe two algorithms for the one-dimensional Lattice Boltzmann method with two degrees of freedom. The first one is an existing hybrid quantum-classical algorithm with measurements at each time step, and the second one is our improved version, viz. a fully quantum algorithm where only one measurement is needed at the end of the algorithm. The fully quantum algorithm is first executed on a quantum simulator and then compared with a classical approach. Subsequently, the fully quantum algorithm is run on a quantum system with 133 qubits to investigate the effect of noise and the depth of the circuit on the output state. We find fluctuations in the final result due to the decoherence noise of the qubits.
We present a versatile and efficient quantum algorithm based on the Lattice Boltzmann method (LBM) approximate solution of the linear advection-diffusion equation (ADE). We emphasize that the LBM approximation modifies the diffusion term of the underlying exact ADE and leads to a modified equation (mADE). Due to its versatility in terms of operator splitting, the proposed quantum LBM algorithm for the mADE provides a building block for future quantum algorithms to solve the linearized Navier-Stokes equation on quantum computers. We split the algorithm into four operations: initialization, collision, streaming, and calculation of the macroscopic quantities. We propose general quantum building blocks for each operator, which adapt intrinsically from the general three-dimensional case to smaller dimensions and apply to arbitrary lattice-velocity sets. Based on (sub-linear) amplitude data encoding, we propose improved initialization and collision operations with reduced complexity and efficient sampling-based simulation. Quantum streaming algorithms are based on previous developments. The proposed quantum algorithm allows for the computation of successive time steps, requiring full state measurement and reinitialization after every time step. It is validated by comparison with a digital implementation and based on analytical solutions in one and two dimensions. Furthermore, we demonstrate the versatility of the quantum algorithm for two cases with non-uniform advection velocities in two and three dimensions. Various velocity sets are considered to further highlight the flexibility of the algorithm. We benchmark our optimized quantum algorithm against previous methods employed in sampling-based quantum simulators. We demonstrate sampling efficiency, with sampling accelerated convergence requiring fewer shots. • Novel LBM quantum algorithm for solving the linear advection-diffusion equation with variable velocity as a building block. • Modular quantum algorithm for 1 through 3 spatial dimensions and all common lattice-velocity sets. • Significant reduction in quantum-algorithm complexity achieved through efficient encoding strategy leveraging symmetries. • Improved collision quantum-algorithm building block leading to higher success rates for the collision operator. • Benchmarking shows faster convergence and reduced shot requirements compared to previous algorithms.
Quantum lattice gas algorithms are developed for the coupled-nonlinear Schrodinger (coupled-NLS) equations, equations that describe the propagation of pulses in birefringent fibers. When the cross-phase modulation factor is unity, the coupled-NLS reduce to the Manakov equations. The quantum lattice gas algorithm yields vector solitons for the fully integrable Manakov system that are in excellent agreement with exact results. Simulations are also presented for the interaction between a turbulent 2-soliton mode and a simple NLS 2-soliton mode. The quantum algorithm requires 4 qubits for each spatial node, with quantum entanglement required only between pairs of qubits through a unitary collision operator. The coupling between the qubits is achieved through a local phase change in the absolute value of the paired qubit wave functions. On symmetrizing the unitary streaming operators, the resulting quantum algorithm, which is unconditionally stable, is accurate to O(ε2).