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:2610.22318

Magic in quantum trajectory unravelings of noisy random quantum circuits

Sara Santos, Alessio Paviglianiti, Vincenzo Savona

quant-phSubmitted Oct 15, 2026• Announced Oct 16, 2026• 0 citations
arXivHTMLPDF

Abstract

The quantum-trajectory description of a noisy quantum circuit is not unique: every Kraus representation of the noise channel defines a different unraveling, i.e., a different ensemble of pure states that averages to the same density matrix. While all unravelings share the same expectation values of observables, they generally differ in the amount of quantum resources carried by the individual trajectories. Here we study non-stabilizerness, or magic, quantified by the stabilizer Rényi entropy, in quantum-trajectory unravelings of Haar-random and $T$-doped random Clifford brickwork circuits subject to local dephasing noise of strength $p$. The canonical unraveling in terms of Pauli jumps is Clifford and leaves magic untouched, so that trajectories retain the Haar-random value of non-stabilizerness. Exploring the full two-parameter family of minimal unravelings, we find that the trajectory-averaged magic can be substantially reduced by a state-independent choice of Kraus operators, and that the optimal choice is not in general the projective-measurement unraveling, but a two-outcome generalized measurement in which the Kraus operators correspond to a weak measurement of the noisy qubit. The optimal unraveling reduces the extensive magic density of the trajectories by a $p$-dependent factor without altering its linear scaling with system size. At the same time, it produces a very broad distribution of magic over trajectories, with a sizable fraction of trajectories retaining Haar-random magic. Since the cost of stabilizer-based classical simulation grows exponentially with the magic of the state, these high-magic trajectories, rather than the average, control the simulation cost. Our results delineate the potential and the limitations of unraveling optimization as a route to the classical simulation of noisy quantum dynamics with stabilizer methods.

Comments
19 pages, 14 figures

Related papers

Noise-induced classical phases in optimally-unraveled random quantum circuits

Lorenzo Fioroni, Filippo Ferrari, Emanuele Tirrito

We study the classical simulability of open quantum dynamics using random Clifford circuits doped with non-Clifford phase rotations and subject to local noise. We unravel the dynamics into stochastic quantum trajectories simulated with Clifford-augmented matrix product states, and introduce a simulation cost that quantifies the classical resources required. Optimizing this cost over stochastic unravelings, we identify noise-induced classical phases: extended parameter regions in which the dynamics can be fully disentangled by Clifford operations at arbitrary circuit depth. Their existence depends on both the noise model \emph{and} the unraveling. Using a geometric representation of quantum channels, we analytically determine optimal unravelings for a broad class of noise models, with numerical simulations confirming the predicted phase boundaries. We further relate the optimal cost to the unraveling-independent nonstabilizerness of the channel and show that, together with trajectory-resolved entanglement and nonstabilizerness, it classifies distinct dynamical regimes. Finally, we show that these classical phases disappear in the averaged density-matrix description, where no unraveling freedom remains. Our results show that the emergence of classicality in noisy random circuits depends on the measurement scheme adopted to probe it, and paves the way to further studies on the classical simulability of driven-dissipative dynamics.

quant-pharXiv:2609.16160•Sep 16, 2026•0 citations

Variance-Reduced Trajectory Unravelings for GPU Noisy Quantum-Circuit Simulation: Characterization and a Qiskit-Aer Integration Gap

Chun-Yeol You

Monte-Carlo trajectory (quantum-jump) methods are the practical route to simulating noisy quantum circuits once the exact density-matrix method is precluded by its $4^n$ memory cost. Their bottleneck is estimator variance: resolving one expectation value can demand thousands of trajectories. Recent tensor-network work shows that \emph{variance-reduced unravelings} -- projector and analog sampling -- sharply cut this variance, but only on CPU matrix-product-state backends, with no path into production tooling. We implement both unravelings on a \emph{GPU dense-statevector} trajectory engine and validate them against the exact density matrix (ideal-circuit fidelity $1-2.2\times10^{-16}$; $1/\sqrt{N}$ convergence; all unravelings unbiased to trace distance $<0.01$). On a single consumer GPU, projector unraveling reaches a target standard error with $20.8\times$ fewer trajectories than Qiskit-Aer's \texttt{batched\_shots\_gpu} at $n=10$, a factor that holds at $19$--$26\times$ across $n=8$--$20$. A regime map places analog sampling optimal at weak noise and projector at strong noise, crossing near $γt\approx0.35$. We further report a systems finding: Qiskit-Aer applies noise at the \emph{channel} level and reconstructs a canonical Kraus decomposition at apply time, discarding any user-supplied unraveling, so variance-reduced unravelings cannot be delivered through its public API. Because Aer's Born-rule collapse machinery already exists, we specify a minimal change that would unlock the technique in production.

