WorksMathematics
Full- and low-rank exponential Euler integrators for the Lindblad equation
Abstract
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. These solution matrices are characterized by semi-positiveness and trace preserving properties, which must be guaranteed in any physically meaningful numerical simulation. In this paper, novel full- and low-rank exponential Euler integrators are developed for approximating the Lindblad equation that preserve positivity and trace unconditionally. Theoretical results are presented that provide sharp error estimates for the two classes of exponential integration methods. Results of numerical experiments are discussed that illustrate the effectiveness of the proposed schemes, beyond present state-of-the-art capabilities.
Introduction
The Lindblad equation is a widely used Markovian quantum master equation to model the dynamical evolution of open quantum systems [1, 2]. The quantum master equation plays a crucial role in many application areas including condensed matter physics, quantum physics and quantum information theory. In this paper, we consider quantum systems consisting of dephasing -level qudits undergoing Markovian open quantum dynamics. The time dynamics of these systems is given by the Gorini-Kossakowski-Sudarshan-Lindblad equation (or Lindblad equation for short) [3, 4]:
Email addresses: [email protected] (Hao Chen), [email protected] (Alfio Borzì), [email protected] (Denis Janković), [email protected] (Jean-Gabriel Hartmann), [email protected] (Paul-Antoine Hervieux)
where is the density matrix describing the state of the system, is the Hamiltonian operator describing the unitary evolution of the qudit, are the Lindblad or jump operators characterizing the dissipation channels, and are the decay parameters for each of the channels.
The Lindblad equation can be also written in a vectorized form, using Dirac’s bracket notation, as follows:
with
where is the vectorized density matrix and is the matrix representation of the Lindblad generator. The superscripts , and denote the adjoint, transpose and complex conjugate operators, respectively.
The Lindblad equation possesses two important properties [3, 4]: it is positivity and trace preserving, which means that the solution is Hermitian positive semidefinite and has unit trace if the initial data is Hermitian positive semidefinite with unit trace. These properties of the density matrix are of fundamental physical significance, and whether they can be preserved at the discrete level is a significant issue in numerical simulations, and especially for long-time simulation [5]. The major goal of this work is to develop positivity and trace preserving numerical schemes for approximating the Lindblad equation (1) with guaranteed accuracy.
The literature on numerical methods for solving the Lindblad equation is relatively scarce. Explicit Runge-Kutta methods have been discussed in [5], where the authors show that these methods do not preserve the positivity of the density matrix. The Crank-Nicolson method has been studied in [6] for a two-level Lindblad equation and it is shown in [7] that the Crank-Nicolson scheme can not preserve the positivity in general. In fact, standard Runge-Kutta methods and multistep methods cannot be better than first-order accurate if they must preserve positivity; see, e.g., [8, 9]. On the other hand, there are methods based on matrix exponential [5, 10, 11] for solving the vector representation (2) of the Lindblad equations. This kind of methods are positivity and trace preserving since the differential equation (2) is solved analytically. However, the coefficient matrix is of size and the computation of the product of the associated matrix exponential with vectors is expensive if is large. Further, there are methods based on operator splitting techniques [12, 13] and low-rank operator splitting schemes [14, 15], where by means of a normalization procedure the low-rank splitting schemes preserve positivity and trace; however, rigorous error analysis is still unavailable. Moreover, Kraus representation approximation methods have been studied in [16], where it is shown that these methods are positivity and trace preserving, where the latter is achieved by a normalization procedure. In addition, a decomposition of nonunitary operators approach has been developed in [17] for the vectorized Lindblad equation.
Besides the above mentioned approaches, several numerical methods have been studied for large-scale problems [18, 19], including methods based on matrix product states [20, 21, 22, 23] and strategies based on neural networks [24, 25, 26]. Tree tensor networks [27, 28] have also been developed to simulate quantum many-body states.
Noting that, in general, positivity and trace preserving schemes are relatively less considered and rigorous error analysis on numerical integrators for the Lindblad equation is largely unavailable, the aim of this paper is to develop and analyze positivity and trace preserving numerical schemes for solving the Lindblad equation (1). Inspired by the exponential integrators for solving differential matrix Riccati equations [29, 30], we present novel full- and low-rank exponential Euler integrators for the Lindblad equation. We prove that our exponential Euler schemes preserve positivity and trace unconditionally, that is, the new methods are unconditionally stable. However, while the full-rank scheme does not require any normalization procedure to preserve unit trace, in the low-rank case normalization is still required. On the other hand, trace preservation in the full-rank case allows us to prove sharp accuracy estimates that are also instrumental for obtaining the accuracy estimates for the low-rank method presented in this paper. Clearly, one disadvantage of the low-rank approach is to introduce an additional approximation error due to the low-rank representation of the density matrix. On the other hand, we have the benefit of drastically reducing computational costs as we show in the section of numerical experiments.
This paper is organized as follows. In Section 2, we introduce our full-rank exponential Euler integrator for discretizing the Lindblad equation and discuss related implementation issues. In Section 3, we show that the proposed full-rank exponential scheme preserves positivity and unit trace of the solution unconditionally. Section 4 is dedicated to the error analysis of the full-rank exponential Euler integrator. In Section 5, we propose the low-rank exponential Euler scheme and provide its error estimate. In Section 6, many numerical experiments are performed for the Lindblad equation with various Hamiltonians, including the tests of convergence rate, positivity and unit trace preservation, and effectiveness of the low-rank algorithm. Also in this section, we compare our exponential Euler schemes with the Lindblad solvers of the well-known QuTiP framework for simulation of open quantum systems [31], showing that, while the latter may provide higher accuracy, they seem not able to provide the required positivity property, which is guaranteed by the proposed full- and low-rank exponential Euler schemes. Moreover, it is shown that the new low-rank exponential scheme performs much faster than all other schemes considered in this paper, as the dimensionality of the problem increases. A section of conclusion completes this work.
An exponential Euler integrator
In this section, we develop an exponential integrator to solve the Lindblad equation (1) on the time interval , for some , equipped with the initial condition , where is a Hermitian and positive semidefinite matrix with unit trace. First, let us define
Then, we can rewrite (1.1) as follows:
Given a positive integer , we divide the time interval by subintervals of size , with endpoints , . Then, integrating the equation (2.2) from to and using the variation-of-constants formula yields
Applying this formula again for within the integral, we obtain
where
By truncating the term and approximating the matrix exponentials by and in (2.4), we obtain our full-rank exponential Euler (FREE) integrator, for the approximation to , as follows:
for .
Remark 2.1. If we make the approximation within the integral in (2.3), then we obtain the “standard” exponential Euler scheme for solving (1.1) given by
Note that the “standard” exponential Euler scheme (2.7) can preserve the positive semidefinite property and is first-order convergent. However, this scheme can not preserve unit trace of the Lindblad equation. Similar “standard” exponential integrators have been proposed and analyzed for solving differential matrix Riccati equations in [29, 30]. Such matrix-valued exponential integrators are natural extensions of the vector-valued exponential integrators, for which we refer to the review [32] for details.
Remark 2.2. We remark that the exponential Euler integrator (2.6) can be extended straightforwardly to solve Lindblad equations with time-dependent Hamiltonians , in which case the exponential Euler scheme reads
where
Since the analysis of this scheme is similar to the one with time-independent Hamiltonian, for ease of presentation, we will only present numerical analysis for the FREE scheme (2.6).
Now, we briefly illustrate the practical implementation of the proposed exponential Euler scheme (2.6). Define
By using the properties of Kronecker products, we can show that is the solution of the following algebraic Lyapunov equation (see [29, 30] for details)
It follows that the exponential Euler integrator (2.6) is equivalent to
Note that at every time step of the exponential Euler integrator (2.9), we need to solve an algebraic Lyapunov equation and compute matrix-vector products associated with matrix exponential .
Positivity and trace preserving properties
In this section, we study the positivity and trace preserving properties of the exponential Euler integrator (2.6). Throughout the paper, we use the following notation. For any matrix , we denote the trace of the matrix . For the trace, we have the cyclic property that . We write if the matrix is Hermitian and positive semidefinite.
For any matrix , the trace norm, or the Schatten-1 norm, is defined as , where are the singular values of . If , we have that . We denote the Frobenius norm of .
Now, we study the positivity preserving property of the proposed FREE integrator.
Theorem 3.1. Assume that is Hermitian and positive semidefinite. Then, for any time step size , the solution of the full-rank exponential Euler scheme (2.6) given by is Hermitian and positive semidefinite.
Proof. We prove the theorem by induction. Assume that the result holds for , i.e. is Hermitian and positive semidefinite. Next, we prove that the result holds for . Since is Hermitian and positive semidefinite, we see that both terms on the right-hand side of (2.6) are Hermitian and positive semidefinite. It follows that is also Hermitian and positive semidefinite, which completes the proof. □
The following result will play a key role in the analysis of the trace preserving property of the exponential Euler scheme.
Lemma 3.2. For any matrix and any , it holds that
Proof. Note that the solution of the differential equation
is given by
Using the definition of in (2.1), we obtain that the differential equation (3.2) is equivalent to
By the variation-of-constants formula, we have
Using the cyclic property of the trace and (15), we obtain
Then, the desired result (13) follows. □
Now, we are in the position to give the following theorem.
Theorem 3.3. Assume that the initial data satisfies . Then, for any time step size , the full-rank exponential Euler integrator (8) preserves unit trace in the sense that
Proof. We prove the theorem by induction. We have . Assume that the result holds for , i.e., . Next we prove the result holds for . Using (8) and applying Lemma 3.2, we have , which completes the proof. □
Remark 3.4. Note from Theorems 3.1 and 3.3 that for any and any , which indicates that the proposed exponential Euler integrator (8) is unconditionally stable.
Accuracy of approximation
In this section, we investigate the convergence of the exponential Euler scheme (8). First, we present some preparatory results that will be useful in the error analysis.
Lemma 4.1. For any matrix and any Hermitian matrix , it holds that
where .
Proof. Note that for any Hermitian matrix , we have the spectral decomposition , where is unitary and is diagonal. Note that . So we only need to prove that the following inequality
holds for any and any diagonal matrix .
Since is Hermitian, we have the spectral decomposition , where is unitary and is the diagonal matrix containing eigenvalues of . Using , , and , we get
and the required result follows.
Lemma 4.2. For any Hermitian matrix , it holds that
Proof. Let and we note that and . For any ,
applying Lemma 4.1 and Lemma 3.2 yields
The conclusion follows. □
Lemma 4.3. For any Hermitian matrix and any , it holds that
Proof. Using Lemma 4.1 and noting that , we have
where the last equality follows from Lemma 3.2. The desired result follows since . □
For the discussion that follows, we define
Now, we are ready to prove our error estimate of the full-rank exponential Euler scheme (8). We have
Theorem 4.4. Let be the solution of the Lindblad equation (1) with , and be the corresponding numerical solution generated by the full-rank exponential Euler scheme (8). Then, it holds that
where the constant depends on , , , but is independent of and .
Proof. Expanding in a Taylor series with remainder in integral form yields
Inserting the above equation into (6), we have
where is defined in (7), and
Denote the global error . Subtracting (8) from (18), we obtain the error recursion
where .
Using Lemma 4.2 and noting that for any , we have
Similarly, we can obtain
and
where .
It follows from (19), (23), and Lemma 4.3 that
which completes the proof. □
A low-rank exponential Euler integrator
When the Lindblad equation is large-sized, i.e. , the computational cost of the full-rank exponential Euler integrator (8) would be expensive since algebraic Lyapunov equations with dimension need to be solved and matrix-vector products associated with are required at every time step. Now, in order to reduce computational costs while controlling accuracy, we develop a low-rank variant of the FREE integrator (8). The aim is to find matrices with such that the solution of the Lindblad equation can be well approximated as
where we denote with the numerical low-rank solution to the Lindblad equation in order to distinguish it from , the full-rank numerical solution of the same equation.
Let with and . To derive our low-rank exponential Euler scheme, we first define
where
Instead of computing by solving an algebraic Lyapunov equation as in (11), we approximate the integral in (25) by the following quadrature formula
where . It then follows from (24) that
where
By this notation we mean that the matrix and the matrices are placed side by side.
Note that for many problems, the matrix exponential or the product of matrix exponential times vectors may be costly to compute and approximations may be required. In the low-rank algorithm, we denote with (resp. ) an approximation of (resp. ). We will always assume that for any , where is the error tolerance of the underlying matrix exponential algorithm and . In addition, note that the matrix has more columns than , and likely also more than its rank. A better low-rank approximation can be obtained by applying a column compression technique [33], which can be done by truncating the singular value decomposition (SVD) of the given matrix. We denote with the truncated SVD of a matrix with error tolerance , that is, represents the best rank approximation of the matrix in Frobenius norm, where is the minimal integer such that . We then get
To summarize, our low-rank exponential Euler (LREE) scheme reads as follows:
Note that the LREE integrator requires to approximate matrix-exponential-vector products and compute a SVD of a tall matrix with columns at every time step. The computational cost is much cheaper than that of the FREE scheme, which requires to compute () matrix-exponential-vector products and solve an algebraic Lyapunov equation of dimension .
Remark 5.1. Note from and (30) that the LREE scheme (5.4) is positivity and trace preserving:
However, in this case normalization is performed.
We remark that the LREE (5.4) is equivalent to
where and the Hermitian matrix can be seen as the perturbation caused by the numerical quadrature (26), the approximation to the matrix exponential times vector (27) and the column compression procedure (29). A bound on is given in the following theorem.
Theorem 5.2. Assume that the matrix exponential algorithm used in the LREE scheme (5.4) satisfies for any with tolerance . Let be the error tolerance of the column compression algorithm used in the LREE scheme (5.4). Then, it holds that
where the constant depends on , , , but is independent of , , and $\operatorname{tol}_2.
Proof. Let us first define
and
Using (5.6b), we see that
Note that the above three components in the perturbation correspond to errors induced by the numerical quadrature, the approximation to the matrix exponential and the column compression procedure, respectively.
By comparing (5.4) with (5.6), we obtain , and . Then, it follows that
To estimate the second component in (5.8), we define . Using (5.5) and the assumption on the matrix exponential algorithm, we get
Then, we obtain
where .
Now, we estimate the first component in (5.8). Expanding in Taylor series with remainder in integral form yields
Defining
and using (31) and Lemma (17), we obtain
By the definitions of and , we get
Finally, we conclude using (36)–(39). □
Now, we derive the error estimate of the LREE integrator (5.4) (or (5.6)). We assume that the initial low-rank approximation satisfies
for some .
Theorem 5.3. Let be the solution of the Lindblad equation (1) with , and be the corresponding numerical solution generated by the LREE scheme (5.4). Assume that the matrix exponential algorithm used in the LREE scheme (5.4) satisfies for any . Let the error tolerances of the matrix exponential algorithm and the column compression satisfy and for some , respectively. Then, it holds that
where and the positive constants and are as defined in Theorem 4.4 and Theorem 5.2, respectively.
Proof. First, we split the global error as follows:
where the auxiliary quantities are derived from the FREE integrator with low-rank initial value . That means
where . Note that the global error is decomposed into three components, where the first component denotes the global error of the FREE integrator (8), and we have presented the error estimate for this part in Theorem 4.4. The second component is the difference between the full-rank solutions with initial values and low-rank . The third component is the difference of the solutions obtained with the FREE integrator and the LREE integrator with the same initial value .
Subtracting (5.13) from (2.6) and applying Lemma 4.3, we obtain
The third error component can be decomposed as
Subtracting (5.6a) from (5.13) and applying Lemma 4.3, we have
It then follows from (5.5), (5.6), (5.15), Lemma 3.2 and Theorem 5.2 that
The desired result follows from (5.12), Theorem 4.4, (5.14) and (5.16).
Numerical experiments
In this section, we present results of numerical experiments that demonstrate the accuracy and efficiency of our FREE integrator (2.9) and LREE integrator (5.4). All simulations are carried out using Python 3.12.4 on a laptop with Intel(R) Core(TM) i7-8565U [email protected] and 16GB RAM. We use the codes in the Python package scipy to compute the matrix exponential and the products of matrix exponential with vectors. The codes are based on algorithms proposed in [34, 35]. We also use the code in scipy to solve the algebraic Lyapunov equations in the FREE scheme (2.9), which is based on the Bartels-Stewart algorithm; see, e.g., [36, 37].
To show the accuracy of the proposed scheme, we display the relative errors defined as follows:
and test its convergence order. The exact solution is computed through the vectorized Lindblad equation (1.2) using matrix exponential.
The initial condition of the Lindblad equation is mostly chosen to be the Greenberger-Horne-Zeilinger (GHZ) state
The GHZ state for qudits is a highly entangled quantum state that is a generalization of the -qubit GHZ state, which is a superposition of all qubits being in state and all qubits being in state . GHZ states are a valuable resource in quantum information processing due to their strong entanglement properties, which can be utilized for various tasks such as quantum teleportation, quantum error correction, and quantum cryptography.
We consider the Lindblad equation with the X-X Ising Chain Hamiltonian given by
where
with identity matrices before and identity matrices after it.
is the identity matrix and the operators are defined as follows
and
The first sum in (45) is the so-called drift-Hamiltonian, which characterizes the inner dynamics of the qudit. The term allows for an even spacing of eigenvalues of amplitude between the levels, while the term allows for an uneven spacing of amplitude and therefore, the levels become individually addressable. The second sum is the interaction Hamiltonians, where is the coupling strength. If depends on time, we have a time-dependent Hamiltonian. The Ising-type Hamiltonian describes the interaction between two qudits as a product of their respective local operators. The jump operators are always set to be , unless stated otherwise.
Tests on the FREE integrator
In Figure 6.1, we present numerical results of the proposed FREE integrator for the Lindblad equation with time-independent Hamiltonian (). The solvers for matrix exponential and Lyapunov equation used in FREE integrator were set with default tolerance (machine precision ). We see that the expected first-order accuracy is achieved for the FREE scheme, which is in agreement with the convergence estimate stated in Theorem 4.4. It can also be seen that is close to machine precision for different time step sizes, which demonstrates the preservation of unit trace unconditionally. We also see that the populations , , and stay nonnegative in the interval , which is consistent with the positive property of the density matrix. Note that although we display evolutions of populations , , and , the positive features are visible in all populations.

