A new family of magic state distillation protocols based on logical Clifford error checking achieves near-linear asymptotic rate despite overhead exponent exceeding one, showing the quantities are not tightly coupled in the sublinear regime.
Quantum Error Detection II: Bounds
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a counting argument for classical self-orthogonal quaternary codes. Upper bounds for any quantum codes are proved by linear programming. We present two general solutions of the LP problem. Together they give an upper bound on the exponent of undetected error. The upper and lower asymptotic bounds coincide for a certain interval of code rates close to 1.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Asymptotic magic state distillation with almost linear rate
A new family of magic state distillation protocols based on logical Clifford error checking achieves near-linear asymptotic rate despite overhead exponent exceeding one, showing the quantities are not tightly coupled in the sublinear regime.