Completely Positive and Trace Preserving Schemes with Tensor Train Compression for the Lindblad Equation
Abstract
We propose a family of low-rank, completely positive and trace preserving schemes for the Lindblad equation, a common model for open quantum systems. Low-rank representation is employed at two levels: the density matrix is factorized into the product of tall-skinny matrices, and the columns of these matrices are further represented using the tensor train (TT) format, also know as matrix product states (MPS). This two-level low-rank format fits naturally into our existing Kraus is King scheme (arXiv:2409.08898v2 [math.NA]) for the Lindblad equation, whose underlying operations are arithmetic on the columns of the tall-skinny matrices. We show how these operations can be performed efficiently in the TT/MPS format, with particular emphasis on density matrix rank-truncation. We conclude with extensive numerical experiments demonstrating the convergence of this scheme and its efficiency in simulating systems with up to degrees of freedom using only modest compute resources.
Keywords
Cite
@article{arxiv.2605.01494,
title = {Completely Positive and Trace Preserving Schemes with Tensor Train Compression for the Lindblad Equation},
author = {Peter DelMastro and Daniel Appelö and Yingda Cheng},
journal= {arXiv preprint arXiv:2605.01494},
year = {2026}
}
Comments
33 pages, 9 figures