Under local amplitude damping, GHZ-type states lose magic, regain it after entanglement death, and the rebirth threshold exactly mirrors the entanglement-death threshold: γ₊ = 1 − γₑ for every n.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
years
2026 6representative citing papers
First improvement in 18 years to the depolarizing channel quantum capacity threshold via symmetry-enhanced coherent information on rank-two symmetric states.
Concatenating quantum Reed-Solomon codes over the gross code via Galois qudits reaches teraquop regime at uniform 10^{-3} noise with reduced overhead.
A forced-gap post-selection strategy using repeated Relay-BP decoder runs improves logical error rates by over 4x on 72- and 144-qubit bivariate bicycle codes at fixed post-selection rate.
Finding a matrix of rank n to the o(1/log log n) in a subspace of n by n matrices over F_{2^r} promised to contain a rank-1 matrix is hard, assuming NP has no subexponential algorithms.
A review that defines Galois qudits over binary extension fields, their Clifford hierarchies, Pauli measurements, stabilizer tableaux, qubit mappings, and quantum Reed-Solomon codes.
citing papers explorer
-
Sudden death of entanglement, rebirth of magic
Under local amplitude damping, GHZ-type states lose magic, regain it after entanglement death, and the rebirth threshold exactly mirrors the entanglement-death threshold: γ₊ = 1 − γₑ for every n.
-
Enhanced quantum capacity thresholds from symmetry
First improvement in 18 years to the depolarizing channel quantum capacity threshold via symmetry-enhanced coherent information on rank-two symmetric states.
-
Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes
Concatenating quantum Reed-Solomon codes over the gross code via Galois qudits reaches teraquop regime at uniform 10^{-3} noise with reduced overhead.
-
Forced Gap Post-Selection for Quantum LDPC Codes and their Operations
A forced-gap post-selection strategy using repeated Relay-BP decoder runs improves logical error rates by over 4x on 72- and 144-qubit bivariate bicycle codes at fixed post-selection rate.
-
Strong Inapproximability for a Promise Rank Problem
Finding a matrix of rank n to the o(1/log log n) in a subspace of n by n matrices over F_{2^r} promised to contain a rank-1 matrix is hard, assuming NP has no subexponential algorithms.
-
A Review of Galois Qudits
A review that defines Galois qudits over binary extension fields, their Clifford hierarchies, Pauli measurements, stabilizer tableaux, qubit mappings, and quantum Reed-Solomon codes.