Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2404.12167 · Physical Review A

Quantum trajectory entanglement in various unravelings of Markovian dynamics

Tatiana Vovk, Hannes Pichler

Published Jul 8, 2024• 20 citations
arXivHTMLPDF

Abstract

The cost of classical simulations of quantum many-body dynamics is often determined by the amount of entanglement in the system. In this paper, we study entanglement in stochastic quantum trajectory approaches that solve master equations describing open quantum system dynamics. First, we introduce and compare adaptive trajectory unravelings of master equations. Specifically, building on [Phys. Rev. Lett. 128, 243601 (2022)], we study several greedy algorithms that generate trajectories with a low average entanglement entropy. Second, we consider various conventional unravelings of a one-dimensional open random Brownian circuit and locate the transition points from area- to volume-law-entangled trajectories. Third, we compare various trajectory unravelings using matrix product states with a direct integration of the master equation using matrix product operators. We provide concrete examples of dynamics, for which the simulation cost of stochastic trajectories is exponentially smaller than the one of matrix product operators.

DOI
10.1103/physreva.110.012207

Related papers

Entanglement-Optimal Trajectories of Many-Body Quantum Markov Processes

Tatiana Vovk, Hannes Pichler

We develop a novel approach aimed at solving the equations of motion of open quantum many-body systems. It is based on a combination of generalized wave function trajectories and matrix product states. We introduce an adaptive quantum stochastic propagator, which minimizes the expected entanglement in the many-body quantum state, thus minimizing the computational cost of the matrix product state representation of each trajectory. We illustrate this approach on the example of a one-dimensional open Brownian circuit. We show that this model displays an entanglement phase transition between area and volume law when changing between different propagators and that our method autonomously finds an efficiently representable area law unraveling.

arXiv:2111.12048•Physical Review Letters•Jun 13, 2022•45 citations

Optimized Trajectory Unraveling for Classical Simulation of Noisy Quantum Dynamics

Zhuo Chen, Yimu Bao, Soonwon Choi

The dynamics of open quantum systems can be simulated by unraveling it into an ensemble of pure state trajectories undergoing nonunitary monitored evolution, which has recently been shown to undergo measurement-induced entanglement phase transition. Here, we show that, for an arbitrary decoherence channel, one can optimize the unraveling scheme to lower the threshold for entanglement phase transition, thereby enabling efficient classical simulation of the open dynamics for a broader range of decoherence rates. Taking noisy random unitary circuits as a paradigmatic example, we analytically derive the optimum unraveling basis that on average minimizes the threshold. Moreover, we present a heuristic algorithm that adaptively optimizes the unraveling basis for given noise channels, also significantly extending the simulatable regime. When applied to noisy Hamiltonian dynamics, the heuristic approach indeed extends the regime of efficient classical simulation based on matrix product states beyond conventional quantum trajectory methods. Finally, we assess the possibility of using a quasi-local unraveling, which involves multiple qubits and time steps, to efficiently simulate open systems with an arbitrarily small but finite decoherence rate.

arXiv:2306.17161•Physical Review Letters•Dec 6, 2024•19 citations

On the Unraveling of Open Quantum Dynamics

Brecht Donvil, Paolo Muratore-Ginanneschi

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.

arXiv:2309.13408•Open Systems & Information Dynamics•Sep 1, 2023•7 citations

Computational regimes in matrix-product-state-based quantum trajectory simulations

Aaron Sander, Simon Cichy, Martin Eigel +4 more

Efficient simulation of open quantum systems is central to modeling noisy quantum hardware and many-body dynamics. In trajectory-based tensor network methods, cost is often associated with trajectory-level quantities such as entanglement growth or bond dimension. However, the total cost of a fixed-accuracy simulation also depends on statistical sampling, and the interplay between per-trajectory complexity and sampling effort remains poorly understood. Here we introduce a cost-resolved framework for matrix product state (MPS)-based quantum trajectory simulations that decomposes total cost into memory per trajectory, runtime per trajectory, and sampling effort. We show that physically equivalent stochastic unravelings of the same Lindblad dynamics do not necessarily reduce total cost, but instead redistribute cost between trajectory complexity and statistical convergence. This trade-off is quantified by two dimensionless inflation factors: a bond dimension inflation $α$ and a sampling inflation $κ$, which together determine the preferred unraveling under hardware-dependent memory and parallelism constraints. We provide a practical protocol for extracting $(α,κ)$ from modest pilot simulations and demonstrate it using benchmarks across multiple noise channels. The resulting decision maps show that the computationally favorable unraveling can change with noise strength, time-step resolution, system size, and available parallelism. These results establish unraveling choice as a hardware-aware simulation design problem rather than an intrinsic optimization of trajectory entanglement alone.