Figure 6.1. Numerical results of the FREE integrator for the Lindblad equation with Hamiltonian (45) (, , , , , ). Top left: relative errors at vs step sizes for different and . Top right: evolutions of vs time for different with fixed , and . Bottom left: evolutions of the populations and with , , and . Bottom right: evolutions of the populations and with , , and .
In Figure 6.2, we display numerical results of the FREE scheme for the Lindblad equation with time-dependent Hamiltonian. Here the coupling strength was set to

Figure 6.2. Numerical results of the FREE integrator for the Lindblad equation with time-dependent Hamiltonian (6.1) (, , , , , ). Top left: relative errors at vs step sizes for different and . Top right: evolutions of vs time for different with , and . Bottom left: evolutions of the populations and with , , and . Bottom right: evolutions of the populations and with , , and .
and we chose as , , and , respectively. Again, we see that the FREE scheme achieves first-order accuracy in time. The numerical solutions obtained by our FREE scheme preserve positivity and unit trace unconditionally.
Tests on the LREE integrator
Now, we test the performance of the LREE scheme for the Lindblad equation with Hamiltonian (6.1). First, we test the error behavior of the LREE scheme with respect to time discretization and the initial low-rank error . In this case, the initial condition of the Lindblad equation is set to be
where and are orthonormal vectors and we obtain them from SVD of a random real matrix. The low-rank initial factor is set to be and clearly we have . The error tolerances of the matrix exponential and column compression are set to be and , respectively. In Figure 6.3, we present the error behavior of the LREE scheme with various choices of . As we can see, the LREE scheme has convergence of order one when the initial low-rank error is small enough. When the initial low-rank error is dominant, decreasing the step size does not lead to more accurate solution. These numerical results are in agreement with the error estimate stated in Theorem 5.3 and we note that the estimate with respect to can not be made sharper.

