The proposed quantum LBM offers a clear scaling motivation. For a lattice with N nodes, the spatial domain is encoded in a logarithmic number of qubits, O(logN), while the velocity register has size determined only by the chosen lattice stencil. In standard LBM configurations this is a small constant: for example, D3Q27 requires 27 velocity qubits in the one-hot encoding. Thus, increasing the spatial resolution enlarges the spatial register logarithmically, rather than requiring one degree of freedom per grid point as in a direct classical representation.
The approach is not tied to a specific benchmark geometry or problem setting. It applies to advection-diffusion and hydrodynamic flow problems in one, two, and three spatial dimensions, provided an appropriate LBM lattice is chosen. From the circuit perspective, the collision cost scales quadratically with the number q of discrete velocities. Since q is fixed for standard lattices, this remains independent of the number of spatial nodes. The streaming step is implemented by controlled shifts on the spatial register, so its cost scales mainly with the number of spatial qubits, i.e., logarithmically in the number of lattice nodes for standard quantum adders.
A realistic route to scaling is a hybrid quantum-classical strategy. The accuracy of the denoising collision depends on the reference velocity, and this velocity may vary across space and time. Instead of choosing a single global reference, a classical solver could provide a coarse space-time-resolved velocity field at low spatial and temporal resolution. This reference field could then be interpolated and supplied to the quantum LBM simulation, while the quantum circuit evolves the high-resolution distribution state. This would use classical hardware for inexpensive macroscopic guidance and quantum hardware for the fine-scale lattice evolution. This makes the method a promising framework for scalable quantum CFD, although a full advantage claim still requires further work on dynamic reference selection and end-to-end resource estimates.