Quantum Lattice Boltzmann Solutions for Transport under 3D Spatially Varying Advection on Trapped Ion Hardware
Abstract: The Quantum Lattice Boltzmann Method (QLBM) has emerged as one of the most promising quantum computing approaches for the numerical simulation of problems in computational fluid dynamics (CFD). The dynamics is formulated in terms of mesoscopic particle distribution functions governed by a discrete Boltzmann transport equation, comprising local streaming and collision operations. In this work, the resulting macroscopic behavior corresponds to the advection-diffusion equation, which we adopt as a canonical model problem for transport phenomena. Building upon recent progress in QLBM implementations, we advance towards more realistic problem settings that better reflect conventional CFD requirements. We address, for the first time, transport under the action of non uniform velocity fields on quantum hardware. We implement our demonstration using IonQ's trapped-ion systems including Forte generation systems and a 64-qubit Barium development system similar to the forthcoming IonQ Tempo line. We identify the density readout and subsequent reloading of the fluid density as a potential bottleneck of the current algorithm and discuss several approaches to mitigate this bottleneck. We identify the use of MPS shadow tomography as a promising method to efficiently scale the readout to large system with complex density distributions. Lastly, we introduce and simulate a novel method to implement wall boundaries for advection-diffusion in QLBM, and discuss the prospects of scaling to higher-complexity problems.
Paper Prompts
Sign up for free to create and run prompts on this paper.
Top Community Prompts
Explain it Like I'm 14
Easy-to-Understand Summary of the Paper
What is this paper about?
This paper shows how to use a real quantum computer to simulate how something spreads and moves in 3D space—think of a drop of dye swirling and spreading out in water. The authors use a quantum version of a popular fluids method called the Lattice Boltzmann Method (LBM). Their quantum version is called QLBM. They run it on trapped‑ion quantum computers (from IonQ) and make it work even when the “wind” (the velocity) changes from place to place, which is closer to how real-world flows behave.
What questions are the researchers trying to answer?
In simple terms, they ask:
- Can a current quantum computer simulate 3D spreading and swirling (advection–diffusion) when the “wind” varies in space?
- Can we read the result out of the quantum computer efficiently and then load it back in to keep going for many time steps?
- Can we scale this to larger 3D grids without needing an impossible number of measurements?
- How do we handle realistic extras, like walls that block flow?
What did they do, in plain language?
The idea behind the method
- Imagine a big 3D grid (like a Minecraft world). At each little cube, you store how much “stuff” (like dye) is there.
- In each time step, the stuff moves (that’s advection, like being carried by wind) and spreads (that’s diffusion, like dye slowly mixing into water).
- LBM models this as two local actions:
- Streaming: densities slide to neighboring grid spots along certain directions.
- Collision: densities at a spot are blended to keep things balanced.
QLBM encodes this whole process on a quantum computer:
- A “grid register” stores where you are in the 3D grid.
- A “direction register” stores which direction you’re moving in.
- Special quantum circuits perform the streaming and collision steps.
Think of it like telling many tiny “packets” of dye where to go and how to mix using quantum instructions.
The hardware
They used trapped‑ion quantum computers (IonQ Forte and a 64‑qubit Barium system similar to IonQ Tempo). In these machines, single atoms are held in place with electric fields and controlled by lasers. The atoms act as qubits—the basic units of a quantum computer.
The big challenge: reading results
Quantum computers are hard to “read.” Measuring the full state exactly would take too many measurements (shots), especially for big 3D grids. Also, their algorithm needs to measure the state and then reload it multiple times, which is slow and can be noisy.
To handle that, they combine three ideas:
- Kernel Density Estimation (KDE): Treat the measured data like a blurry picture and smooth out the noise so the overall shape is clearer.
- Matrix Product States (MPS): This is a clever way to compress the big 3D data into a smaller “recipe” that still captures the main features, so you can reload it efficiently.
- Shadow tomography with MPS (“MPS shadows”): Instead of always measuring in the same way, they measure in many random “angles” (rotated single‑qubit bases). It’s like taking photos of an object from different viewpoints and then reconstructing a better 3D model with fewer total photos.
They also:
- Built error checks (post-selection and a flag qubit) that throw away runs likely affected by certain errors, keeping the results cleaner.
- Showed how to program more general, position‑dependent “wind” fields efficiently.
- Proposed and simulated a new way to add “walls” that block the flow at boundaries.
What did they find?
Main results on the quantum hardware
- They simulated a 3D “swirl” flow on an 8×8×8 grid for six time steps on IonQ’s hardware.
- The match to the exact solution (fidelity) was high: above about 97% after one step, and still about 88% after six steps, even with circuits containing roughly 300 two‑qubit gates across 21 qubits.
- KDE and MPS smoothing together improved the final quality by about 2–4% compared to using raw measurements alone.
- Using MPS shadow tomography, they scaled to a 16×16×16 grid with similar accuracy using only 20,000 total shots spread across multiple random measurement bases—much fewer than a straightforward approach would need.
Why the results stayed accurate
- Their “one‑hot” direction encoding plus post-selection naturally filters out many common errors by sending bad events into a “garbage” space that is later discarded. This makes the method more noise‑resistant on today’s imperfect devices.
Reading the state better with fewer shots
- Directly building a full histogram of the 3D density (just counting outcomes) becomes very inefficient as grids get bigger—the data gets too sparse.
- MPS shadow tomography solved this: by measuring in many random single‑qubit bases and fitting a compact MPS model, they got more accurate reconstructions with far fewer total shots, and the advantage grew with problem size and over longer time evolutions.
- In tests (simulation and on IonQ hardware), the shadow‑MPS approach consistently beat the direct histogram approach, especially when shots were limited or when noise grew over time.
Extra capabilities
- Efficient non‑uniform “wind” (velocity) fields: They described how to implement general, divergence‑free velocity fields on the quantum circuit, and introduced a faster, approximate encoding technique to reduce classical precomputation cost when the field is smooth.
- Walls and boundaries: They introduced and simulated a new way to add “wall” boundaries (that block flow) to QLBM, making the setup closer to real engineering problems.
Why is this important?
This work is a step toward using quantum computers for real fluid simulations:
- It shows a full, working loop—prepare the state, run the physics, read results, reload, and continue—on actual quantum hardware for a nontrivial 3D, spatially varying flow.
- It tackles the biggest practical bottleneck today: how to read and reload large 3D states efficiently on noisy, near-term devices.
- The shadow‑MPS method is a key ingredient for scaling up because it gets more information from fewer measurements and filters noise by fitting a compact model.
- Adding boundaries and more complex flows moves the method closer to real computational fluid dynamics (CFD) problems used in industry.
In short, while this is not yet replacing classical CFD, it shows how quantum hardware plus smart compression and tomography can handle more realistic fluid transport tasks. As quantum devices improve and these techniques mature, this approach could help simulate larger, more complex flows faster or with fewer resources than before.
Knowledge Gaps
Below is a concise, actionable list of the paper’s unresolved knowledge gaps, limitations, and open questions that future work could address.
- Physics scope and model generality
- Extend beyond passive scalar advection–diffusion to full fluid dynamics (e.g., Navier–Stokes via LBM with nonlinear collisions), including validation of quantum implementations of nonlinearity (e.g., Carleman-linearized collisions) on hardware.
- Generalize from / to higher-fidelity stencils (e.g., , ) and quantify the trade-offs in isotropy, stability, resource overhead, and one-hot direction encoding cost.
- Support non-divergence-free and compressible velocity fields (with sources/sinks), and quantify how PREP/UNPREP constructions and angle maps must change; establish safe domains and fallback strategies when the arccos-sqrt parameterization becomes invalid.
- Incorporate and validate spatially varying diffusivity, reaction terms, and body forces (e.g., advection–diffusion–reaction), including error propagation from PREP/UNPREP encodings.
- Boundary conditions and geometry
- Move beyond grid-aligned, static wall boundaries to handle curved, moving, and complex geometries (e.g., staircased vs immersed-boundary analogues) and non-reflective/open boundaries (inflow/outflow), with quantified accuracy and cost on hardware.
- Demonstrate the proposed wall-boundary method on hardware and benchmark against classical LBM bounce-back and other standard treatments.
- Provide systematic error and stability analysis for boundary handling (mass conservation, positivity, and spurious flux across walls), especially under noise and post-selection.
- Readout, tomography, and state reloading
- Provide theoretical sample-complexity bounds and convergence guarantees for the proposed shadow-MPS tomography (pure-state MPS + Hellinger loss) under post-selection and hardware noise; characterize optimal number of settings and shots per setting .
- Develop adaptive measurement-setting design (beyond i.i.d. SU(2) rotations) that optimizes reconstruction for spatially smooth densities, and quantify gains relative to uniform random settings.
- Enforce and analyze physical constraints (non-negativity in computational basis, mass conservation, smoothness priors) directly in the MPS fit to reduce bias and noise leakage from rotated bases into the reconstructed density.
- Quantify and mitigate coherent vs incoherent noise contributions in reconstruction; benchmark against alternative models (e.g., autoregressive Born machines, neural TNs, MPO-based mixed-state fits, compressive sensing).
- Formalize error accumulation from iterative readout-reload, and optimize the cadence (number of QLBM steps per readout) given shot budgets, post-selection rates, and device noise.
- Provide a principled bandwidth-selection procedure for KDE (or replace KDE with a likelihood-based smoother), and quantify its bias–variance impact on physics metrics (L1/L2 error, mass, peak values).
- Entanglement and MPS compressibility
- Characterize when QLBM density states admit low-bond-dimension MPS under different 3D orderings; provide bounds or empirical scaling laws for bond dimension vs grid size, time, Peclet number, and flow complexity (e.g., shear layers, mixing, turbulence).
- Investigate “entanglement barriers” in realistic flows and verify that MPS readout/reload around high-entanglement windows preserves fidelity and physical observables.
- Explore structure-aware tensor networks for 3D grids (e.g., TTN/PEPS/merit-orderings) vs 1D MPS flattenings, and quantify resource–accuracy trade-offs.
- LCU/post-selection and error detection
- Reduce post-selection loss (currently only 10–15% of shots retained; ~65% discarded into the G subspace), e.g., via amplitude amplification, improved LCU decompositions, or error-detecting encodings that preserve acceptance probability.
- Model and predict the scaling of success probability with time steps, stencil size (e.g., ), and noise; determine the acceptance–fidelity frontier under different error-mitigation strategies.
- Analyze and optimize the flag-qubit gadget (detection coverage, leakage modes, overhead), and quantify residual undetected error channels (e.g., grid-qubit bit flips that survive).
- PREP/UNPREP for spatially varying velocities
- Deliver end-to-end resource estimates (gate counts, depth, T-gates, ancillas) for PREP/UNPREP with multi-controlled RBS gates on realistic 3D grids and larger stencils; benchmark against hardware constraints and compilation overheads.
- Validate the correctness and numerical stability of the / angle parameterizations (domain restrictions, sensitivity to velocity noise, floating-point error) and quantify induced errors in macroscopic fields.
- Provide robust handling when derivative estimates (used in interpolated FWHT/QPIXL inputs) are inaccurate or discontinuous (e.g., near walls, shocks, or stiff gradients).
- QPIXL and interpolated FWHT approximations
- Establish rigorous error bounds for the proposed interpolated FWHT/QPIXL pipeline in 3D (error vs coarsening factor , smoothness class of the field, and grid size ) and the resulting impact on the QLBM evolution.
- Demonstrate that the approximated QPIXL reduces total wall-clock and asymptotic complexity at system scales relevant to an advantage; integrate it into a full hardware loop and benchmark against exact FWHT-based pipelines.
- Develop adaptive/coarsened encodings that refine only where needed (e.g., near sharp gradients) and quantify the complexity–accuracy trade-off.
- Hardware scaling and resource forecasts
- Provide detailed scaling forecasts (qubits, depth, runtime, shot budgets) for larger grids (e.g., , ) and longer evolutions, including the cost of multiple measurement settings per step and the effect of post-selection attrition on throughput.
- Quantify overhead from per-setting single-qubit rotations for shadows on trapped-ion hardware (added depth, crosstalk, calibration drift) and the optimal batching/compilation strategy to minimize total runtime.
- Assess the limits of one-hot direction encoding as stencil size grows (e.g., needs 27 direction qubits) and explore alternative encodings that retain error-detection benefits with fewer qubits.
- Validation metrics and physical fidelity
- Go beyond quantum-state fidelity to report physically meaningful errors (e.g., L1/L2 norms vs exact PDE solution, total mass conservation, diffusion rate, anisotropy) and validate macroscopic parameter recovery (, effective advection velocities).
- Characterize how readout-reload approximations (KDE, MPS fit, shadows) bias macroscopic observables over time (e.g., cumulative mass drift, artificial smoothing, peak attenuation).
- Comparative baselines and advantage pathways
- Benchmark against optimized classical LBM/FD solvers (CPU/GPU) in accuracy and wall-clock time (including all tomography and post-selection overheads) and identify concrete regimes where a quantum/QLBM advantage is plausible.
- Develop fault-tolerant resource estimates for target PDE instances (stencils, grid sizes, time horizons) and identify minimal error-correction thresholds where end-to-end circuits (without frequent readout) become viable.
- Reusability and reproducibility
- Publicly release circuits, datasets, and reconstruction code (including hyperparameters like bond dimension, optimizer choices, KDE bandwidth) to enable independent replication and parameter-sensitivity studies.
- Provide ablation studies isolating the contributions of KDE, MPS smoothing, and shadow tomography to final accuracy and robustness on both simulators and hardware.
Practical Applications
Immediate Applications
The following items can be deployed or piloted now on current trapped‑ion systems and hybrid quantum–classical stacks, leveraging the paper’s demonstrated algorithms (3D QLBM for spatially varying advection–diffusion), MPS-based state preparation, KDE/MPS smoothing, and shadow‑MPS tomography.
- Quantum CFD micro-benchmarks and calibration workflows
- Sector: software, HPC, quantum hardware
- What: Use the 3D swirl advection–diffusion test with one‑hot direction encoding, LCU collision, and flag‑qubit error detection as a standardized benchmark to assess gate-depth robustness, post‑selection overheads, and device stability across time steps.
- Tools/products/workflows: “Quantum CFD Benchmark Suite” (circuits + analysis), device qualification metrics (post‑selection success by Hamming‑weight sector, fidelity vs steps), automated tuning of LCU and flag‑qubit gadgets, cross‑hardware comparisons.
- Assumptions/dependencies: Modest lattice sizes (e.g., 83–163) on currently available trapped‑ion QPUs; result quality sensitive to noise and post‑selection yield.
- Shot‑efficient readout for structured states via shadow‑MPS tomography
- Sector: software, quantum algorithms (beyond CFD)
- What: Apply the classical‑shadow‑driven MPS fitting with Hellinger loss to learn smooth, compressible probability distributions in other NISQ workloads (e.g., generative quantum models, ground‑state observables concentration, stochastic processes on qubits).
- Tools/products/workflows: “Shadow Measurement Planner” (selects random SU(2) settings, shot allocation), MPS learner integrated with QTensor/opt libraries, APIs to return a compact MPS instead of a full histogram.
- Assumptions/dependencies: Best for states that are real, non‑negative, and/or low‑entanglement in the computational basis; performance depends on measurement setting diversity and optimizer stability.
- Hybrid readout–reload loops for iterative PDE steps
- Sector: software, HPC
- What: Use KDE-assisted MPS fitting to reconstruct and reload the grid state each step, enabling deeper effective simulations under NISQ noise budgets (reduces overlong single‑circuit depth).
- Tools/products/workflows: “QLBM Readout Optimizer” (adaptive KDE bandwidth and MPS bond dimension per step), compilation of MPS to state‑prep circuits, hybrid controller that balances step batching vs post‑selection yield.
- Assumptions/dependencies: Smooth spatial densities and moderate time horizons (compound errors grow across steps); post‑selection yields (~10–20%) must be budgeted in runtime.
- Fast approximate Walsh–Hadamard preprocessing for smooth fields
- Sector: software, embedded/HPC pre-processing
- What: Use the interpolated FWHT (coarse‑to‑fine linear model) to accelerate generation of QPIXL input angles for smooth, divergence‑free velocity fields—also reusable in classical pipelines where approximate WHT suffices.
- Tools/products/workflows: “FWHT‑Lite” library with coarsening K, error–performance knobs; drop‑in module for QPIXL‑style encodings; profiling tools to trade accuracy vs latency.
- Assumptions/dependencies: Velocity fields must be smooth; approximation quality set by coarsening (K) and grid size; not suitable for sharply varying or discontinuous fields.
- Prototype quantum boundary‑condition circuits for advection–diffusion
- Sector: software, microfluidics R&D
- What: Use the paper’s boundary implementation approach (walls aligned to the lattice) to prototype advection–diffusion in simple channels and cavity problems on small grids.
- Tools/products/workflows: Boundary circuit templates for D2Q5/D3Q7, test harnesses for wall reflections and no‑penetration enforcement, comparison harness vs classical LBM solvers for verification.
- Assumptions/dependencies: Walls aligned with the grid; early‑stage fidelity depends on noise and step batching; still research‑grade for complex geometries.
- Device noise diagnostics via sector-resolved post‑selection analytics
- Sector: quantum hardware, device characterization
- What: Exploit the one‑hot direction register and LCU structure to attribute errors (e.g., leakage into Hamming‑weight‑2 sectors mapped to orthogonal subspaces) and quantify bit‑flip vs grid‑register corruption.
- Tools/products/workflows: “Sector Yield Dashboard” (success fractions by sector over steps), alarm thresholds for drift, targeted calibration routines (e.g., ZZ‑gate recalibration when sector leakage rises).
- Assumptions/dependencies: Requires access to raw readout before post‑selection and flag filtering; interpretation depends on the specific encoding and circuit topology.
- Educational modules and hands‑on labs for quantum PDEs
- Sector: education
- What: Course labs guiding students through preparing MPS states, running QLBM swirl fields, applying KDE/MPS/shadow readout, and analyzing fidelity vs shots/steps.
- Tools/products/workflows: Jupyter notebooks, open circuits, datasets for 2D/3D advection–diffusion, visualization of 3D densities and errors.
- Assumptions/dependencies: Access to cloud QPUs/simulators; small problem sizes for classroom runtime.
- Early R&D prototypes for financial parabolic PDEs (diffusions with drift)
- Sector: finance
- What: Map Black–Scholes–type PDEs (with spatially varying drift/diffusion and simple boundary/terminal conditions) to the demonstrated advection–diffusion QLBM pipeline for proof‑of‑concept pricing on reduced grids.
- Tools/products/workflows: PDE‑to‑QLBM translators (drift → velocity field, barriers → walls), MPS/Shadow readout to extract price surfaces, hybrid calibration loops for implied parameters.
- Assumptions/dependencies: Low asset dimension (1–2D), coarse lattices; accuracy limited by readout noise and boundary discretization; production‑grade usage requires scaling.
- Hybrid co‑simulation plug‑ins for classical CFD suites (pilot)
- Sector: software (CFD), industry
- What: Integrate a QPU‑in‑the‑loop module that advances a coarse subdomain or a transport kernel for limited steps, while the classical solver advances the full domain—useful for internal evaluation by EDA/CFD vendors.
- Tools/products/workflows: Synopsys/ANSYS plug‑ins, data exchange schema (densities, boundary values), orchestration for time‑step synchronization and post‑selection budgeting.
- Assumptions/dependencies: Constrained to coarse patches and short horizons; verification against classical solves required; overhead must be lower than insight/benchmarking value.
Long‑Term Applications
These rely on scaling QLBM and shadow‑MPS techniques to larger grids, longer evolutions, richer physics (nonlinear collision, multi‑phase, turbulence), and/or fault‑tolerant quantum hardware.
- Quantum‑accelerated industrial CFD at scale
- Sector: aerospace, automotive, process engineering, energy
- What: Large‑grid QLBM (streaming/logarithmic addressability + efficient spatially varying collisions) for full‑domain advection–diffusion and, eventually, Navier–Stokes via nonlinear collisions (e.g., Carleman‑linearized or measurement‑feedback loops).
- Tools/products/workflows: Fault‑tolerant QLBM solvers with low‑overhead readout (shadow‑MPS variants, problem‑tailored observables), adaptive meshing on encoded lattices, quantum preconditioners for multi‑physics.
- Assumptions/dependencies: Error‑corrected hardware; end‑to‑end speedups hinge on readout/reload overhead and state compressibility; robust boundary handling for arbitrary geometries.
- Quantum subgrid or closure models for LES/RANS
- Sector: aerospace, energy, climate modeling
- What: Use quantum circuits to evolve mesoscale transport or learned closure terms, integrating with classical large‑eddy/averaged solvers; update closures periodically via readout and reload.
- Tools/products/workflows: Hybrid QM–HPC pipelines with checkpointing, differentiable shadow‑MPS fitters for closure training, uncertainty quantification across quantum/classical interfaces.
- Assumptions/dependencies: Viability depends on whether subgrid statistics remain compressible/learnable; shot budgets and noise must not dominate training signals.
- Environmental dispersion and urban air‑quality digital twins
- Sector: climate, public policy, civil engineering
- What: City‑scale pollutant transport with spatially varying advection fields and complex boundaries; near real‑time forecasting or large‑ensemble scenario analysis.
- Tools/products/workflows: Quantum back‑ends to accelerate ensemble propagation; shadow‑based readout of key observables (plume mass, hotspots) instead of full fields; integration with sensor networks.
- Assumptions/dependencies: Large spatial scales and long horizons need fault tolerance; must demonstrate advantage over GPU ensembles; accurate boundary/terrain encoding beyond axis‑aligned walls.
- Porous media and subsurface transport (CO2 sequestration, water resources)
- Sector: energy, environmental engineering
- What: Multi‑scale advection–diffusion in heterogeneous media, with flow fields obtained from Darcy/poroelastic models; quantum‑accelerated uncertainty propagation across geological scenarios.
- Tools/products/workflows: Quantum–classical co‑simulation (flow from classical solver, transport advanced on QPU), MPS readout of moment fields, scenario screening with shadow‑based statistics.
- Assumptions/dependencies: Heterogeneity may reduce MPS compressibility; coupling to reactive transport adds nonlinearity; regulatory acceptance needs validated accuracy.
- Microfluidics and biomedical transport design
- Sector: healthcare, biotech
- What: Optimize mixing, dosing, and particle/solute transport in lab‑on‑chip devices under complex, spatially varying flows and boundary interactions.
- Tools/products/workflows: Quantum design loops that evaluate many chips’ transport performance in parallel (ensemble acceleration), wall/boundary circuit libraries for device features, gradient‑free optimization guided by shadow readouts.
- Assumptions/dependencies: Requires richer boundary models (curved/oblique walls, slip conditions); scaling beyond proof‑of‑concept grids; verification against experiments.
- Battery, fuel cell, and materials diffusion modeling
- Sector: energy, materials science
- What: Accelerate multi‑species diffusion in complex morphologies (porous electrodes, membranes), coupling to advection in channels; explore design spaces with high parametric dimensionality.
- Tools/products/workflows: Problem‑specific encodings for multi‑species densities; observable‑focused shadow tomography (fluxes, gradients) to avoid full‑field readout.
- Assumptions/dependencies: Multi‑species and sharp fronts increase entanglement; may demand tailored encodings and error correction.
- Financial PDEs at higher dimension (multi‑asset derivatives)
- Sector: finance
- What: High‑dimensional advection–diffusion with barriers/rebates mapped to complex boundary conditions; large‑scale pricing and risk under stochastic volatility and local drift/diffusion.
- Tools/products/workflows: Quantum PDE engines with boundary libraries, shadow‑based extraction of prices/Greeks, integration with risk systems for scenario sweeps.
- Assumptions/dependencies: Curse of dimensionality vs MPS compressibility; rigorous error control and regulatory validation; data privacy/compliance for production.
- Robotics and autonomous systems: flow‑aware planning
- Sector: robotics, maritime, UAV
- What: Use fast quantum transport solvers to build flow‑aware cost fields for navigation and station keeping in highly variable environments (wind, currents).
- Tools/products/workflows: Hybrid planners that query quantum‑generated transport maps or Green’s functions; on‑demand updates via shadow‑MPS observables (e.g., travel‑time distributions).
- Assumptions/dependencies: Edge deployment unlikely; cloud latency and data assimilation constraints; advantage only if large scenario sets or high‑fidelity flows needed.
- Standardization and policy for quantum simulation benchmarks
- Sector: policy, standards bodies, procurement
- What: Establish advection–diffusion with spatially varying fields and boundary suites as canonical quantum simulation benchmarks, with reference data and reporting standards (fidelity, shot efficiency, post‑selection yields).
- Tools/products/workflows: Benchmark repositories, procurement criteria for quantum services, reproducibility protocols using shadow‑MPS metrics.
- Assumptions/dependencies: Community consensus; evolving metrics with hardware generations; careful separation of algorithmic vs device improvements.
Cross‑cutting assumptions and dependencies
- MPS compressibility: Many proposed uses assume that the evolving density remains well‑approximated by low‑bond‑dimension MPS (smooth fields, limited sharp fronts). Turbulence, shocks, or multi‑species interfaces may violate this, requiring alternative models or error‑corrected hardware.
- Readout overheads: The feasibility of frequent readout/reload loops depends on post‑selection yield, shot budgets, and the advantages of shadow‑based observables. End‑to‑end speedups require readout to scale sublinearly with grid size.
- Velocity field constraints: Implementations assume divergence‑free fields and smoothness (for fast WHT and QPIXL approximations). Arbitrary, rapidly varying fields increase circuit depth and classical preprocessing.
- Boundary complexity: Current wall methods assume alignment with the lattice; real‑world geometries demand flexible encodings, which may increase gate counts and reduce robustness.
- Hardware maturity: Near‑term deployments are limited to small grids and short horizons. Many long‑term applications require error‑corrected systems or significantly lower‑noise NISQ devices.
- Verification and validation: Industrial adoption needs quantitative V&V against trusted classical solvers and, in regulated sectors (finance, healthcare, energy), compliance with domain standards.
Glossary
- Acousto-optic deflectors (AODs): Electro‑optical devices that steer laser beams via sound waves in a crystal, enabling precise ion addressing in trapped‑ion QPUs. "acousto-optic deflectors (AODs), which substantially reduce beam alignment errors by enabling precise, independent beam steering to individual ions"
- Advection–diffusion equation: A PDE describing transport combining flow-driven advection with diffusive spreading; a canonical model for scalar transport. "the advection–diffusion equation, which we adopt as a canonical model problem for transport phenomena."
- Ancilla qubits: Extra helper qubits used for error detection, control, or subroutines without encoding problem data. "An error detection gadget using ancilla qubits is also applied."
- Bhatnagar-Gross-Krook (BGK) approximation: A relaxation-time model for collisions in Boltzmann-type dynamics that drives distributions toward equilibrium. "under the Bhatnagar-Gross-Krook (BGK) approximation"
- Carleman-linearized collision operator: A linearized (via Carleman embedding) representation of nonlinear collision dynamics, typically yielding large dense operators. "without requiring a fully dense Carleman-linearized collision operator"
- Classical shadows: A randomized-measurement framework for efficiently learning properties or models of quantum states from few shots. "newly developed techniques based on classical shadows"
- Collision operator: The local update in LBM/QLBM that relaxes distributions toward equilibrium (potentially implemented via LCU on QC). "LCU-based collision operators"
- Computational fluid dynamics (CFD): The numerical study of fluid flows governed by PDEs such as Navier–Stokes and related transport equations. "computational fluid dynamics (CFD)"
- D2Q5: A 2D lattice Boltzmann stencil with 5 discrete velocity directions used to model transport on grids. "with D2Q5 and D3Q7 models"
- D3Q7: A 3D lattice Boltzmann stencil with 7 discrete velocity directions for volumetric transport simulations. "with D2Q5 and D3Q7 models"
- Direction register: A qubit register encoding discrete velocity directions (often one‑hot) used to control streaming operations. "the `direction' register (denoted D) with n qubits for DmQn."
- Divergence-free velocity field: A flow with zero divergence (incompressible), often assumed for passive scalar advection. "advection-diffusion under a divergence-free velocity field,"
- Entanglement barrier: A regime where intermediate states become highly entangled, making classical tensor-network simulation difficult. "in the presence of an entanglement barrier"
- Fast Walsh–Hadamard Transform (FWHT): An O(N log N) algorithm for the Walsh–Hadamard transform, widely used for Hadamard-basis coefficient computation. "Fast Walsh-Hadamard Transform (FWHT)"
- Fidelity (quantum state): Overlap-based accuracy metric between quantum states, F = |⟨ψ|φ⟩|². "fidelity relative to the exact density state, , exceeding ."
- Flag-qubit: A dedicated qubit used to detect or signal certain classes of errors or invalid paths for post-selection. "flag-qubit error detection."
- Hamming-weight: The number of 1s in a bitstring; used to segment subspaces in one-hot encodings. "H[1] denotes the set of Hamming-weight-1 bitstrings."
- Hellinger loss (function): A distance-based loss for probability distributions used to fit models from finite-shot histograms. "by minimizing the Hellinger loss function,"
- Kernel density estimation (KDE): A nonparametric method to smooth and estimate probability densities from samples. "Kernel density estimation (KDE), which is a standardized method of kernel smoothing for estimating probability density function from samples"
- Lattice Boltzmann Method (LBM): A mesoscopic PDE solver based on evolving discrete particle distributions on a lattice via collision and streaming. "the LBM yields local and highly structured update rules."
- Linear combination of unitaries (LCU): A technique that implements operators as weighted sums of unitaries, often requiring post-selection. "multiple LCU cycles in each circuit execution."
- Matrix product operator (MPO): A tensor-network representation of mixed states or operators generalizing MPS to density matrices/operators. "rather than a matrix product operator (MPO)."
- Matrix product state (MPS): A low‑rank tensor-network Ansatz that compactly represents many‑qubit states with limited entanglement. "matrix product states (MPS) offer an effective reconstruction and reload mechanism"
- MPS shadow tomography: Learning an MPS directly from randomized measurement data using classical‑shadow techniques. "We identify the use of MPS shadow tomography as a promising method to efficiently scale the readout to large system with complex density distributions."
- MPS smoothing: Fitting a low‑bond‑dimension MPS to noisy histograms to denoise and compress measurement data. "KDE and MPS smoothing used for readout post-processing."
- One-hot encoding: An encoding where exactly one qubit is 1 (others 0) to label discrete options, aiding error detectability. "one-hot encoding of the direction qubits introduced in Ref.~\cite{ionq-ansys-qlbm-2025}."
- Pauli measurements: Single‑qubit measurements in Pauli bases (X, Y, Z), often randomized for shadow tomography. "random single qubit Pauli measurements to train a tensor network model to learn the state"
- Post-selection: Discarding measurement outcomes that fail a condition (e.g., ancilla or flag check) to realize probabilistic subroutines. "vanishing post-selection success probabilities in the collision step."
- PREP operator: The state-preparation unitary that encodes collision weights into the direction register before streaming. "Apply PREP as defined in Eq. \eqref{eq:Up} to get"
- QPIXL method: A technique to implement position-dependent diagonal operations efficiently using structured transforms. "use the QPIXL method of Ref.~\cite{amankwah2022quantum} to get a tamer circuit,"
- Quantum Lattice Boltzmann Method (QLBM): A quantum algorithmic framework mirroring LBM to simulate transport dynamics on quantum hardware. "The Quantum Lattice Boltzmann Method (QLBM) has emerged as one of the most promising quantum computing approaches"
- Quantum processing unit (QPU): A quantum hardware device executing quantum circuits, analogous to a CPU for classical computation. "This is reflected in the QPU histograms:"
- RBS gate: A two‑qubit real beam‑splitter–like rotation used here to implement controlled mixing of direction modes. "using the so-called RBS gate defined in Ref.~\cite{johri2021nearest}"
- Shadow tomography: Tomographic approach leveraging randomized measurements to predict properties or reconstruct models of quantum states. "Shadow tomography provides an efficient framework for learning properties of quantum states from few randomized measurements."
- Streaming operator: The unitary that shifts grid amplitudes along discrete velocity directions conditioned on the direction register. "First we have the streaming operator"
- Surface linear Paul traps: Microfabricated ion traps using RF fields on surface electrodes to confine ion chains. "surface linear Paul traps."
- Trapped-ion hardware: Quantum computers using trapped atomic ions as qubits with laser-driven gates. "We implemented the QLBM algorithm on IonQ's trapped-ion hardware to simulate a three-dimensional swirl velocity field"
- Two-photon Raman transitions: Laser-driven processes coupling qubit states via virtual excited levels to implement gates. "Two-photon Raman transitions driven by 355 nm laser pulses for the Ytterbium systems and 532 nm laser pulses for the Barium system"
- UNPREP operator: The inverse preparation that uncomputes direction encoding to return amplitude to the grid (with post-selection). "Apply the UNPREP operator in Eq. \eqref{eq:Uq} to get"
- Walsh–Hadamard Transform (WHT): The transform mapping between computational and Hadamard bases; used in QPIXL angle preparation. "we must compute the Walsh-Hadamard Transform (WHT) of a flattened 3D field"
- ZZ gates: Ising‑type entangling interactions implementing e{-i θ Z⊗Z}, native to many trapped‑ion platforms. "entangling ZZ gates."