Figure 6.3. Numerical results of the LREE scheme with and for the Lindblad equation with Hamiltonian (6.1). Left: relative errors at vs step sizes for the Lindblad problem with , , , , , . Right: relative errors at vs step sizes for the Lindblad problem with , , , , , .
Second, we focus on error behavior with respect to the time discretization and low-rank approximation. The initial condition is chosen to be the GHZ state. The initial low-rank factor is set to be . In this case, and there is no initial low-rank approximation error (). The error tolerance of the code for matrix exponential is set to be . The error tolerance of the column compression algorithm is set to be . In Figure 6.4, we present the error behavior of the LREE scheme with various . We see that the LREE scheme achieves first-order accuracy when the low-rank approximation error (due to the column compression) is small enough. Decreasing the step size cannot lead to more accurate solution when the low-rank approximation error is dominant. These results are also in agreement with the error estimate stated in Theorem 5.3.

Figure 6.4. Numerical results of the LREE scheme with and for the Lindblad equation with Hamiltonian (6.1). Left: relative errors at vs step sizes for the Lindblad problem with , , , , , . Right: relative errors at vs step sizes for the Lindblad problem with , , , , , .
Finally, we test the performance of the LREE scheme in terms of errors due to time discretization and the approximation of the products of matrix exponential with vectors. We set and in this case . The error tolerance of the column compression is set to . The error tolerance of the algorithm for matrix exponential is set to be . In Figure 6.5, we show the error behavior of the LREE scheme with various . We see that the LREE scheme achieves first-order accuracy even when is much bigger than . This error behavior is different from those observed in Figure 6.3 and Figure 6.4. We remark that this performance may be caused by the matrix exponential algorithm [35] that we used. In the Theorem 5.3, we assume that the matrix exponential algorithm satisfies

