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.
arXiv preprint arXiv:2408.13130 (2024)
4 Pith papers cite this work, alongside 2 external citations. Polarity classification is still indexing.
4
Pith papers citing it
2
external citations · external index
fields
quant-ph 4representative citing papers
The authors equip CSS codes with cup product structures to generate logical operators in the Λ-th Clifford hierarchy level on Λ code copies via constant-depth unitaries, and construct code families supporting this for any Λ.
Tricycle codes generalize bicycle codes to three homological dimensions, enabling constant-depth CCZ circuits and single-shot magic state generation with circuit-level thresholds above 0.5% and low error rates at block lengths of 50-100 qubits.
A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.
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.
-
Cups and Gates I: Cohomology invariants and logical quantum operations
The authors equip CSS codes with cup product structures to generate logical operators in the Λ-th Clifford hierarchy level on Λ code copies via constant-depth unitaries, and construct code families supporting this for any Λ.
-
Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
Tricycle codes generalize bicycle codes to three homological dimensions, enabling constant-depth CCZ circuits and single-shot magic state generation with circuit-level thresholds above 0.5% and low error rates at block lengths of 50-100 qubits.
-
Parallel Logical Measurements via Quantum Code Surgery
A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.