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.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
fields
quant-ph 4years
2026 4verdicts
UNVERDICTED 4representative citing papers
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 sites in one month using 10000 qubits.
A homological framework identifies necessary and sufficient obstruction conditions for transversal logical diagonal gates in quantum CSS codes.
Asymptotically good CSS codes are constructed to fault-tolerantly realize the logical transversal Clifford group, with revised characterizations for CSS-T codes.
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.
-
Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 sites in one month using 10000 qubits.
-
Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes
A homological framework identifies necessary and sufficient obstruction conditions for transversal logical diagonal gates in quantum CSS codes.
-
Asymptotically good CSS codes that realize the logical transversal Clifford group fault-tolerantly
Asymptotically good CSS codes are constructed to fault-tolerantly realize the logical transversal Clifford group, with revised characterizations for CSS-T codes.