Figure 6.5. Numerical results of the LREE scheme with and for the Lindblad equation with Hamiltonian (45). Left: relative errors at vs step sizes for the Lindblad problem with , , , , , . Right: relative errors at vs step sizes for the Lindblad problem with , , , , , .
where is the input error tolerance. It seems that the error constant depends on , which was verified in Figure 6.6, in which we show the values of for various and , where is a random matrix with and we set for equation with time-independent Hamiltonian and for problem with time-dependent Hamiltonian.

Figure 6.6. vs . Left: time-independent case with , , , , , . Right: time-dependent case with , , , , , .
Numerical comparison
Now, we compare integration algorithms with the Lindblad equation suite mesolve developed in QuTip [31], a widely used Python package for the simulation of open quantum systems. We consider five ODE solvers in mesolve: adams, bdf, lsoda, dop853 and vern9, which are based on twelfth-order Adams method, fifth-order backward differentiation formula, adaptive method chosen between adams and bdf, Dormand and Prince’s eighth-order Runge-Kutta method and Verner’s ninth-order Runge-Kutta method (see [38, 39]), respectively. Note that these ODE solvers consider the Lindblad equation in the vectorized form (1.2).
In Figure 6.7, we compare the performance of our FREE and LREE schemes and the solvers used in QuTip with respect to accuracy and computational times measured in seconds. Note that we only report the running time of the ODE solvers. The initial condition is set to be the GHZ state ( for the LREE scheme) and relative errors are reported at . The error tolerances of the matrix exponential algorithm and column compression method used in LREE scheme are set to be and for equation with time-independent Hamiltonian and and for equation with time-dependent Hamiltonian, respectively. We observe that the LREE scheme performs faster than the FREE scheme for a fixed level of accuracy. For a fixed level of moderate accuracy (i.e., bigger than in the time-independent case), our LREE scheme is more efficient than the solvers in QuTip. However, for the given problems (with ), the solvers in QuTip performs faster than our exponential integrators in the high accuracy case. After all, our methods are only first-order accurate and much more steps are required to reach similar accuracy.

