Optimized Trajectory Unraveling for Classical Simulation of Noisy Quantum Dynamics

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.

Authors

Institutions

Publication Details

Journal
Physical Review Letters
Published
2024-12-06
DOI
https://doi.org/10.1103/physrevlett.133.230403
Citations
8
Primary Topic
Quantum many-body systems
Type
article
Field-Weighted Citation Impact
2.70

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimized Trajectory Unraveling for Classical Simulation of Noisy Quantum Dynamics

Yimu Bao, Soonwon Choi, Zhuo Chen
8 citations
Physical Review Letters
Quantum many-body systems
2.70
article

Optimized Trajectory Unraveling for Classical Simulation of Noisy Quantum Dynamics

Yimu Bao, Soonwon Choi, Zhuo Chen
article en
8 citations

Abstract

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.

Physical Review LettersVol. 133(23)
University of California System (US), The NSF AI Institute for Artificial Intelligence and Fundamental Interactions (US), Massachusetts Institute of Technology (US)
National Science Foundation, Defense Advanced Research Projects Agency
Openalex Percentile: Top 9%
Quantum many-body systems
2.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.