Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2409.08898 · Journal of Computational Physics

Kraus is king: High-order completely positive and trace preserving (CPTP) low rank method for the Lindblad master equation

Daniel Appelö, Yingda Cheng

Published Apr 28, 2025• 9 citations
arXivHTMLPDF
DOI
10.1016/j.jcp.2025.114036

Related papers

Arbitrary High Order Low-rank Completely Positive and Trace Preserving (CPTP) Schemes for Lindblad Equations with Time-dependent Hamiltonian

Jiuhua Hu, Daniel Appelo, Yingda Cheng

In this paper, we develop a framework for designing arbitrary high order low-rank schemes for the Lindblad equation with time-dependent Hamiltonians. Our approach is based on nested Picard iterative integrators (NPI) and results in schemes in Kraus form that are completely positive and trace preserving (CPTP). The schemes are amenable to low rank formulations, making them suitable for problems where the matrix rank of the density matrix is small.

math.NACross-listedarXiv:2511.12012•Journal of Computational Physics•Nov 18, 2025•4 citations

The Matrix Perturbation Method for the Lindblad Master Equation

Francisco Soto, Braulio Misael Villegas-Martínez, H. M. Moya-Cessa

Springer eBooks•Jan 1, 2023•0 citations

Completely Positive and Trace Preserving Schemes with Tensor Train Compression for the Lindblad Equation

Peter DelMastro, Daniel Appelö, Yingda Cheng

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 $10^{19}$ degrees of freedom using only modest compute resources.

math.NACross-listedarXiv:2605.01494•May 5, 2026•3 citations

Gregory Nested Picard Iteration Schemes for Open Quantum Systems Governed by the Lindblad Equation

Jiuhua Hu, Daniel Appelo, Yingda Cheng

Numerical simulation of quantum computing hardware and open quantum systems governed by the Lindblad equation is challenging due to the high dimensionality of the density matrix and the need to preserve fundamental physical properties. In our previous work, we developed an arbitrary-order, low-rank, completely positive and trace preserving (CPTP) method for the Lindblad equation with time-dependent Hamiltonians by nested Picard iteration (NPI). In this work, we develop Gregory NPI schemes, which are CPTP schemes constructed by Gregory-type quadrature on equispaced nodes. The methods, which are of order up to nine, substantially reduce the computational cost compared to our previously proposed NPI schemes with Gaussian quadrature rules, while retaining high-order accuracy and structure preservation. We analyze the stability of the resulting scheme for a physics-based test equation. Numerical experiments verify the convergence of the method and demonstrate the effectiveness of the low-rank approximation. We study the performance of a previously constructed CNOT gate for both closed and open quantum systems.

math.NACross-listedarXiv:2606.29002•Jun 30, 2026•0 citations

Scattering Theory for Lindblad Master Equations

Marco Falconi, Jérémy Faupin, Jürg Martin Fröhlich +1 more

arXiv:1602.04045•Communications in Mathematical Physics•Aug 30, 2016•18 citations

Staying completely positive: going beyond Lindblad with perturbative master equations

Robert S. Whitney

•Nov 1, 2007•0 citations
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 101910^{19}1019 degrees of freedom using only modest compute resources.
Numerical simulation of quantum computing hardware and open quantum systems governed by the Lindblad equation is challenging due to the high dimensionality of the density matrix and the need to preserve fundamental physical properties. In our previous work, we developed an arbitrary-order, low-rank, completely positive and trace preserving (CPTP) method for the Lindblad equation with time-dependent Hamiltonians by nested Picard iteration (NPI). In this work, we develop Gregory NPI schemes, which are CPTP schemes constructed by Gregory-type quadrature on equispaced nodes. The methods, which are of order up to nine, substantially reduce the computational cost compared to our previously proposed NPI schemes with Gaussian quadrature rules, while retaining high-order accuracy and structure preservation. We analyze the stability of the resulting scheme for a physics-based test equation. Numerical experiments verify the convergence of the method and demonstrate the effectiveness of the low-rank approximation. We study the performance of a previously constructed CNOT gate for both closed and open quantum systems.