quant-pharXiv:2607.17678•Jul 21, 2026•0 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•12 citations

Universal Non-stabilizerness Dynamics Across Quantum Phase Transitions

András Grabarits, Adolfo del Campo

Quantum magic, or non-stabilizerness, is an important quantum resource that characterizes computational power beyond classically simulable Clifford operations and is therefore essential for achieving quantum advantage. While previous studies have explored non-stabilizerness dynamics in random circuits and under time-independent generators, here we extend the study of its universal dynamics to time-dependent driving across quantum phase transitions. In particular, we show that the stabilizer Rényi entropies and the cumulants of the Pauli spectrum exhibit universal power-law scaling with the driving rate in slow processes. Moreover, we show that the logarithmic Pauli spectrum is asymptotically Gaussian, implying a lognormal distribution for the Pauli spectrum values. Our results are explicitly demonstrated by exact results in the transverse-field Ising model and by analytical approximations in long-range Kitaev models.

quant-pharXiv:2603.08841•Mar 11, 2026•0 citations

Noisy quantum circuit simulation with the tensor jump method

Maximilian Fröhlich, Aaron Sander, Martin Eigel +2 more

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.

quant-pharXiv:2607.01323•Jul 3, 2026•0 citations

Quantum magic dynamics in random circuits

Yuzhen Zhang, Yingfei Gu

Magic refers to the degree of “quantumness” in a system that cannot be fully described by stabilizer states and Clifford operations alone. In quantum computing, stabilizer states and Clifford operations can be efficiently simulated on a classical computer, even though they may appear complicated from the perspective of entanglement. In this sense, magic is a crucial resource for unlocking the unique computational power of quantum computers to address problems that are classically intractable. Magic can be quantified by measures such as Wigner negativity and mana that satisfy fundamental properties such as monotonicity under Clifford operations. In this paper, we generalize the statistical mechanical mapping methods of large- q random circuits to the calculation of Rényi Wigner negativity and mana. Based on this, we find: (1) a precise formula describing the competition between magic and entanglement in many-body states prepared under Haar random circuits; (2) a formula describing the spreading and scrambling of magic in states evolved under random Clifford circuits; (3) a quantitative description of magic “squeezing” and “teleportation” under measurements. Finally, we comment on the relation between coherent information and magic.

