Well-conditioned iterative methods for large open quantum systems

arXiv:2608.30860v1 Announce Type: new Abstract: Markovian open quantum systems are well modeled by the Lindblad Master Equation (ME) $\frac{\mathrm{d}}{\mathrm{d} t} \rho_t = \mathcal{L} \rho_t$, where $\mathcal{L}$ is a linear (super-)operator and $\rho_t$ is the system state, a positive matrix. When designing or characterizing a quantum system, one is usually interested in the steady state $\rho_\infty$ (such that $\mathcal{L} \rho_\infty = 0$), the first few excited states, and trajectories $t\mapsto \rho_t$. In finite dimension, $\rho_t$ is an $n\times n$ matrix, $\mathcal{L}$ thus typically costs $n^4$ to store explicitly as a dense matrix, and $O(n^6)$ to diagonalize or invert exactly, making standard linear algebraic techniques expensive for large systems. However, $\mathcal{L}$ usually costs only $O(n^3)$ to apply. This makes iterative methods appealing, but they do not work without a good preconditioner. In this article, our main observation is that a part of the Lindblad equation, corresponding to the so-called no-jump evolution $\mathcal{S}$, can be inverted efficiently. Using this inverse map, we introduce an auxiliary completely positive trace-preserving (CPTP) map $\Phi$ whose fixed point is directly related to $\rho_\infty$, all the other eigenvalues having smaller magnitude. The map $\Phi$ is thus well suited to iterative methods, and $\rho_\infty$ can be found in a few Arnoldi iterations. Using the same inverse map $\mathcal{S}^{-1}$ as preconditioner, we compute the low-lying spectrum efficiently via shift-invert Arnoldi, and, as a proof of concept, build an implicit time integrator that is competitive on stiff systems in the low-precision regime. For the steady-state and low excited states problems, our methods scale like $O(n^3)$ per iteration and offer state-of-the-art performance on CPU and GPU.

Abstract:Markovian open quantum systems are well modeled by the Lindblad Master Equation (ME) $\frac{\mathrm{d}}{\mathrm{d} t} \rho_t = \mathcal{L} \rho_t$, where $\mathcal{L}$ is a linear (super-)operator and $\rho_t$ is the system state, a positive matrix. When designing or characterizing a quantum system, one is usually interested in the steady state $\rho_\infty$ (such that $\mathcal{L} \rho_\infty = 0$), the first few excited states, and trajectories $t\mapsto \rho_t$. In finite dimension, $\rho_t$ is an $n\times n$ matrix, $\mathcal{L}$ thus typically costs $n^4$ to store explicitly as a dense matrix, and $O(n^6)$ to diagonalize or invert exactly, making standard linear algebraic techniques expensive for large systems. However, $\mathcal{L}$ usually costs only $O(n^3)$ to apply. This makes iterative methods appealing, but they do not work without a good preconditioner. In this article, our main observation is that a part of the Lindblad equation, corresponding to the so-called no-jump evolution $\mathcal{S}$, can be inverted efficiently. Using this inverse map, we introduce an auxiliary completely positive trace-preserving (CPTP) map $\Phi$ whose fixed point is directly related to $\rho_\infty$, all the other eigenvalues having smaller magnitude. The map $\Phi$ is thus well suited to iterative methods, and $\rho_\infty$ can be found in a few Arnoldi iterations. Using the same inverse map $\mathcal{S}^{-1}$ as preconditioner, we compute the low-lying spectrum efficiently via shift-invert Arnoldi, and, as a proof of concept, build an implicit time integrator that is competitive on stiff systems in the low-precision regime. For the steady-state and low excited states problems, our methods scale like $O(n^3)$ per iteration and offer state-of-the-art performance on CPU and GPU.

Quantum Physics (quant-ph); Numerical Analysis (math.NA)

arXiv:2608.30860 [quant-ph]

(or arXiv:2608.30860v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2608.30860 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

aiqbench analysis

Well-conditioned iterative methods for large open quantum systems

Related coverage