Defines antiflatness of entanglement spectra, introduces antiflat majorization and FPOs for state convertibility, unifies measures via escort distributions and Bregman divergences, expresses Capacity of Entanglement as KL divergence derivative linked to QFI, and identifies maximal antiflatness on a
Magic-induced computational separation in entanglement theory
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
abstract
Entanglement serves as a foundational pillar in quantum information theory, delineating the boundary between what is classical and what is quantum. The common assumption is that higher entanglement corresponds to a greater degree of `quantumness'. However, this folk belief is challenged by the fact that classically simulable operations, such as Clifford circuits, can create highly entangled states. The simulability of these states raises a question: what are the differences between `low-magic' entanglement, and `high-magic' entanglement? We answer this question in this work with a rigorous investigation into the role of magic in entanglement theory. We take an operational approach to understanding this relationship by studying tasks such as entanglement estimation, distillation and dilution. This approach reveals that magic has notable implications for entanglement. Specifically, we find an operational separation that divides Hilbert space into two distinct regimes: the entanglement-dominated (ED) phase and magic-dominated (MD) phase. Roughly speaking, ED states have entanglement that significantly surpasses their magic, while MD states have magic that dominates their entanglement. The competition between the two resources in these two phases induces a computational phase separation between them: there are {sample- and time-efficient} quantum algorithms for almost any entanglement task on ED states, while these tasks are {provably computationally intractable} in the MD phase. Our results find applications in diverse areas such as quantum error correction, many-body physics, and the study of quantum chaos, providing a unifying framework for understanding the behavior of quantum systems. We also offer theoretical explanations for previous numerical observations, highlighting the broad implications of the ED-MD distinction across various subfields of physics.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 6roles
background 1polarities
background 1representative citing papers
Entanglement entropy bounds the variance of Trotter error downward, and magic drives the error kurtosis downward (Kur = α + βM, β<0 for large systems).
Introduces a purity-encoding algorithm for estimating α-Stabilizer Rényi Entropies of unknown quantum states for integer α > 1, with benchmarks and a non-stabilizerness/entanglement link.
Develops an optimization-free disentangling algorithm and algebraic criterion for efficient CAMPS representations of Clifford circuits doped with αI+βP gates, enabling polynomial classical simulation for more circuits including typical N-T-gate random instances.
Mutual information between non-contractible regions on the torus fully classifies long-range nonstabilizerness for toric-code states but leaves a finite subset undetected in the doubled-Fibonacci string-net model.
Monitored random quantum circuits lack divergent multipartite entanglement at criticality unlike standard critical systems, but two-site measurements with a protection mechanism enable genuinely multipartite entangled phases.
citing papers explorer
-
A journey through Flatland: What does the antiflatness of a spectrum teach us?
Defines antiflatness of entanglement spectra, introduces antiflat majorization and FPOs for state convertibility, unifies measures via escort distributions and Bregman divergences, expresses Capacity of Entanglement as KL divergence derivative linked to QFI, and identifies maximal antiflatness on a
-
Taming Trotter Errors with Quantum Resources
Entanglement entropy bounds the variance of Trotter error downward, and magic drives the error kurtosis downward (Kur = α + βM, β<0 for large systems).
-
An Algorithm for Estimating $\alpha$-Stabilizer R\'enyi Entropies via Purity
Introduces a purity-encoding algorithm for estimating α-Stabilizer Rényi Entropies of unknown quantum states for integer α > 1, with benchmarks and a non-stabilizerness/entanglement link.
-
Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
Develops an optimization-free disentangling algorithm and algebraic criterion for efficient CAMPS representations of Clifford circuits doped with αI+βP gates, enabling polynomial classical simulation for more circuits including typical N-T-gate random instances.
-
Long-range nonstabilizerness of topologically encoded states from mutual information
Mutual information between non-contractible regions on the torus fully classifies long-range nonstabilizerness for toric-code states but leaves a finite subset undetected in the doubled-Fibonacci string-net model.
-
Multipartite entanglement structure of monitored quantum circuits
Monitored random quantum circuits lack divergent multipartite entanglement at criticality unlike standard critical systems, but two-site measurements with a protection mechanism enable genuinely multipartite entangled phases.