arXiv:2410.21128•npj Quantum Information•May 14, 2026•7 citations
The quantum-trajectory description of a noisy quantum circuit is not unique: every Kraus representation of the noise channel defines a different unraveling, i.e., a different ensemble of pure states that averages to the same density matrix. While all unravelings share the same expectation values of observables, they generally differ in the amount of quantum resources carried by the individual trajectories. Here we study non-stabilizerness, or magic, quantified by the stabilizer Rényi entropy, in quantum-trajectory unravelings of Haar-random and TTT-doped random Clifford brickwork circuits subject to local dephasing noise of strength ppp. The canonical unraveling in terms of Pauli jumps is Clifford and leaves magic untouched, so that trajectories retain the Haar-random value of non-stabilizerness. Exploring the full two-parameter family of minimal unravelings, we find that the trajectory-averaged magic can be substantially reduced by a state-independent choice of Kraus operators, and that the optimal choice is not in general the projective-measurement unraveling, but a two-outcome generalized measurement in which the Kraus operators correspond to a weak measurement of the noisy qubit. The optimal unraveling reduces the extensive magic density of the trajectories by a ppp-dependent factor without altering its linear scaling with system size. At the same time, it produces a very broad distribution of magic over trajectories, with a sizable fraction of trajectories retaining Haar-random magic. Since the cost of stabilizer-based classical simulation grows exponentially with the magic of the state, these high-magic trajectories, rather than the average, control the simulation cost. Our results delineate the potential and the limitations of unraveling optimization as a route to the classical simulation of noisy quantum dynamics with stabilizer methods.
We study the classical simulability of open quantum dynamics using random Clifford circuits doped with non-Clifford phase rotations and subject to local noise. We unravel the dynamics into stochastic quantum trajectories simulated with Clifford-augmented matrix product states, and introduce a simulation cost that quantifies the classical resources required. Optimizing this cost over stochastic unravelings, we identify noise-induced classical phases: extended parameter regions in which the dynamics can be fully disentangled by Clifford operations at arbitrary circuit depth. Their existence depends on both the noise model \emph{and} the unraveling. Using a geometric representation of quantum channels, we analytically determine optimal unravelings for a broad class of noise models, with numerical simulations confirming the predicted phase boundaries. We further relate the optimal cost to the unraveling-independent nonstabilizerness of the channel and show that, together with trajectory-resolved entanglement and nonstabilizerness, it classifies distinct dynamical regimes. Finally, we show that these classical phases disappear in the averaged density-matrix description, where no unraveling freedom remains. Our results show that the emergence of classicality in noisy random circuits depends on the measurement scheme adopted to probe it, and paves the way to further studies on the classical simulability of driven-dissipative dynamics.
Monte-Carlo trajectory (quantum-jump) methods are the practical route to simulating noisy quantum circuits once the exact density-matrix method is precluded by its 4n4^n4n memory cost. Their bottleneck is estimator variance: resolving one expectation value can demand thousands of trajectories. Recent tensor-network work shows that \emph{variance-reduced unravelings} -- projector and analog sampling -- sharply cut this variance, but only on CPU matrix-product-state backends, with no path into production tooling. We implement both unravelings on a \emph{GPU dense-statevector} trajectory engine and validate them against the exact density matrix (ideal-circuit fidelity 1−2.2×10−161-2.2\times10^{-16}1−2.2×10−16; 1/N1/\sqrt{N}1/N​ convergence; all unravelings unbiased to trace distance <0.01<0.01<0.01). On a single consumer GPU, projector unraveling reaches a target standard error with 20.8×20.8\times20.8× fewer trajectories than Qiskit-Aer's \texttt{batched\_shots\_gpu} at n=10n=10n=10, a factor that holds at 191919--26×26\times26× across n=8n=8n=8--202020. A regime map places analog sampling optimal at weak noise and projector at strong noise, crossing near γt≈0.35γt\approx0.35γt≈0.35. We further report a systems finding: Qiskit-Aer applies noise at the \emph{channel} level and reconstructs a canonical Kraus decomposition at apply time, discarding any user-supplied unraveling, so variance-reduced unravelings cannot be delivered through its public API. Because Aer's Born-rule collapse machinery already exists, we specify a minimal change that would unlock the technique in production.
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.
Quantum magic, or non-stabilizerness, is an important quantum resource that characterizes computational power beyond classically simulable Clifford operations and is therefore essential for achieving quantum advantage. While previous studies have explored non-stabilizerness dynamics in random circuits and under time-independent generators, here we extend the study of its universal dynamics to time-dependent driving across quantum phase transitions. In particular, we show that the stabilizer Rényi entropies and the cumulants of the Pauli spectrum exhibit universal power-law scaling with the driving rate in slow processes. Moreover, we show that the logarithmic Pauli spectrum is asymptotically Gaussian, implying a lognormal distribution for the Pauli spectrum values. Our results are explicitly demonstrated by exact results in the transverse-field Ising model and by analytical approximations in long-range Kitaev models.
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.
Magic refers to the degree of “quantumness” in a system that cannot be fully described by stabilizer states and Clifford operations alone. In quantum computing, stabilizer states and Clifford operations can be efficiently simulated on a classical computer, even though they may appear complicated from the perspective of entanglement. In this sense, magic is a crucial resource for unlocking the unique computational power of quantum computers to address problems that are classically intractable. Magic can be quantified by measures such as Wigner negativity and mana that satisfy fundamental properties such as monotonicity under Clifford operations. In this paper, we generalize the statistical mechanical mapping methods of large- q random circuits to the calculation of Rényi Wigner negativity and mana. Based on this, we find: (1) a precise formula describing the competition between magic and entanglement in many-body states prepared under Haar random circuits; (2) a formula describing the spreading and scrambling of magic in states evolved under random Clifford circuits; (3) a quantitative description of magic “squeezing” and “teleportation” under measurements. Finally, we comment on the relation between coherent information and magic.