Quantum unitary matrix representation of the lattice Boltzmann model for low Reynolds fluid flow simulation

We propose a quantum algorithm for the lattice Boltzmann (LB) method to simulate fluid flows in the low Reynolds number regime. First, we encode the particle distribution functions (PDFs) as probability amplitudes of the quantum state and demonstrate the need to control the state of the ancilla qubit during the initial state preparation. Second, we express the LB algorithm as a matrix-vector product by neglecting the quadratic non-linearity in the equilibrium distribution function, wherein the vector represents the PDFs, and the matrix represents the collision and streaming operators. Third, we employ classical singular value decomposition to decompose the non-unitary collision and streaming operators into a product of unitary matrices. Finally, we show the importance of having a Hadamard gate between the collision and the streaming operations. Our approach has been tested on linear/linearized flow problems such as the advection-diffusion of a Gaussian hill, Poiseuille flow, Couette flow, and lid-driven cavity problems. We provide counts for two-qubit controlled-NOT and single-qubit U gates for test cases involving 9–12 qubits with grid sizes ranging from 24 to 216 points. While the gate count aligns closely with theoretical limits, the high number of two-qubit gates on the order of 107 necessitates careful attention to circuit synthesis.

Authors

Institutions

Publication Details

Journal
AVS Quantum Science
Published
2025-03-01
DOI
https://doi.org/10.1116/5.0245082
Citations
9
Primary Topic
Lattice Boltzmann Simulation Studies
Type
article
Field-Weighted Citation Impact
12.01
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum unitary matrix representation of the lattice Boltzmann model for low Reynolds fluid flow simulation

E. Dinesh Kumar, Steven H. Frankel
9 citations
AVS Quantum Science
Lattice Boltzmann Simulation Studies
12.01
article

Quantum unitary matrix representation of the lattice Boltzmann model for low Reynolds fluid flow simulation

E. Dinesh Kumar, Steven H. Frankel
article en
9 citations

Abstract

We propose a quantum algorithm for the lattice Boltzmann (LB) method to simulate fluid flows in the low Reynolds number regime. First, we encode the particle distribution functions (PDFs) as probability amplitudes of the quantum state and demonstrate the need to control the state of the ancilla qubit during the initial state preparation. Second, we express the LB algorithm as a matrix-vector product by neglecting the quadratic non-linearity in the equilibrium distribution function, wherein the vector represents the PDFs, and the matrix represents the collision and streaming operators. Third, we employ classical singular value decomposition to decompose the non-unitary collision and streaming operators into a product of unitary matrices. Finally, we show the importance of having a Hadamard gate between the collision and the streaming operations. Our approach has been tested on linear/linearized flow problems such as the advection-diffusion of a Gaussian hill, Poiseuille flow, Couette flow, and lid-driven cavity problems. We provide counts for two-qubit controlled-NOT and single-qubit U gates for test cases involving 9–12 qubits with grid sizes ranging from 24 to 216 points. While the gate count aligns closely with theoretical limits, the high number of two-qubit gates on the order of 107 necessitates careful attention to circuit synthesis.

AVS Quantum ScienceVol. 7(1)
Technion – Israel Institute of Technology (IL)
Openalex Percentile: Top 1%
Lattice Boltzmann Simulation Studies
12.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.