Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Simulation
Tensor Network Lattice Boltzmann Method for Data-Compressed Fluid Simulations
arXiv
Authors: Lukas Gross, Elie Mounzer, David M. Wawrzyniak, Josef M. Winter, Nikolaus A. Adams
Year
2025
Paper ID
16021
Status
Preprint
Abstract Read
~2 min
Abstract Words
170
Citations
N/A
Abstract
Resolving unsteady transport phenomena in geometrically complex domains is traditionally constrained by polynomial scaling of computational cost with spatial resolution. While methods based on tensor-network data representations or matrix-product states (MPS) data encodings have emerged as a technique to systematically reduce degrees of freedom, existing formulations do not extend to complex geometries and complex flow physics. Both capabilities are offered by lattice Boltzmann methods, for which we develop a generalized MPS formulation. This development marks a paradigm shift from classical methods that rely on explicit grid refinement for data reduction. Instead, our approach exploits non-local correlations in the MPS representation to systemically compress the global fluid state directly without modifying the underlying grid. We benchmark the proposed solver against classical LBM using three-dimensional flows through structured media and vascular geometries. The results confirm that the MPS formulation reproduces the reference solution with high fidelity while achieving compression ratios exceeding two orders of magnitude, positioning tensor networks or MPS encodings as a scalable paradigm for continuum mechanics on high-performance GPU hardware.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- Resolving unsteady transport phenomena in geometrically complex domains is traditionally constrained by polynomial scaling of computational cost with spatial resolution.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.