Classifies finite-field Clifford dual-unitary gates into q-2 perfect-tensor cores and others, deriving exact masking distances d1(t)=4t and d2(t)=4t-2 for perfect-tensor circuits.
hub
Entanglement in the stabilizer formalism
20 Pith papers cite this work. Polarity classification is still indexing.
20
Pith papers citing it
abstract
We define a multi-partite entanglement measure for stabilizer states, which can be computed efficiently from a set of generators of the stabilizer group. Our measure applies to qubits, qudits and continuous variables.
hub tools
citation-role summary
background 1
method 1
citation-polarity summary
representative citing papers
The five-cycle graph state |C5> is the unique (up to local Clifford) 1-resistant five-qubit stabilizer state; no seven-qubit stabilizer state is m-resistant for nonzero admissible m.
A reduction from weak agnostic learning of class C to efficient tomography of states with bounded l1-extent w.r.t. C, with a concrete algorithm for stabilizer states running in poly(n, (ξ/ε)^log(ξ/ε)) time.
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
Introduces subdimensional entanglement entropy (SEE) as a probe of geometric-topological responses in quantum phases and establishes a bulk-to-mixed-state holographic correspondence via strong and weak symmetries on subdimensional subsystems.
Analytical and numerical study of stabilizer nullity and Rényi entropies in monitored Clifford circuits shows quantized decay for computational measurements and size-dependent relaxation to a non-trivial steady state for rotated bases.
Introduces a minimal matchgate circuit representation for fermionic Gaussian states together with a Yang-Baxter update algorithm, then maps out entanglement transitions in unitary circuit games under braiding and generic matchgate rules.
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.
Entanglement purity in quadratic-phase states over finite fields is exactly determined by the rank of the phase matrix, with AME states existing precisely when all bipartition submatrices have full rank.
Decoherence of the color code produces a mixed state with topological entanglement negativity ln 2 that corresponds to an emergent single toric code.
Long-range competing two- and three-qubit measurements in quantum circuits produce measurement-range-dependent steady states featuring SPT order and non-area-law entanglement.
Higher moments of entanglement entropy distribution in hybrid quantum circuits distinguish measurement-induced phases and are captured by a phenomenological model for area-law combined with directed polymer description for volume-law.
BURY heuristic partitions graph states across QPUs by minimizing maximum matching sizes between partitions, requiring fewer Bell pairs than standard k-partition methods and lowering cut-rank.
Measurement-only circuits realize gapless SPT phases with nontrivial edge states at criticality, including symmetry-enriched percolation in Ising models and persistent Z4 gSPT phases mapped to Majorana loop models.
Long-range measurement-only Clifford circuits display several entanglement and scrambling phases, including a structured-circuit phase with volume-law entanglement, long-range correlations, rapid ancilla purification, and no scrambling.
Geometric study of non-stabilizerness in few-qubit systems via trace distance to the stabilizer polytope, with state sampling, measure comparisons, an analytical expression, facet classification, and a concentration bound linking it to entanglement.
LC-inequivalent graph-state blocks in random Clifford circuits yield distinct entanglement velocities v_E and butterfly velocities v_B, correlated with internal entanglement distribution and graph connectivity.
A graph-based method is proposed to study entanglement entropy in CSS quantum codes, with illustrations on toric codes and quantum LDPC codes showing scaling behavior.
citing papers explorer
-
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.