The Lindblad equation is a widely used quantum master equation to model the dynamical evolution of open quantum systems whose states are described by density matrices. This equation is also a fundamental building block to design optimal control functions. In this paper we develop full- and low-rank exponential midpoint integrators for solving both the forward and adjoint Lindblad equations. These schemes are applicable to optimize-then-discretize approaches for optimal control of open quantum systems. We show that the proposed schemes preserve positivity and trace unconditionally. Furthermore, convergence of these numerical schemes is proved theoretically and verified numerically.
Optimal control of open quantum systems governed by the Lindblad master equation requires the repeated solution of forward and adjoint evolution equations. For large Hilbert spaces, these computations demand numerical methods that are structure-preserving, accurate, and computationally efficient, while remaining compatible with nonsmooth optimization techniques. In this work, a unified framework for optimal control of Lindblad equations is presented. The continuous optimality system is derived from the Pontryagin maximum principle and solved by a sequential quadratic Hamiltonian (SQH) method. Its numerical realization is based on second-order exponential midpoint propagators for the forward and adjoint Lindblad equations with time-dependent Hamiltonians. Full-rank schemes preserving the Hermitian and positive-semidefinite structure of the density matrix are developed together with low-rank formulations that substantially reduce storage requirements and computational cost. Rigorous error estimates are established for the full- and low-rank forward and adjoint propagators. Numerical experiments confirm the predicted convergence rates, demonstrate the effectiveness of the low-rank approximations, and illustrate the performance of the proposed FREM-SQH and LREM-SQH algorithms for optimal control problems with smooth and nonsmooth control costs.
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.
The Lindblad master equation is a valuable tool in quantum mechanics, which describes the dynamics of open systems. In the scope of our research, it is combined with the one-dimensional Maxwell's equations to form the generalized Maxwell-Bloch equations. Since analytical solutions are not available in the general case, numerical methods have to be employed to solve the Lindblad equation. In this work, we focus on methods that are completely positive trace preserving (CPTP), i.e., that guarantee to preserve the properties of the density matrix. We review existing approaches and compare the most promising candidates in terms of computational performance.
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
1019 degrees of freedom using only modest compute resources.
Markovian open quantum systems are well modeled by the Lindblad Master Equation (ME)
dtdρt=Lρt, where
L is a linear (super-)operator and
ρt is the system state, a positive matrix. When designing or characterizing a quantum system, one is usually interested in the steady state
ρ∞ (such that
Lρ∞=0), the first few excited states, and trajectories
t↦ρt. In finite dimension,
ρt is an
n×n matrix,
L thus typically costs
n4 to store explicitly as a dense matrix, and
O(n6) to diagonalize or invert exactly, making standard linear algebraic techniques expensive for large systems. However,
L usually costs only
O(n3) 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
S, can be inverted efficiently. Using this inverse map, we introduce an auxiliary completely positive trace-preserving (CPTP) map
Φ whose fixed point is directly related to
ρ∞, all the other eigenvalues having smaller magnitude. The map
Φ is thus well suited to iterative methods, and
ρ∞ can be found in a few Arnoldi iterations. Using the same inverse map
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(n3) per iteration and offer state-of-the-art performance on CPU and GPU.