Simulating mixed-state evolution in open quantum systems is crucial for various chemical physics, quantum optics, and computer science applications. These simulations typically follow the Lindblad master equation dynamics. An alternative approach known as quantum state diffusion unraveling is based on the trajectories of pure states generated by random wave functions, which evolve according to a nonlinear Itô-Schrödinger equation (ISE). This study introduces weak first-order and second-order solvers for the ISE based on directly applying the Itô-Taylor expansion with exact derivatives in the interaction picture. We tested the method on free and driven Morse oscillators coupled to a thermal environment and found that both orders allowed practical estimation with a few dozen iterations. The variance was relatively small compared to the linear unraveling and did not grow with time. The second-order solver delivers a much higher accuracy and stability with bigger time steps than the first-order scheme, with a small additional workload. However, the second-order algorithm has quadratic complexity with the number of Lindblad operators as opposed to the linear complexity of the first-order algorithm.
Simulating mixed-state evolution in open quantum systems is crucial for various chemical physics, quantum optics, and computer science applications. These simulations typically follow the Lindblad master equation dynamics. An alternative approach known as quantum state diffusion unraveling is based on the trajectories of pure states generated by random wave functions, which evolve according to a nonlinear Itô-Schrödinger equation (ISE). This study introduces weak first-order and second-order solvers for the ISE based on directly applying the Itô-Taylor expansion with exact derivatives in the interaction picture. We tested the method on free and driven Morse oscillators coupled to a thermal environment and found that both orders allowed practical estimation with a few dozen iterations. The variance was relatively small compared to the linear unraveling and did not grow with time. The second-order solver delivers a much higher accuracy and stability with bigger time steps than the first-order scheme, with a small additional workload. However, the second-order algorithm has quadratic complexity with the number of Lindblad operators as opposed to the linear complexity of the first-order algorithm.
The jump unraveling of a quantum master equation decomposes the dynamics of an open quantum system into abrupt jumps, interspersed by periods of coherent dynamics when no jumps occur. Such open quantum systems are ubiquitous in quantum optics and mesoscopic physics, hence the need for efficient techniques for their stochastic simulation. Numerical simulation techniques fall into two main categories. The first splits the evolution into small time steps and determines stochastically for each step if a jump occurs or not. The second, known as Monte Carlo wave-function simulation, is based on the reduction of the norm of an initially pure state in the conditional no-jump evolution. It exploits the fact that the purity of the state is preserved by the finest unraveling of the master equation. In this paper, we present an alternative method for the simulation of the quantum jump unraveling, inspired by the classical Gillespie algorithm. The method is particularly well suited for situations in which a large number of trajectories is required for relatively small systems. It allows for non-purity-preserving dynamics, such as the ones generated by partial monitoring and channel merging. We describe the algorithm in detail and discuss relevant limiting cases. To illustrate it, we include four example applications of increasing physical complexity and discuss the performance of the algorithm across regimes of interest for open quantum systems simulation. Publicly available implementations of our code are provided in julia and mathematica.
We present a universal framework for simulating N-dimensional linear Itô stochastic differential equations (SDEs) on quantum computers with additive or multiplicative noises. Building on a unitary dilation technique, we establish a rigorous mapping from the general linear SDEs dXt=A(t)Xtdt+∑j=1JBj(t)XtdWtj to stochastic Schrödinger equations (SSE) on a dilated Hilbert space. Crucially, this embedding is pathwise exact in that the classical solution is recovered as a projection of the dilated quantum state for each fixed noise realization. We demonstrate that the resulting SSEs are {naturally implementable} on digital quantum processors, where the stochastic Wiener increments are encoded directly by preparing the ancillary qubits. Exploiting this physical mapping, we develop two algorithmic strategies: (1) a trajectory-based approach that uses sequential weak measurements to realize efficient stochastic integrators, including a second-order scheme, and (2) an ensemble-based approach that maps moment evolution to a deterministic Lindblad quantum master equation, enabling simulation without Monte Carlo sampling. We provide error bounds based on a stochastic light-cone analysis and validate the framework with numerical experiments.
For the efficient simulation of open quantum systems, we often use quantum jump trajectories given by pure states that evolve stochastically to unravel the dynamics of the underlying master equation. In the Markovian regime, when the dynamics is described by a Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equation, this procedure is known as Monte Carlo wave function approach. However, beyond ultraweak system-bath coupling, the dynamics of the system is not described by an equation of GKSL type, but rather by the Redfield equation, which can be brought into pseudo-Lindblad form. Here, negative dissipation strengths prohibit the conventional approach. To overcome this problem, we propose a pseudo-Lindblad quantum trajectory (PLQT) unraveling. It does not require an effective extension of the state space, like other approaches, except for the addition of a single classical bit. We test the PLQT for the eternal non-Markovian master equation for a single qubit and an interacting Fermi-Hubbard chain coupled to a thermal bath and discuss its computational effort compared to solving the full master equation.
Quantum state diffusion unravels a Lindblad master equation into stochastic trajectories of pure states. The ensemble of trajectories is described by a probability density on the manifold of pure states, which contains much more information than the density matrix, its first moment. We derive the time reversal of this diffusion. Writing the reversal of a general diffusion on a manifold in Stratonovich form, and passing through the manifold of pure states, we obtain a backward stochastic differential equation for the state vector, valid for any Hilbert space dimension and any Lindbladian. The backward stochastic equation provides a physical, nonlinear unravelling of the inverse Lindbladian that holds only for the ensemble from which it was constructed. Following score-based generative models, we then use the backward equation to generate a new ensemble close to the original. For the depolarizing channel the unravelling is a Brownian motion on complex projective space, so the uniform distribution of pure states is its stationary law in any dimension. Starting the backward equation from that prior, we bound the error of the resulting distribution compared to the original one in different settings: exact and learned scores, continuous and discrete time.
In this paper, we introduce a novel and general framework for the variational quantum simulation of Lindblad equations. Building on the close relationship between the unraveled Lindblad dynamics, stochastic Magnus integrators, and variational quantum simulation, we propose a high-order scheme for solving the quantum state diffusion equation using exponential integrators. This formulation facilitates the simulation of wavefunction trajectories within the established framework of variational quantum algorithms for time evolution. Our algorithm significantly enhances robustness in two key aspects: the stability of the simulation with large time steps, and the reduction in the number of quantum trajectories required to accurately simulate the Lindblad dynamics in terms of the ensemble average. We demonstrate the effectiveness of our algorithm through numerical examples in both classical and quantum implementations, including the transverse-field Ising model (TFIM) with damping, the Fenna-Matthews-Olson (FMO) complex, and the radical pair model (RPM). The simulation accuracy can be systematically improved, and the algorithm remains reliable even in highly oscillatory regimes. These methods are expected to be applicable to a broader class of open quantum systems beyond the specific models considered in this study.
It is well known that the state operator of an open quantum system can be generically represented as the solution of a time-local equation — a quantum master equation. Unraveling in quantum trajectories offers a picture of open system dynamics dual to solving master equations. In the unraveling picture, physical indicators are computed as Monte Carlo averages over a stochastic process valued in the Hilbert space of the system. This approach is particularly adapted to simulate systems in large Hilbert spaces. We show that the dynamics of an open quantum system generically admits an unraveling in the Hilbert space of the system described by a Markov process generated by ordinary stochastic differential equations for which rigorous concentration estimates are available. The unraveling can be equivalently formulated in terms of norm-preserving state vectors or in terms of linear “ostensible” processes trace preserving only on average. We illustrate the results in the case of a two level system in a simple boson environment. Next, we derive the state-of-the-art form of the Diósi-Gisin-Strunz Gaussian random ostensible state equation in the context of a model problem. This equation provides an exact unraveling of open systems in Gaussian environments. We compare and contrast the two unravelings and their potential for applications to quantum error mitigation.