TY - JOUR
T1 - Decomposition of nonlinear collision operator in quantum Lattice Boltzmann algorithm
AU - Kumar, E. Dinesh
AU - Frankel, Steven H.
N1 - Publisher Copyright:
Copyright © 2024 The author(s)
PY - 2024/11/1
Y1 - 2024/11/1
N2 - We propose a quantum algorithm to tackle the quadratic nonlinearity in the Lattice Boltzmann (LB) collision operator. The key idea is to build the quantum gates based on the particle distribution functions (PDF) within the coherence time for qubits. Thus, both the operator and a state vector are linear functions of PDFs, and upon quantum state evolution, the resulting PDFs will have quadraticity. To this end, we decompose the collision operator for a DmQn lattice model into a product of operators, where n is the number of lattice velocity directions. After decomposition, the operators with constant entries remain unchanged throughout the simulation, whereas the remaining will be built based on the statevector of the previous time step. Also, we show that such a decomposition is not unique. Compared to the second-order Carleman-linearized LB, the present approach reduces the circuit width by half and circuit depth by exponential order. The proposed algorithm has been verified through the one-dimensional flow discontinuity and two-dimensional Kolmogrov-like flow test cases.
AB - We propose a quantum algorithm to tackle the quadratic nonlinearity in the Lattice Boltzmann (LB) collision operator. The key idea is to build the quantum gates based on the particle distribution functions (PDF) within the coherence time for qubits. Thus, both the operator and a state vector are linear functions of PDFs, and upon quantum state evolution, the resulting PDFs will have quadraticity. To this end, we decompose the collision operator for a DmQn lattice model into a product of operators, where n is the number of lattice velocity directions. After decomposition, the operators with constant entries remain unchanged throughout the simulation, whereas the remaining will be built based on the statevector of the previous time step. Also, we show that such a decomposition is not unique. Compared to the second-order Carleman-linearized LB, the present approach reduces the circuit width by half and circuit depth by exponential order. The proposed algorithm has been verified through the one-dimensional flow discontinuity and two-dimensional Kolmogrov-like flow test cases.
UR - http://www.scopus.com/inward/record.url?scp=85209763270&partnerID=8YFLogxK
U2 - 10.1209/0295-5075/ad8bef
DO - 10.1209/0295-5075/ad8bef
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85209763270
SN - 0295-5075
VL - 148
JO - EPL
JF - EPL
IS - 3
M1 - 38003
ER -