Quantum information transfer between entangled black holes has inspired many-body teleportation protocols. We study such a protocol without assuming a gravitational dual and ask whether its fidelity requires nonstabilizerness, or magic, in the scrambling dynamics. Because the mean fidelity depends only on the third moments of the scrambler ensemble, zero-magic Clifford scramblers teleport on average as well as Haar-random unitaries. Solving the protocol exactly at infinite temperature, we find that typical Clifford scramblers approach perfect teleportation while the magic of the complete circuit vanishes as the inverse system size. The two ensembles nevertheless differ in their fluctuations: the exact Clifford fidelity variance decays only algebraically with system size, whereas the Haar variance is exponentially small. This separation characterizes the ensembles rather than magic itself, since magic added away from the message qubit can leave every fidelity statistic unchanged. With a decoder uncorrelated with the scrambler, every unitary 2-design leaves the mean fidelity at the no-transfer value, whatever its magic.
Comments
8 pages. To be communicated to a Journal soon. Comments will be highly appreciated
Quantum information transfer between entangled black holes has inspired many-body teleportation protocols. We study such a protocol without assuming a gravitational dual and ask whether its fidelity requires nonstabilizerness, or magic, in the scrambling dynamics. Because the mean fidelity depends only on the third moments of the scrambler ensemble, zero-magic Clifford scramblers teleport on average as well as Haar-random unitaries. Solving the protocol exactly at infinite temperature, we find that typical Clifford scramblers approach perfect teleportation while the magic of the complete circuit vanishes as the inverse system size. The two ensembles nevertheless differ in their fluctuations: the exact Clifford fidelity variance decays only algebraically with system size, whereas the Haar variance is exponentially small. This separation characterizes the ensembles rather than magic itself, since magic added away from the message qubit can leave every fidelity statistic unchanged. With a decoder uncorrelated with the scrambler, every unitary 2-design leaves the mean fidelity at the no-transfer value, whatever its magic.
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.
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.
We investigate the dynamics of nonstabilizerness—also known as “magic”—in monitored quantum circuits composed of random Clifford unitaries and local measurements. For measurements in the computational basis, we derive an analytical model for dynamics of the stabilizer nullity, showing that it decays in quantized steps and requires exponentially many measurements to vanish, which reveals the strong protection through Clifford scrambling. On the other hand, for measurements performed in rotated non-Clifford bases, measurements can both create and destroy nonstabilizerness. Here, the dynamics leads to a steady state with nontrivial nonstabilizerness, independent of the initial state. We find that Haar-random states equilibrate in constant time, whereas stabilizer states exhibit linear-in-size relaxation time. While the stabilizer nullity is insensitive to the rotation angle, stabilizer Rényi entropies expose a richer structure in their dynamics. Our results uncover sharp distinctions between coarse and fine-grained nonstabilizerness diagnostics and demonstrate how measurements can both suppress and sustain quantum computational resources.
Quantum magic resources, or nonstabilizerness, are a central ingredient for universal quantum computation. In noisy many-body systems, the interplay between these resources and errors leads to sharp magic phase transitions. However, the microscopic mechanism behind these critical phenomena is still an open question, especially since early empirical evidence showed conflicting results regarding their universality classes. In this work, we provide a comprehensive picture of magic phase transitions for the class of encoding-decoding quantum circuits to resolve these ambiguities. We analytically show that the behavior of magic resources is fundamentally dictated by the chosen measurement protocol. When we fix, or post-select, the class of measurement syndromes, the magic transition inherits the universal features of the error-resilience phase transition in the circuits. Interestingly, this clean transition survives even for fully random Haar encoders showing that it is a consequence of initial's state retrieval, and not an artifact of the Clifford encoders. On the other hand, if we consider realistic Born-rule sampling, the intrinsic statistical fluctuations of a given syndrome measurement act as a relevant perturbation. This brings in strong finite-size drifts and an apparent multifractality, which end up altering the critical behavior of the system. We reveal that magic phase transitions are actually direct manifestations of error-resilience thresholds, rather than independent critical phenomena, reconciling conflicting observations from the earlier literature. Ultimately, our framework clarifies how the quantum computational power can survive, or be irreversibly destroyed, due to the competition between scrambling, measurements, and errors.
Unlike standard quantum teleportation, many-body teleportation uses scrambling to transmit quantum information. In this protocol, initially localized information spreads over many degrees of freedom and is later refocused at the receiver by a simple coupling between the systems, followed by further many-body evolution. The protocol was developed from models of traversable wormholes in holography and has become a useful probe of scrambling. In particular, it can distinguish genuine scrambling from decoherence or noise when out-of-time-order correlators fail, and can reveal signatures of different scrambling mechanisms, including the distinctive behavior expected in holographic systems. Holography predicts that related protocols can transmit information between selected boundaries of multi-boundary wormhole geometries. Motivated by this setting, we study single-qubit many-body teleportation among three systems of qubits. The initial state consists of EPR pairs distributed among them, providing a simple analogue of an infinite-temperature three-boundary holographic state. We analyze the protocol with one-dimensional and all-to-all dynamics, both analytically and numerically using random circuits. We find that the third system suppresses teleportation once the spreading message reaches the region of qubits that are entangled with it. In one dimension, both the minimum coupling required for successful teleportation and the fidelity depend on the distance from the injection site to this region, a feature reminiscent of holographic causal shadows. For all-to-all dynamics, successful teleportation is instead restricted to early times and to sufficiently few qubits entangled with the third system. A third system therefore provides spatial, or subsystem, resolution of information spreading that is absent from the two-sided protocol. Our results offer a step toward many-body teleportation networks.
Abstract Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full n -qubit group, one often resorts to t -designs. Unitary t -designs mimic the Haar-measure up to t -th moments. It is known that Clifford operations can implement at most 3-designs. In this work, we quantify the non-Clifford resources required to break this barrier. We find that it suffices to inject O(t4log2(t)log(1/ε)) O ( t 4 log 2 ( t ) log ( 1 / ε ) ) many non-Clifford gates into a polynomial-depth random Clifford circuit to obtain an ε ε -approximate t -design. Strikingly, the number of non-Clifford gates required is independent of the system size – asymptotically, the density of non-Clifford gates is allowed to tend to zero. We also derive novel bounds on the convergence time of random Clifford circuits to the t -th moment of the uniform distribution on the Clifford group. Our proofs exploit a recently developed variant of Schur-Weyl duality for the Clifford group, as well as bounds on restricted spectral gaps of averaging operators.