REVIEW 30 cited by
Entanglement in the stabilizer formalism
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 30 Pith papers
-
Learning Clifford-structured quantum unitaries and Hamiltonians
A quasipolynomial-time algorithm finds the closest Clifford unitary to an unknown unitary, enabling tomography of unitaries and Hamiltonians with bounded Clifford decomposition size.
-
Typical Output States of Monitored Random Clifford Circuits: A Graph-Theoretic Approach
Random stabilizer states are asymptotically Erdos-Renyi graphs, yielding exact GHZ entanglement numbers and revealing a hidden unitary sub-circuit in monitored Clifford circuits.
-
Universality of Measurement-Induced Criticality under Symmetry-Breaking Measurements
Symmetry-breaking local measurements are a relevant perturbation that drives U(1)-symmetric monitored circuits into the generic non-symmetric MIPT universality class, with finite charge correlation length at any measu...
-
Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks
High-rate CSS codes compile nonlocal Clifford and non-Clifford logical circuits into onsite phases and classical permutations, so MPS bond dimension stays fixed by the encoder while logical entanglement, magic, and no...
-
Typical Entanglement of Superpositions
An m-fold superposition of typical sub-maximally entangled states gains a universal ln(m) entanglement enhancement, while maximally entangled states relax to the Haar limit via N-independent scaling laws.
-
Classification and Exact Local Masking in Finite-Field Clifford Dual-Unitary Circuits
Finite-field Clifford dual-unitary gates fall into five transport phases whose one-site edge channels fix exact local-masking distances d1(t)=4t (perfect) or 4t-2 (delayed) and d2(t)=4t-2 or 4t-4.
-
A five-qubit 1-resistant graph state and stabilizer marginal certificates
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.
-
Tomography of quantum states with bounded extent
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.
-
A journey through Flatland: What does the antiflatness of a spectrum teach us?
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.
-
Subdimensional Entanglement Entropy: From Geometric-Topological Response to Mixed-State Holography
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...
-
Rise and fall of nonstabilizerness via random measurements
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 ...
-
Disentangling strategies and entanglement transitions in unitary circuit games with matchgates
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...
-
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.
-
Entanglement and Stabilizer entropies of random bipartite pure quantum states
For Haar-random bipartite pure states, the linear entanglement entropy and the linear stabilizer entropy have zero covariance, while the average magic conditioned on the Schmidt spectrum is an explicit function of ent...
-
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...
-
Unified and Generalized Approach to Entanglement-Assisted Quantum Error Correction
A single operator-algebra framework, EAOAQEC, unifies the EAQEC, EAOQEC, and EACQ approaches to entanglement-assisted quantum error correction.
-
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.
-
Witnessing the architecture of quantum circuits
A witness framework certifies when a unitary cannot be realized by a prescribed quantum circuit architecture, with SDP and LP relaxations and analytical Clifford bounds.
-
Type III von Neumann Algebras are Magical
If lattice states in the thermodynamic limit have bounded magic, the local von Neumann algebra cannot be Type III, so Type III algebras require infinite magic.
-
Quantum Information Flow under String-Diagram Rewriting
The authors define Coecke flow lines as branch-independent paths through quantum protocol diagrams that survive every semantics-preserving rewrite down to a bare wire.
-
Genuine Multi-Entropy in the Toric Code
Genuine multi-entropy in the toric code reduces to topological entanglement entropy for stabilizer states at low replica index but captures independent topological data at n=4 and for non-stabilizer states.
-
Parametrized-circuit-free quantum regression with variance regularization
Symmetry-inspired fixed observables plus classical linear regression with variance regularization predict quantum properties without parameterized circuits and with lower resource cost than VQAs.
-
Steady-state phases in long-range measurement-only quantum circuits
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.
-
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...
-
Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States
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 circuit of perturbed toric code on triangular lattice: Topological entanglement, 1-form symmetry and logical qubits
In a measurement-only triangular-lattice toric code, topological-entanglement, 1-form-symmetry string, and logical-loop order parameters transition at different measurement probabilities and with different critical exponents.
-
Quantum circuit lower bounds in the magic hierarchy
A Clifford circuit followed by a shallow two-qubit circuit cannot prepare several explicit entangled states, including some topological ground states and quantum codes.
-
Gapless Symmetry-Protected Topological States in Measurement-Only Circuits
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.
-
A trace distance-based geometric analysis of the stabilizer polytope for few-qubit systems
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...
-
A graph-based approach to entanglement entropy of quantum error correcting codes
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.
Discussion (0). Continue with ORCID to comment.