A hybrid quantum-classical lattice kinetic scheme with tensor-train feedback for incompressible flows

Nonlinear lattice kinetic simulation requires each updated distribution to supply the velocity and gradients that determine the next step. In a quantum-classical solver, reading out the full distribution incurs work proportional to the lattice size. We construct a tensor-train (TT) interface that retains reusable classical cores at the physical amplitude scale for a full-relaxation lattice kinetic scheme. The cores supply nonlinear coefficients and prepare each quantum input. Energy-scaled propagation and coordinate recovery encode the updated distribution, and alternating least-squares reconstruction converts signed Hadamard-test overlaps into output cores by restoring a known normalization factor. The next step starts from accepted cores without replaying previous quantum evolution. Under positive, unit-sum reference coefficients, positive lower and finite upper density bounds, and Lipschitz equilibrium sensitivity, perturbation bounds relate local defects to feedback errors. Resource bounds account for classical operations, circuit execution, sampling, and verification. Classical diagnostics expose why distribution accuracy alone is insufficient: in 80-step feedback on a $16\times16$ grid, rank cap 4 nearly eliminates the vortex despite a final distribution error below $1\%$, whereas rank cap 12 gives relative velocity error $1.03\times10^{-3}$. Four-step binomial readout simulations show that tightening core sampling tolerance threefold raises the prescribed sufficient budget from $5.97\times10^{12}$ to $5.37\times10^{13}$ shots as the result approaches the fixed-rank, fixed-sweep exact-overlap trajectory. The interface therefore provides a way to connect quantum propagation to nonlinear feedback and to assess the separate demands of compression, velocity accuracy, and readout precision.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-03
DOI
https://doi.org/10.48550/arxiv.2611.04500
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

A hybrid quantum-classical lattice kinetic scheme with tensor-train feedback for incompressible flows

Yongwei Guo, Yuting Zhou, Yuan Yu, Yue Yu
arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
preprint

A hybrid quantum-classical lattice kinetic scheme with tensor-train feedback for incompressible flows

Yongwei Guo, Yuting Zhou, Yuan Yu, Yue Yu
preprint en

Abstract

Nonlinear lattice kinetic simulation requires each updated distribution to supply the velocity and gradients that determine the next step. In a quantum-classical solver, reading out the full distribution incurs work proportional to the lattice size. We construct a tensor-train (TT) interface that retains reusable classical cores at the physical amplitude scale for a full-relaxation lattice kinetic scheme. The cores supply nonlinear coefficients and prepare each quantum input. Energy-scaled propagation and coordinate recovery encode the updated distribution, and alternating least-squares reconstruction converts signed Hadamard-test overlaps into output cores by restoring a known normalization factor. The next step starts from accepted cores without replaying previous quantum evolution. Under positive, unit-sum reference coefficients, positive lower and finite upper density bounds, and Lipschitz equilibrium sensitivity, perturbation bounds relate local defects to feedback errors. Resource bounds account for classical operations, circuit execution, sampling, and verification. Classical diagnostics expose why distribution accuracy alone is insufficient: in 80-step feedback on a $16\times16$ grid, rank cap 4 nearly eliminates the vortex despite a final distribution error below $1\%$, whereas rank cap 12 gives relative velocity error $1.03\times10^{-3}$. Four-step binomial readout simulations show that tightening core sampling tolerance threefold raises the prescribed sufficient budget from $5.97\times10^{12}$ to $5.37\times10^{13}$ shots as the result approaches the fixed-rank, fixed-sweep exact-overlap trajectory. The interface therefore provides a way to connect quantum propagation to nonlinear feedback and to assess the separate demands of compression, velocity accuracy, and readout precision.

arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon