REVIEW 3 cited by
Magic State Distillation: Not as Costly as You Think
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
read the original abstract
Despite significant overhead reductions since its first proposal, magic state distillation is often considered to be a very costly procedure that dominates the resource cost of fault-tolerant quantum computers. The goal of this work is to demonstrate that this is not true. By writing distillation circuits in a form that separates qubits that are capable of error detection from those that are not, most logical qubits used for distillation can be encoded at a very low code distance. This significantly reduces the space-time cost of distillation, as well as the number of qubits. In extreme cases, it can cost less to distill a magic state than to perform a logical Clifford gate on full-distance logical qubits.
Forward citations
Cited by 3 Pith papers
-
Borrowed Identities: Malleable Distillation Factories and a Unified Numerical Search
Borrowed-identity condition unifies numerical searches for magic-state distillation factories across Clifford hierarchy levels and code families.
-
The Pangaea Architecture: Fault-Tolerant Heterogeneous Topological Codes via a Quantum Bus
A quantum bus connects many logical qubits through a gauge-code strip, with a claimed factor O(d) reduction in qubit overhead for long-range logical interactions.
-
Finding diagonal logical gates in CSS codes and circuits
Diagonal logical gates of a CSS code or circuit are exactly the kernel of a pullback map on phase functions, and that kernel can be computed in cubic time.
Discussion (0). Sign in to comment.