Figure 6.7. Numerical comparison between the proposed exponential schemes and the solvers in QuTip for the Lindblad equation with Hamiltonian (45). Left: results for problem with , , , , , . Right: results for problem with , , , , , .
In Figure 6.8, we compare the computational times of our FREE and LREE schemes with those of the Lindblad solvers used in QuTip as the size of the Lindblad equation increases. We fix and let increase. The jump operators are set to be . The error tolerances of the matrix exponential algorithm and column compression method used in the LREE scheme are set to be and , respectively. In this experiment, the absolute and relative tolerances of the QuTip solvers and the step sizes of the FREE and LREE schemes are chosen such that the relative errors at are approximately , see the right-hand plot in Figure 6.8. We see that our LREE scheme performs much faster than the QuTip Lindblad solvers for problems with high dimensions. In particular, we notice a strikingly better computational time complexity of our LREE scheme, with much smaller change in the runtime of our algorithm with respect to increasing . However, we see that the FREE scheme is less efficient than the other solvers. This is mainly due to the computation of the associated algebraic Lyapunov equations.

Figure 6.8. Numerical comparison between the proposed exponential schemes and the solvers in QuTiP for the Lindblad equation with Hamiltonian (45) and jump operators (, , , , ). Left: CPU times vs. . Right: relative errors vs .
Note that the numerical results presented in Figure 6.7 and Figure 6.8 are with respect to problems with sparse Hamiltonian (6.1) and sparse jump operators. In Figure 6.9, we compare the computational times of our exponential schemes with those of the five Lindblad solvers used in QuTip in the case of a Lindblad equation with dense jump operator. We consider the Lindblad equation with Hamiltonian (6.1) and , and the jump operator is chosen as a random and dense matrix. We observe that now both of our FREE and