quant-pharXiv:2606.13779•Jun 15, 2026•3 citations

Superoperators vs. Trajectories for Matrix Product State Simulations of Open Quantum System: A Case Study

Lars Bonnes, Andreas Martin Läuchli

Quantum trajectories and superoperator algorithms implemented within the matrix product state (MPS) framework are powerful tools to simulate the real-time dynamics of open dissipative quantum systems. As for the unitary case, the reachable time-scales as well as system sizes are limited by the (possible) build-up of entanglement entropy. The aforementioned methods constitute complementary approaches how Lindblad master equations can be integrated relying either on a quasi-exact representation of the full density matrix or a stochastic unraveling of the density matrix in terms of pure states. In this work, we systematically benchmark both methods by studying the dynamics of a Bose-Hubbard chain in the presence of local as well as global dephasing. The build-up as well as system-size scaling of entanglement entropy strongly depends on the method and the parameter regime and we discuss the applicability of the methods for these cases as well as study the distribution of observables and time discretization errors that can become a limiting factor for global dissipation.

arXiv:1411.4831•Nov 18, 2014•52 citations

Efficiency of classical simulations of a noisy Grover algorithm

Raphaël Menu, Johannes Schachenmayer

We analyze the modification of entanglement dynamics in the Grover algorithm when the qubits are subjected to single-qubit amplitude-damping or phase-flip noise. We compare quantum trajectories with full density-matrix simulations, analyzing the dynamics of averaged trajectory entanglement (TE) and operator entanglement (OE), in the respective state representation. Although not a genuine entanglement measure, both TE and OE are connected to the efficiency of matrix product state simulations and thus of fundamental interest. As in many quantum algorithms, at the end of the Grover circuit entanglement decreases as the system converges towards the target product state. While we find that this is well captured in the OE dynamics, quantum trajectories rarely follow paths of reducing entanglement. Optimized unraveling schemes can lower TE slightly, however we show that deep in the circuit OE is generally smaller than TE. This implies that matrix product density operator (MPDO) simulations of quantum circuits can in general be more efficient than quantum trajectories. In addition, we investigate the noise-rate scaling of success probabilities for both amplitude-damping and phase-flip noise in Grover's algorithm.

