A quantum algorithm for meshless lattice Boltzmann method with unitary interpolation

Chi Zhang; Hefeng Wang; Hua Xiang

Home/Archive/arXiv

arXiv · 2610.14943

A quantum algorithm for meshless lattice Boltzmann method with unitary interpolation

Chi Zhang·Hefeng Wang·Hua Xiang

View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a mass-weighted meshless formulation for the shifted incompressible lattice Boltzmann method (LBM) whose streaming step is exactly unitary, combining with the Carleman embedding. In traditional meshless LBM, on a scattered node set the semi-Lagrangian streaming step is an interpolation, which is not unitary; a generic block encoding of this matrix therefore requires a normalization proportional to its sparsity and logarithmically many ancillas. To overcome the non-unitarity, we instead express the interpolation as the exponential exp(a Dx + b Dy) of mimetic derivative operators. Endowing each node with its Voronoi mass and applying a mass-weighted similarity transform renders these derivative operators skew-Hermitian by enforcing moment constraints together with low-wave number trigonometric differentiation conditions, so that the interpolation becomes exactly unitary. Such unitarization of interpolation leave the local collision step unchanged up to a rescaling of its quadratic term, where the same weights define the amplitude encoding of the distribution functions. For quasi-uniform node sets, the mass-weighting diagonal remains within a unit-order normalization that degrades only mildly as the Carleman truncation order grows, thereby mitigating the cost of block encoding. Numerical experiments on the Taylor Green vortex confirm that the method reproduces the full meshless LBM, with the velocity error decreasing as the Carleman order increases.

Explore related subjects

physics.comp-ph cs.NA math.NA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Chi Zhang, Hefeng Wang, Hua Xiang. 2026-10-10. A quantum algorithm for meshless lattice Boltzmann method with unitary interpolation. https://arxiv.org/abs/2610.14943

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A nonequilibrium-capturing unified gas-kinetic scheme I: discrete orthogonal basis construction and expansion on velocity space

Velocity space discretization is a primary source of computational cost in deterministic methods for multiscale gas flows. A fixed velocity grid often retains redundant kinetic degrees of freedom (DOFs), particularly under near equilibrium conditions. To address this issue, this work develops a nonequilibrium-capturing formulation based on the unified gas kinetic scheme (UGKS), in which the number of kinetic DOFs adapts locally to the degree of nonequilibrium. A discrete orthogonal basis is constructed for numerical implementation, and the velocity distribution function is decomposed into an analytical local equilibrium and a basis expanded nonequilibrium component. The retained, locally adapted DOFs are evolved directly, substantially lowering computational overhead while preserving the discrete conservation of mass, momentum, and energy, as well as accurately capturing nonequilibrium states. The formulation retains the core multiscale coupling of molecular transport and collision inherent to UGKS, providing explicit and implicit schemes for unsteady and steady flows, respectively. Numerical tests across a wide range of flow speeds and rarefaction regimes (from continuum to highly rarefied) demonstrate close agreement with benchmark solutions. For unsteady flows, the explicit scheme achieves speedups of 12.64 to 58.50 over the standard UGKS. In steady state tests, only about $2\%$ of the original kinetic DOFs are required in continuum regions, accelerating each implicit iteration by a factor of 33.87. Even in the most rarefied cases, the scheme captures nonequilibrium behavior using only about $27\%$ of the original DOFs.

physics.comp-ph↗

arXiv2026

GeONet: Geometry-Encoded Operator Network for Predicting Flow in Heterogeneous Porous Media

Rapid prediction of pressure-driven flow in microfluidic porous media is important for experimental design, tracer-test interpretation, and digital-twin development for subsurface energy and critical mineral applications. High-fidelity simulations resolve geometry-controlled flow but are computationally expensive across large geometry ensembles. Here, we introduce GeONet, a Geometry-Encoded Operator Network that predicts steady-state pressure fields by jointly representing material properties, spatial coordinates, and solid--void geometry. GeONet extends the Branch--Trunk architecture with a dedicated Leaf Network encoding the binary domain mask through multiscale features. The Branch Network represents porosity and permeability, the Trunk Network combines coordinates with local geometric descriptors and random Fourier features, and a gated DeepMixer integrates these representations to predict pressure. GeONet was trained and evaluated using 5,000 PFLOTRAN simulations of heterogeneous Reduced Complexity Platform domains, comprising nearly 30 TB of data. Comparisons with pore-scale Stokes solutions across three geometries yielded Pearson correlations of 0.987--0.991 and $R^2$ values of 0.974--0.982, supporting PFLOTRAN as reference data. Under matched partitions and two-stage hyperparameter optimization, GeONet substantially outperformed a boundary-condition-aware DeepONet baseline. Across three held-out domains, GeONet achieved NRMSE of 0.0381--0.0500, MAPE of 1.76--2.59%, and $R^2$ of 0.9673--0.9822, versus 0.1483--0.2040, 7.81--10.45%, and 0.5658--0.7126 for DeepONet, respectively. On three additional unseen geometries, GeONet achieved NRMSE of 0.0448--0.0676 and $R^2$ of 0.9511--0.9770. These results demonstrate improved accuracy, pressure-range preservation, and cross-geometry generalization through explicit geometry encoding.

physics.comp-ph↗

arXiv2026

Online reduced-order modeling from primal solver trajectories for PDE-constrained optimization

Repeated high-fidelity state and gradient evaluations make large-scale PDE-constrained optimization computationally expensive. Reduced-order modeling provides a natural way to reduce the cost of these repeated high-dimensional computations. However, existing reduced-order modeling approaches often rely on converged high-fidelity states for model construction or updating, while their reduced spaces may lose accuracy as the design moves beyond the region represented by the available data. To address these limitations, we present Reduced-order Trajectory-based Optimization (RETO), an online framework that constructs local reduced-order models (ROMs) directly from unconverged primal solver trajectories. Each local ROM is built from snapshots collected during a finite number of high-fidelity primal iterations, without requiring full-order convergence, and supports multiple low-cost state evaluations, adjoint-based gradient evaluations, and design updates. New solver trajectories are generated at updated design points to reconstruct the local ROM and continue the optimization. Across three distinct PDE-constrained optimization problems, RETO achieves solution quality comparable to that of full-order optimization, with speedups of approximately 8 to 22 times in cases without discontinuities in the state fields. Even in the transonic inverse-design case involving moving shocks, RETO retains an approximately threefold speedup. The transonic results further show that the online local ROM progressively captures evolving shock-related flow features as new primal solver trajectories are incorporated. These results demonstrate the value of unconverged primal solver trajectories as an online information source for reduced-order optimization, allowing the reduced basis to evolve with the design rather than requiring a basis that covers the entire design space in advance.

physics.comp-ph↗