Figure 6.9. Numerical comparison between the proposed exponential schemes and the solvers in QuTiP for the Lindblad equation with Hamiltonian (45) and random jump operators (, , , , ). Left: CPU times vs. . Right: relative errors vs .
LREE schemes outperform the five QuTip Lindblad solvers in terms of computational times. We also see that the computational times of the QuTip Lindblad solvers increase quickly as the dimension increases.
We remark that, in the dense case, the Lindblad solvers used in QuTip require to store a dense and complex matrix , which requires memory of Bytes. On the other hand, our FREE and LREE schemes only require to store a matrix of size , which needs memory of Bytes. For example, if , QuTip needs nearly 3000 MB memory while our algorithms only require 0.2 MB memory. In the sparse case, the memory requirements of the QuTip and our exponential schemes on the coefficient matrix reduce to and , respectively. It seems that the QuTip Lindblad lsoda solver requires dense representation of the data matrices. So the lsoda method was absent from the numerical comparison presented in Figure 6.7 and Figure 6.8 since memory error appears for the considered dimensions.
In Figure 6.10-Figure 6.11, we compare the performance of our exponential schemes with the five solvers in QuTip concerning the preservation of positivity and unit trace. We set and for the LREE scheme and for both the FREE and LREE schemes. The absolute and relative tolerances of the adams, bdf, lsoda and dop853 solvers are all set to be . The absolute and relative tolerances of the vern9 solver are set to be . We see that all the solvers can preserve unit trace. However, we also see that, while both our FREE and LREE schemes are positivity preserving, the solvers in QuTip do not guarantee the positive semidefinite property of the density matrix, which is in agreement with the first-order barrier for positivity of (standard) Runge–Kutta and multistep methods as discussed in [8, 9].

