Recognition: unknown
Entanglement in the stabilizer formalism
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.
Forward citations
Cited by 6 Pith papers
-
Entanglement-Rank Duality in Quadratic Phase Quantum States
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.
-
Decohered color code and emerging mixed toric code by anyon proliferation: Topological entanglement negativity perspective
Decoherence of the color code produces a mixed state with topological entanglement negativity ln 2 that corresponds to an emergent single toric code.
-
Entanglement and information scrambling in long-range measurement-only circuits
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,...
-
Detecting entanglement from few partial transpose moments and their decay via weight enumerators
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.
-
On the Entanglement Entropy Distribution of a Hybrid Quantum Circuit
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...
-
Graph-State Circuit Blocks control Entanglement and Scrambling Velocities
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.