quant-pharXiv:2602.17569•Feb 20, 2026•0 citations
The cost of classical simulations of quantum many-body dynamics is often determined by the amount of entanglement in the system. In this paper, we study entanglement in stochastic quantum trajectory approaches that solve master equations describing open quantum system dynamics. First, we introduce and compare adaptive trajectory unravelings of master equations. Specifically, building on [Phys. Rev. Lett. 128, 243601 (2022)], we study several greedy algorithms that generate trajectories with a low average entanglement entropy. Second, we consider various conventional unravelings of a one-dimensional open random Brownian circuit and locate the transition points from area- to volume-law-entangled trajectories. Third, we compare various trajectory unravelings using matrix product states with a direct integration of the master equation using matrix product operators. We provide concrete examples of dynamics, for which the simulation cost of stochastic trajectories is exponentially smaller than the one of matrix product operators.
We develop a novel approach aimed at solving the equations of motion of open quantum many-body systems. It is based on a combination of generalized wave function trajectories and matrix product states. We introduce an adaptive quantum stochastic propagator, which minimizes the expected entanglement in the many-body quantum state, thus minimizing the computational cost of the matrix product state representation of each trajectory. We illustrate this approach on the example of a one-dimensional open Brownian circuit. We show that this model displays an entanglement phase transition between area and volume law when changing between different propagators and that our method autonomously finds an efficiently representable area law unraveling.
The dynamics of open quantum systems can be simulated by unraveling it into an ensemble of pure state trajectories undergoing nonunitary monitored evolution, which has recently been shown to undergo measurement-induced entanglement phase transition. Here, we show that, for an arbitrary decoherence channel, one can optimize the unraveling scheme to lower the threshold for entanglement phase transition, thereby enabling efficient classical simulation of the open dynamics for a broader range of decoherence rates. Taking noisy random unitary circuits as a paradigmatic example, we analytically derive the optimum unraveling basis that on average minimizes the threshold. Moreover, we present a heuristic algorithm that adaptively optimizes the unraveling basis for given noise channels, also significantly extending the simulatable regime. When applied to noisy Hamiltonian dynamics, the heuristic approach indeed extends the regime of efficient classical simulation based on matrix product states beyond conventional quantum trajectory methods. Finally, we assess the possibility of using a quasi-local unraveling, which involves multiple qubits and time steps, to efficiently simulate open systems with an arbitrarily small but finite decoherence rate.
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.
Efficient simulation of open quantum systems is central to modeling noisy quantum hardware and many-body dynamics. In trajectory-based tensor network methods, cost is often associated with trajectory-level quantities such as entanglement growth or bond dimension. However, the total cost of a fixed-accuracy simulation also depends on statistical sampling, and the interplay between per-trajectory complexity and sampling effort remains poorly understood. Here we introduce a cost-resolved framework for matrix product state (MPS)-based quantum trajectory simulations that decomposes total cost into memory per trajectory, runtime per trajectory, and sampling effort. We show that physically equivalent stochastic unravelings of the same Lindblad dynamics do not necessarily reduce total cost, but instead redistribute cost between trajectory complexity and statistical convergence. This trade-off is quantified by two dimensionless inflation factors: a bond dimension inflation ααα and a sampling inflation κκκ, which together determine the preferred unraveling under hardware-dependent memory and parallelism constraints. We provide a practical protocol for extracting (α,κ)(α,κ)(α,κ) from modest pilot simulations and demonstrate it using benchmarks across multiple noise channels. The resulting decision maps show that the computationally favorable unraveling can change with noise strength, time-step resolution, system size, and available parallelism. These results establish unraveling choice as a hardware-aware simulation design problem rather than an intrinsic optimization of trajectory entanglement alone.
Quantum trajectories and superoperator algorithms implemented within the matrix product state (MPS) framework are powerful tools to simulate the real-time dynamics of open dissipative quantum systems. As for the unitary case, the reachable time-scales as well as system sizes are limited by the (possible) build-up of entanglement entropy. The aforementioned methods constitute complementary approaches how Lindblad master equations can be integrated relying either on a quasi-exact representation of the full density matrix or a stochastic unraveling of the density matrix in terms of pure states. In this work, we systematically benchmark both methods by studying the dynamics of a Bose-Hubbard chain in the presence of local as well as global dephasing. The build-up as well as system-size scaling of entanglement entropy strongly depends on the method and the parameter regime and we discuss the applicability of the methods for these cases as well as study the distribution of observables and time discretization errors that can become a limiting factor for global dissipation.
We analyze the modification of entanglement dynamics in the Grover algorithm when the qubits are subjected to single-qubit amplitude-damping or phase-flip noise. We compare quantum trajectories with full density-matrix simulations, analyzing the dynamics of averaged trajectory entanglement (TE) and operator entanglement (OE), in the respective state representation. Although not a genuine entanglement measure, both TE and OE are connected to the efficiency of matrix product state simulations and thus of fundamental interest. As in many quantum algorithms, at the end of the Grover circuit entanglement decreases as the system converges towards the target product state. While we find that this is well captured in the OE dynamics, quantum trajectories rarely follow paths of reducing entanglement. Optimized unraveling schemes can lower TE slightly, however we show that deep in the circuit OE is generally smaller than TE. This implies that matrix product density operator (MPDO) simulations of quantum circuits can in general be more efficient than quantum trajectories. In addition, we investigate the noise-rate scaling of success probabilities for both amplitude-damping and phase-flip noise in Grover's algorithm.