Figure 6.10. Numerical comparison between the proposed exponential schemes and adams, bdf, lsoda solvers in QuTip for the Lindblad equation with Hamiltonian (45) and , , , , , . Top left: evolutions of the populations . Top right: evolutions of the populations . Bottom left: evolutions of the populations . Bottom right: evolutions of vs time.

Figure 6.11. Numerical comparison between the proposed exponential schemes and dop853, vern9 solvers in QuTip for the Lindblad equation with Hamiltonian (45) and , , , , , . Left: evolutions of the populations . Right: evolutions of vs time.
Conclusion
In this paper, full- and low-rank exponential Euler integrators for solving the Lindblad equation were developed and analyzed. It was proven and numerically validated that these schemes preserve positivity and unit trace unconditionally. Moreover, sharp accuracy estimates were presented. The computational performance of the new exponential Euler integrators were successfully validated by results of numerical simulations with the Lindblad equation with various Hamiltonians, and by comparison with the Lindblad solvers available in the well-known QuTip package for simulation of open quantum systems.
Acknowledgements
A.B. would like to thank Guofeng Zhang (Hong Kong Polytechnic University), Xiu-Hao Deng (Shenzhen Institute of Quantum Science and Engineering, SUSTech) and Song Zhang (Shenzhen International Quantum Academy) for inspiring discussions on open quantum systems and very kind hospitality.
Funding The work of Hao Chen was partly supported by the Natural Science Foundation Project of CQ CSTC (No. cstc2021jcyj-msxmX0034).
References
- [1]H.-P. Breuer and F. Petruccione. The Theory of Open Quantum Systems. Oxford University Press, 2007.DOI
- [2]E.B. Davies. Quantum Theory of Open Systems. Academic Press, 1976.
- [3]V. Gorini, A. Kossakowski, and E.C.G. Sudarshan. Completely positive dynamical semigroups of N-level systems. Journal of Mathematical Physics, 17(5):821–825, 05 1976.DOI
- [4]G. Lindblad. On the generators of quantum dynamical semigroups. Communications in Mathematical Physics, 48(2):119–130, 1976.DOI
- [5]M. Riesch and C. Jirauschek. Analyzing the positivity preservation of numerical methods for the Liouville-von Neumann equation. Journal of Computational Physics, 390:290–296, 2019.DOI
- [6]R.W. Złokowski, J.M. Arnold, and D.M. Gogny. Ultrafast pulse interactions with two-level atoms. Phys. Rev. A, 52:3082–3094, Oct 1995.
- [7]B. Bidégaray, A. Bourgeade, and D. Reignier. Introducing physical relaxation terms in Bloch equations. Journal of Computational Physics, 170(2):603–613, 2001.DOI
- [8]S. Blanes, A. Iserles, and S. Macnamara. Positivity-preserving methods for ordinary differential equations. ESAIM: M2AN, 56(6):1843–1870, 2022.DOI
- [9]A Martiradonna, G. Colonna, and F. Diele. Geco: Geometric conservative nonstandard schemes for biochemical systems. Applied Numerical Mathematics, 155:38–57, 2020. Structural Dynamical Systems: Computational Aspects held in Monopoli (Italy) on June 12-15, 2018.DOI
- [10]M. Riesch, A. Pikl, and C. Jirauschek. Completely positive trace preserving methods for the Lindblad equation. In 2020 International Conference on Numerical Simulation of Optoelectronic Devices (NUSOD), pages 109–110, 2020.DOI
- [11]A. Bourgeade and O. Saut. Numerical methods for the bidimensional Maxwell-Bloch equations in nonlinear crystals. Journal of Computational Physics, 213(2):823–843, 2006.DOI
- [12]M.E. Songolo and B. Bidégaray-Fesquet. Strang splitting schemes for N-level Bloch models. International Journal of Modeling, Simulation, and Scientific Computing, 14(03):2350044, 2023.arxiv.org/abs/1909.10932
- [13]M.E. Songolo and B. Bidégaray-Fesquet. Nonstandard finite-difference schemes for the two-level Bloch model. *International Journal of Modeling, Simulation, and Scientific Computing*, 09(04):1850033, 2018.DOI
- [14]C. Le Bris and P. Rouchon. Low-rank numerical approximations for high-dimensional Lindblad equations. *Phys. Rev. A*, 87:022125, Feb 2013.DOI
- [15]C. Le Bris, P. Rouchon, and J. Roussel. Adaptive low-rank approximation and denoised Monte Carlo approach for high-dimensional Lindblad equations. *Phys. Rev. A*, 92:062126, Dec 2015.DOI
- [16]Y. Cao and J. Lu. Structure-preserving numerical schemes for Lindblad equations, 2024.DOI
- [17]A.W. Schlimgen, K. Head-Marsden, L.M. Sager, P. Narang, and D.A. Mazziotti. Quantum simulation of the Lindblad equation using a unitary decomposition of operators. *Phys. Rev. Res.*, 4:023216, Jun 2022.DOI
- [18]W. Weimer, A. Kshetrimayum, and R. Orús. Simulation methods for open quantum many-body systems. *Rev. Mod. Phys.*, 93:015008, Mar 2021.DOI
- [19]A.H. Werner, D. Jaschke, P. Silvi, M. Kliesch, T. Calarco, J. Eisert, and S. Montangero. Positive tensor network approach for simulating open quantum many-body systems. *Phys. Rev. Lett.*, 116:237201, Jun 2016.DOI
- [20]R. Orús. A practical introduction to tensor networks: Matrix product states and projected entangled pair states. *Annals of Physics*, 349:117–158, 2014.DOI
- [21]U. Schollwöck. The density-matrix renormalization group. *Rev. Mod. Phys.*, 77:259–315, Apr 2005.DOI
- [22]G. Vidal. Efficient classical simulation of slightly entangled quantum computations. *Phys. Rev. Lett.*, 91:147902, Oct 2003.DOI
- [23]Guifré Vidal. Efficient simulation of one-dimensional quantum many-body systems. *Phys. Rev. Lett.*, 93:040502, Jul 2004.pubmed.ncbi.nlm.nih.gov/15323740
- [24]M.J. Hartmann and G. Carleo. Neural-network approach to dissipative quantum many-body dynamics. *Phys. Rev. Lett.*, 122:250502, Jun 2019.DOI
- [25]A. Nagy and V. Savona. Variational quantum Monte Carlo method with a neural-network ansatz for open quantum systems. *Phys. Rev. Lett.*, 122:250501, Jun 2019.DOI
- [26]M. Reh, M. Schmitt, and M. Gärtner. Time-dependent variational principle for open quantum systems with artificial neural networks. *Phys. Rev. Lett.*, 127:230501, Dec 2021.DOI
- [27]L. Arceci, P. Silvi, and S. Montangero. Entanglement of formation of mixed many-body quantum states via tree tensor operators. *Phys. Rev. Lett.*, 128:040501, Jan 2022.DOI
- [28]D. Sulz, C. Lubich, G. Ceruti, I. Lesanovsky, and F. Carollo. Numerical simulation of long-range open quantum many-body dynamics with tree tensor networks. *Phys. Rev. A*, 109:022420, Feb 2024.DOI
- [29]H. Chen and A. Borzì. Positivity preserving exponential integrators for differential Riccati equations. *Journal of Scientific Computing*, 96(2):50, 2023.DOI
- [30]H. Chen and A. Borzì. Low-rank exponential integrators for stiff differential Riccati equations. *Submitted*, 2024.DOI
- [31]J.R Johansson, P.D. Nation, and F. Nori. QuTiP 2: A Python framework for the dynamics of open quantum systems. *Computer Physics Communications*, 184(4):1234–1240, 2013.
- [32]M. Hochbruck and A. Ostermann. Exponential integrators. *Acta Numerica*, 19:209–286, 2010.DOI
- [33]N. Lang, H. Mena, and J. Saak. On the benefits of the \(ldl^t\) factorization for large-scale differential matrix equation solvers. *Linear Algebra and its Applications*, 480:44–71, 2015.
- [34]A.H. Al-Mohy and N.J. Higham. A new scaling and squaring algorithm for the matrix exponential. *SIAM Journal on Matrix Analysis and Applications*, 31(3):970–989, 2010.DOI
- [35]A.H. Al-Mohy and N.J. Higham. Computing the action of the matrix exponential, with an application to exponential integrators. *SIAM Journal on Scientific Computing*, 33(2):488–511, 2011.DOI
- [36]Z. Gajic and M.T.J. Qureshi. *Lyapunov Matrix Equation in System Stability and Control*. Dover Books on Engineering. Dover Publications, 2008.
- [37]J.D. Hamilton. *Time Series Analysis*. Princeton University Press, 2020.
- [38]E. Hairer, S.P. Nørsett, and G. Wanner. *Solving Ordinary Differential Equations I: Nonstiff Problems*. Springer Series in Computational Mathematics. Springer Berlin Heidelberg, 2008.
- [39]J. H. Verner. Explicit Runge-Kutta methods with estimates of the local truncation error. *SIAM Journal on Numerical Analysis, 15(4):772–790, 1978.DOI