arXiv:2610.22318
Magic in quantum trajectory unravelings of noisy random quantum circuits
Sara Santos, Alessio Paviglianiti, Vincenzo Savona
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.
AI Summary
A noisy channel admits different Kraus unravelings that reproduce the same density matrix but carry different pure-state resources. This paper asks whether choosing the unraveling can reduce trajectory magic and thereby aid stabilizer-based simulation. It numerically studies one-dimensional Haar-random and $T$-doped random Clifford brickwork circuits with local dephasing, $\mathcal D_p(\rho)=(1-p)\rho+pZ\rho Z$. Exact second stabilizer Rényi entropy $M_2$ calculations cover the full two-parameter family of minimal, two-outcome unravelings and a three-outcome projective-measurement unraveling. Most scans use eight qubits; size scaling reaches twelve. Canonical Pauli-jump noise preserves trajectory magic. In Haar-random circuits, a fixed, state-independent unraveling with two weak-measurement branches lowers average magic more than the projective unraveling. At low $T$ doping, projective unraveling instead performs best among those tested. Haar-circuit scaling data for $6\leq n\leq12$ indicate extensive residual magic with a reduced noise-dependent density. A perturbative argument establishes agreement between projective and a particular quantum-jump unraveling through first order in $p$, with discrepancy bounded as $\mathcal O(nN_Lp^2)$ at fixed size and depth. Trajectory histograms for that quantum-jump unraveling are broad, including near-Haar-magic trajectories. This motivates distinguishing average magic from an exponentially resource-dependent simulation cost; no simulator speedup is demonstrated. Stated limitations include small systems, unresolved size scaling of the high-magic tail, and restriction to fixed local unravelings. Adaptive strategies, observable-estimation costs, and joint optimization of magic and entanglement remain open.
Central claim may not hold: The abstract attributes broad magic distributions and substantial near-Haar populations to the optimal unraveling, but all reported histograms use the distinct, nonoptimal quantum-jump unraveling. The reported system-size scaling tests optimized Haar circuits only, so the conclusion that optimized magic remains extensive in T-doped circuits lacks a corresponding scaling study. The claim that high-magic trajectories control the optimal unraveling's simulation cost is not established by the reported nonoptimal-unraveling histograms, an algorithm-specific cost analysis, or the unresolved system-size dependence of the tail. Appendix B's second equality in Eq. (M2_expansion) omits a factor of two from the restricted anticommutator sum, although correcting it preserves the stated first-order ensemble cancellation.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 19 pages, 14 figures