pith. sign in

arxiv: quant-ph/0406168 · v1 · submitted 2004-06-23 · 🪐 quant-ph

Entanglement in the stabilizer formalism

classification 🪐 quant-ph
keywords stabilizerentanglementmeasureappliescomputedcontinuousdefineefficiently
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 16 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A journey through Flatland: What does the antiflatness of a spectrum teach us?

    quant-ph 2026-05 unverdicted novelty 7.0

    Introduces antiflatness of entanglement spectra, antiflat majorization based on Rényi entropy spread, and unifies measures via escort distributions while connecting capacity of entanglement to quantum Fisher information.

  2. Entanglement-Rank Duality in Quadratic Phase Quantum States

    quant-ph 2026-05 unverdicted novelty 7.0

    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.

  3. Decohered color code and emerging mixed toric code by anyon proliferation: Topological entanglement negativity perspective

    quant-ph 2026-04 unverdicted novelty 7.0

    Decoherence of the color code produces a mixed state with topological entanglement negativity ln 2 that corresponds to an emergent single toric code.

  4. Subdimensional Entanglement Entropy: From Geometric-Topological Response to Mixed-State Holography

    cond-mat.str-el 2025-10 unverdicted novelty 7.0

    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 s...

  5. Rise and fall of nonstabilizerness via random measurements

    quant-ph 2025-07 conditional novelty 7.0

    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 ...

  6. Disentangling strategies and entanglement transitions in unitary circuit games with matchgates

    quant-ph 2025-07 unverdicted novelty 7.0

    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 gene...

  7. An Algorithm for Estimating $\alpha$-Stabilizer R\'enyi Entropies via Purity

    quant-ph 2025-07 unverdicted novelty 7.0

    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.

  8. Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states

    quant-ph 2024-12 unverdicted novelty 7.0

    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...

  9. Entanglement and information scrambling in long-range measurement-only circuits

    quant-ph 2026-04 unverdicted novelty 6.0

    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,...

  10. Detecting entanglement from few partial transpose moments and their decay via weight enumerators

    quant-ph 2026-04 unverdicted novelty 6.0

    Entanglement is certified if any three PT moments satisfy p_l > p_k^x p_m^{1-x} with x=(m-l)/(m-k), and quantum weight enumerators describe moment decay under local noise.

  11. On the Entanglement Entropy Distribution of a Hybrid Quantum Circuit

    quant-ph 2026-03 unverdicted novelty 6.0

    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 descriptio...

  12. Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States

    quant-ph 2026-03 unverdicted novelty 6.0

    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.

  13. Gapless Symmetry-Protected Topological States in Measurement-Only Circuits

    cond-mat.str-el 2025-01 unverdicted novelty 6.0

    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.

  14. Graph-State Circuit Blocks control Entanglement and Scrambling Velocities

    quant-ph 2026-05 unverdicted novelty 5.0

    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.

  15. A trace distance-based geometric analysis of the stabilizer polytope for few-qubit systems

    quant-ph 2025-04 unverdicted novelty 5.0

    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 b...

  16. A graph-based approach to entanglement entropy of quantum error correcting codes

    quant-ph 2025-01 unverdicted novelty 4.0

    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.