Bridging Entanglement and Magic Resources within Operator Space

• URL: http://arxiv.org/abs/2501.18679v3
• Date: Wed, 15 Oct 2025 15:32:44 GMT
• Title: Bridging Entanglement and Magic Resources within Operator Space
• Authors: Neil Dowling, Kavan Modi, Gregory A. L. White,
• Abstract summary: We show that LOE is always upper-bound by three distinct magic monotones: $T$-count, unitary nullity, and operator stabilizer R'enyi entropy.<n>Our results imply that an operator evolution that is expensive to simulate using tensor network methods must also be inefficient using both stabilizer and Pauli truncation methods.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Local-operator entanglement (LOE) dictates the complexity of simulating Heisenberg evolution using tensor network methods, {and bears witness to many-body chaos for local dynamics}. We show that LOE is also sensitive to how non-Clifford a unitary is: its magic resources. In particular, we prove that LOE is always upper-bound by three distinct magic monotones: $T$-count, unitary nullity, and operator stabilizer R\'enyi entropy. Moreover, in the average case for large, random circuits, LOE and magic monotones approximately coincide. Our results imply that an operator evolution that is expensive to simulate using tensor network methods must also be inefficient using both stabilizer and Pauli truncation methods. {In terms of a previous conjecture on the characteristic scaling of LOE, our results also mean that non-integrable spin chains cannot be simulated classically}. Entanglement in operator space therefore measures a unified picture of non-classical resources, in stark contrast to the Schr\"odinger picture.

Related papers

• Operator delocalization in disordered spin chains via exact MPO marginals [0.0]
  We introduce a complementary measure of operator complexity: the operator length.<n>Both quantities are defined from the expansion of time-evolved operators in the Pauli basis.<n>We show that both the operator mass and length can be computed efficiently and exactly within a matrix-productoperator framework.
  arXiv  Detail & Related papers  (2026-01-18T15:03:25Z)
• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• Advantage of utilizing nonlocal magic resource in Haar-random circuits [13.89684973179205]
  In design and simulation of quantum circuits with multiple units, the computational ability is greatly limited by quickly increasing entanglement.<n>We uncover an intrinsic scaling law of the nonlocal magic resource and the bond dimension of matrix product states in Haar-random quantum circuits.
  arXiv  Detail & Related papers  (2025-09-30T14:48:55Z)
• Unveiling Connections between Tensor Network and Stabilizer Formalism by Cutting in Time [17.890941556296788]
  We show that the complexity, quantified by entanglement, is governed by the interplay of two types of quantum resources, coherence and magic.<n>For the stabilizer formalism approach, we propose an operator stabilizer formalism to enable its application to arbitrary $O$.
  arXiv  Detail & Related papers  (2025-05-14T16:03:18Z)
• An Exact Link between Nonlocal Magic and Operator Entanglement [0.0]
  Nonstabilizerness, commonly referred to as magic, is a quantum property of states associated with the non-Clifford resources required for their preparation. We establish an exact correspondence between the generation of nonlocal magic and operator entanglement under unitary evolutions.
  arXiv  Detail & Related papers  (2025-04-12T22:40:04Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Non-unitarity maximizing unraveling of open quantum dynamics [0.0]
  We introduce a new unraveling strategy that can adaptively minimize the averaged entanglement in the trajectory states.<n>We show that for the quantum circuits considered here, unraveling methods are much less efficient than full matrix product density operator simulations.
  arXiv  Detail & Related papers  (2024-10-15T15:25:39Z)
• Magic of the Heisenberg Picture [0.0]
  We study a non-stabilizerness resource theory for operators, which is dual to that describing states. We identify that the stabilizer R'enyi entropy analog in operator space is a good magic monotone satisfying the usual conditions. This monotone reveals structural properties of many-body magic generation, and can inspire Clifford-assisted tensor network methods.
  arXiv  Detail & Related papers  (2024-08-28T18:00:01Z)
• Lindbladian reverse engineering for general non-equilibrium steady states: A scalable null-space approach [49.1574468325115]
  We introduce a method for reconstructing the corresponding Lindbaldian master equation given any target NESS. The kernel (null-space) of the correlation matrix corresponds to Lindbladian solutions. We illustrate the method in different systems, ranging from bosonic Gaussian to dissipative-driven collective spins.
  arXiv  Detail & Related papers  (2024-08-09T19:00:18Z)
• Exact dynamics of quantum dissipative $XX$ models: Wannier-Stark localization in the fragmented operator space [49.1574468325115]
  We find an exceptional point at a critical dissipation strength that separates oscillating and non-oscillating decay. We also describe a different type of dissipation that leads to a single decay mode in the whole operator subspace.
  arXiv  Detail & Related papers  (2024-05-27T16:11:39Z)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• Quantum Lyapunov exponent in dissipative systems [68.8204255655161]
  The out-of-time order correlator (OTOC) has been widely studied in closed quantum systems. We study the interplay between these two processes. The OTOC decay rate is closely related to the classical Lyapunov.
  arXiv  Detail & Related papers  (2022-11-11T17:06:45Z)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• Noisy atomic magnetometry in real time [0.0]
  Continuously monitored atomic spin-ensembles allow, in principle, for real-time sensing of external magnetic fields. We study how conclusions based on Kalman filtering methods change when inevitable imperfections are taken into account. We prove that even an infinitesimal amount of noise disallows the error to be arbitrarily diminished.
  arXiv  Detail & Related papers  (2021-03-22T17:28:40Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• The principle of majorization: application to random quantum circuits [68.8204255655161]
  Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. We verified that all the families of circuits satisfy on average the principle of majorization. Clear differences appear in the fluctuations of the Lorenz curves associated to states.
  arXiv  Detail & Related papers  (2021-02-19T16:07:09Z)
• The axiomatic and the operational approaches to resource theories of magic do not coincide [1.6758573326215689]
  We argue that proposed stabiliser-based simulation techniques of CSP maps are strictly more powerful than Gottesman-Knill-like methods. The result is analogous to a well-known fact in entanglement theory, namely that there is a gap between the operationally defined class of local operations and classical communication.
  arXiv  Detail & Related papers  (2020-11-23T19:00:04Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)
• Debiased Sinkhorn barycenters [110.79706180350507]
  Entropy regularization in optimal transport (OT) has been the driver of many recent interests for Wasserstein metrics and barycenters in machine learning. We show how this bias is tightly linked to the reference measure that defines the entropy regularizer. We propose debiased Wasserstein barycenters that preserve the best of both worlds: fast Sinkhorn-like iterations without entropy smoothing.
  arXiv  Detail & Related papers  (2020-06-03T23:06:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.