Large-scale stochastic simulation of open quantum systems
Sander, Aaron, Fröhlich, Maximilian, Eigel, Martin, Eisert, Jens, Gelß, Patrick, Hintermüller, Michael, Milbradt, Richard M., Wille, Robert, Christian B. Mendl
Understanding interactions between quantum systems and their environments is crucial for developing stable quantum technologies and accurate physical models. Yet, simulating open quantum systems with non-unitary dynamics remains computationally demanding. We introduce the tensor jump method (TJM), a scalable and embarrassingly parallel algorithm for stochastically simulating large-scale open quantum systems governed by Lindbladians. The TJM extends the Monte Carlo wave function (MCWF) approach to matrix product states, employs a dynamic time-dependent variational principle (TDVP) to minimize evolution errors, and introduces a sampling MPS to reduce timestep dependence. This method scales efficiently, ensuring convergence to Lindbladian dynamics independent of system size, as demonstrated both rigorously and numerically. We showcase its utility by simulating XXX Heisenberg models with up to a thousand spins on a consumer-grade CPU. The TJM represents a significant advance in open quantum system simulation, enabling exploration of dissipative many-body dynamics and the design of more stable quantum hardware.
Understanding interactions between quantum systems and their environments is crucial for developing stable quantum technologies and accurate physical models. Yet, simulating open quantum systems with non-unitary dynamics remains computationally demanding. We introduce the tensor jump method (TJM), a scalable and embarrassingly parallel algorithm for stochastically simulating large-scale open quantum systems governed by Lindbladians. The TJM extends the Monte Carlo wave function (MCWF) approach to matrix product states, employs a dynamic time-dependent variational principle (TDVP) to minimize evolution errors, and introduces a sampling MPS to reduce timestep dependence. This method scales efficiently, ensuring convergence to Lindbladian dynamics independent of system size, as demonstrated both rigorously and numerically. We showcase its utility by simulating XXX Heisenberg models with up to a thousand spins on a consumer-grade CPU. The TJM represents a significant advance in open quantum system simulation, enabling exploration of dissipative many-body dynamics and the design of more stable quantum hardware.
Understanding interactions between quantum systems and their environments is crucial for developing stable quantum technologies and accurate physical models. Yet, simulating open quantum systems with non-unitary dynamics remains computationally demanding. We introduce the tensor jump method (TJM), a scalable and embarrassingly parallel algorithm for stochastically simulating large-scale open quantum systems governed by Lindbladians. The TJM extends the Monte Carlo wave function (MCWF) approach to matrix product states, employs a dynamic time-dependent variational principle (TDVP) to minimize evolution errors, and introduces a sampling MPS to reduce timestep dependence. This method scales efficiently, ensuring convergence to Lindbladian dynamics independent of system size, as demonstrated both rigorously and numerically. We showcase its utility by simulating XXX Heisenberg models with up to a thousand spins on a consumer-grade CPU. The TJM represents a significant advance in open quantum system simulation, enabling exploration of dissipative many-body dynamics and the design of more stable quantum hardware.
Understanding the precise interaction mechanisms between quantum systems and their environment is crucial for advancing stable quantum technologies, designing reliable experimental frameworks, and building accurate models of real-world phenomena. However, simulating open quantum systems, which feature complex non-unitary dynamics, poses significant computational challenges that require innovative methods to overcome. In this work, we introduce the tensor jump method (TJM), a scalable, embarrassingly parallel algorithm for stochastically simulating large-scale open quantum systems, specifically Markovian dynamics captured by Lindbladians. This method is built on three core principles where, in particular, we extend the Monte Carlo wave function (MCWF) method to matrix product states, use a dynamic time-dependent variational principle (TDVP) to significantly reduce errors during time evolution, and introduce what we call a sampling MPS to drastically reduce the dependence on the simulation's time step size. We demonstrate that this method scales more effectively than previous methods and ensures convergence to the Lindbladian solution independent of system size, which we show both rigorously and numerically. Finally, we provide evidence of its utility by simulating Lindbladian dynamics of XXX Heisenberg models up to a thousand spins using a consumer-grade CPU. This work represents a significant step forward in the simulation of large-scale open quantum systems, with the potential to enable discoveries across various domains of quantum physics, particularly those where the environment plays a fundamental role, and to both dequantize and facilitate the development of more stable quantum hardware.
Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies, as existing Lindblad estimation methods are typically limited to small system sizes due to the computational complexity of repeatedly solving the Lindblad equation during optimization. Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a stochastic simulation method, the Tensor Jump Method (TJM), with gradient-free optimization of a least-squares cost-function defined on time series of local-observable expectation values. We demonstrate the approach on two noise models in the Ising model: a site-resolved (local) model, in which independent dissipation rates are learned for each site up to Nsite=16, and a spatially homogeneous (global) model with only seven parameters, scaled to Nsite=160 sites.We complement these numerical results with a series of exact, provable guarantees: the Frobenius variance of the TJM density-matrix estimator is shown to equal (1−Tr[ρ2])/Ntraj, an exact purity-based characterization of the stochastic estimation error; the corresponding purity evolution is proven to be monotonically non-increasing for Hermitian jump operators; and, under a finite covariance distance assumption, the standard deviation of the cost-function is shown to decrease with system size, so that fewer trajectories are needed to reach a fixed target accuracy as the system grows. Together, this combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices and for guiding future work on error mitigation and quantum error correction.
Classical simulation of noisy quantum circuits is essential for validating algorithms, benchmarking hardware, and assessing error-mitigation strategies, but remains limited by the exponential cost of density-matrix methods and the high variance of standard trajectory sampling. We introduce a variance-aware tensor network framework that combines the tensor jump method with local TDVP gate evolution on matrix product states and sparse Pauli-Lindblad hardware noise models. Gates are applied as short variational evolutions on the MPS manifold, while noise is sampled per circuit window from Pauli-Lindblad jump sets with state-independent hazards and dissipative contractions that reduce to irrelevant global factors after renormalization. The method supports correlated multi-qubit Lindblad noise consistent with hardware connectivity, including long-range operators on non-adjacent qubits, enabling direct simulation of crosstalk and other connectivity-induced errors beyond local noise models. We develop two unbiased variance-aware unravelings. An analog unitary-mixture unraveling matches the Lindblad generator exactly under symmetric Gaussian or two-point angle laws, while a projector-jump unraveling yields state-independent hazards and closed-form variance laws. Both retain the standard 1/sqrt(N) Monte Carlo convergence but with reduced prefactors. Empirically, projector sampling strongly reduces trajectory variance and bond-dimension growth across many circuit architectures, whereas analog sampling is most effective at weak noise. We demonstrate accurate, scalable noisy-circuit simulation on a 25-qubit noisy XY quench and IBM's 127-qubit kicked-Ising benchmark with long-range depolarizing noise, achieving reduced Monte Carlo variance and favorable MPS bond-dimension growth compared with standard Kraus-insertion baselines.
Classical simulation of noisy quantum circuits is essential for validating algorithms, bench-marking hardware, and guiding error-mitigation strategies. Yet it remains challenging due to either the exponential memory footprint of density matrix methods or the high variance in trajectories of standard Kraus-insertion approaches. We introduce a variance aware tensor network framework that unifies the tensor jump method (TJM) with a local time-dependent variational principle (TDVP) and a sparse Pauli-Lindblad model (SPLM) of hardware noise. Gates are realized as short variational evolutions on the matrix product state (MPS) manifold, while noise is applied stochastically per circuit window using Pauli-Lindblad jump sets that render the sampling hazard state-independent and the dissipative contraction trivial after renormalization. Strikingly, our method supports arbitrary Lindblad correlated multi-qubit noise channels consistent with hardware connectivity, including long-range noise operators on non-adjacent subsets, enabling direct simulation of crosstalk and other connectivity-induced errors beyond local noise models. Building on prior work that introduced analog unitary unravelings, we adapt this scheme to a framework based on the Lindblad master equation with exact generator matching under discretized angle laws and a parameter choice. This exactly matches the Lindblad generator, while selecting Gaussian or two-point angle laws. In parallel, we introduce an MPS-projector-jump unraveling that yields state-independent hazards and closed-form variance laws. Both schemes are unbiased and inherit the standard 1/√N Monte Carlo convergence, but with substantially smaller constants due to variance reduction. Empirically, projector sampling markedly reduces the required bond dimension per trajectory across many circuit architectures, while analog sampling excels at low noise. We demonstrate accurate, scalable noisy-circuit simulation on a 25-qubit noisy XY quench and IBM’s 127-qubit kicked Ising benchmark with long-range depolarizing noise, achieving substantially reduced Monte Carlo variance and favorable bond dimension growth compared to standard Kraus insertion baselines.
Physical quantum systems are generically coupled to an environment, resulting in open system dynamics. A typical approach to simulating this dynamics is to propagate the density matrix of the system via the Lindblad master equation. This approach is numerically challenging due to the size of the density matrix, which has led to the development of quantum jump methods, which unravel the density matrix into an ensemble of state vectors. These methods utilize a stochastic sampling of the quantum jump times, which becomes inefficent for weakly dissipative dynamics, in which jumps are rare events. Here, we propose the deterministic quantum jump (DQJ) method, which we show to outperform standard quantum jump methods in the weakly dissipative regime, by removing the error of stochastic sampling. We describe the methodology at the single-jump and two-jump level, reconstructing the density matrix at the corresponding level. We demonstrate the performance of the method for two examples, the dissipative transverse-field Ising model, and the dissipative Kerr oscillator. Given that quantum technologies such as quantum computing have weakly dissipative quantum dynamics as their central focus, we propose this method to be utilized in that context, for exploring and understanding quantum technology platforms.