Deterministic Realization of Classical Dissipation on Quantum Computers

TL;DR

This paper introduces a novel, deterministic method for implementing classical dissipation in quantum computers, specifically for lattice Boltzmann models, avoiding probabilistic success decay.

Contribution

It provides a block-encoding-free construction for dissipative MRT relaxation, enabling exact classical dissipation simulation on quantum devices.

Findings

Audits match the target to machine precision

Success probability remains 1 for the dissipative MRT block

The method is applicable to long LBM collide-stream simulations

Abstract

Lattice Boltzmann (LB) on quantum devices must reconcile unitary gate evolution with the dissipative \emph{collision} step. In the multiple-relaxation-time (MRT) class, we work in the common setting of \emph{modewise diagonal} moment relaxation, $\delta m_r'=\lambda_r\,\delta m_r$ with $\lambda_r\in[-1,1]$ (overrelaxation if $\lambda_r<0$). Embedding that contraction in a unitary by block encoding or a linear combination of unitaries (LCU) typically yields subunitary success probability that decays multiplicatively across modes, sites, and time, a key bottleneck for quantum LB. \emph{For the dissipative MRT block alone} we give a \emph{block-encoding-free} construction: a signed \emph{two-rail} population encoding, then a completely positive trace-preserving (CPTP) map (per-rail amplitude damping with survival $|\lambda_r|$ and, if $\lambda_r<0$, a rail SWAP) so that, after the decode, the map agrees with classical MRT relaxation exactly (expectations of the rail number operators, common encoding--decode scale). Trace preservation gives success probability $1$ for that substage. The main result is the dissipative MRT block; construction of the equilibrium moment vector~$m^{\mathrm{eq}}=Mf^{\mathrm{eq}}$ (prescribed~$f^{\mathrm{eq}}$, host moment matrix~$M$; notation as in Section~\ref{subsec:generic-mrt}), moment transforms, streaming, and boundaries are composed with it as in a standard host pipeline and lie outside the scope of the formal theorem. Hybrid and fully coherent encodings, adaptive scales, Carleman-based context, and a one-rail no-go in the same nonnegative population framework are in the main text. Audits of the open-channel map on a long LBM collide-stream simulation and on stencil-free inputs both match the target to machine precision.