CoChat

Distillation with Sublogarithmic Overhead

Open access
Hastings, Matthew B., Haah, Jeongwan · 2018 · Physical Review Letters
Cited by 59

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

It has been conjectured that, for any distillation protocol for magic states for the $T$ gate, the number of noisy input magic states required per output magic state at output error rate $\ensuremath{\epsilon}$ is $\mathrm{\ensuremath{\Omega}}[\mathrm{log}(1/\ensuremath{\epsilon})]$. We show that this conjecture is false. We find a family of quantum error correcting codes of parameters $⟦\ensuremath{\sum}_{i=w+1}^{m}(\genfrac{}{}{0}{}{m}{i}),\ensuremath{\sum}_{i=0}^{w}(\genfrac{}{}{0}{}{m}{i}),\ensuremath{\sum}_{i=w+1}^{r+1}(\genfrac{}{}{0}{}{r+1}{i})⟧$ for any integers $m>2r$, $r>w\ensuremath{\ge}0$, by puncturing quantum Reed-Muller codes. When $m>\ensuremath{\nu}r$, our code admits a transversal logical gate at the $\ensuremath{\nu}$th level of Clifford hierarchy. In a distillation protocol for magic states at the level $\ensuremath{\nu}=3$ ($T$ gate), the ratio of input to output magic states is $O\mathbf{(}{\mathrm{log}}^{\ensuremath{\gamma}}(1/\ensuremath{\epsilon})\mathbf{)}$, where $\ensuremath{\gamma}=\mathrm{log}(n/k)/\mathrm{log}(d)<0.678$ for some $m$, $r$, $w$. The smallest code in our family for which $\ensuremath{\gamma}<1$ is on $\ensuremath{\approx}{2}^{58}$ qubits.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.120.050504

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 59

Metadata

Authors
Hastings, M. B., & Haah, J.
Venue
Physical Review Letters
Published
2018-01-31
Volume
120
Issue
5
Pages
050504-050504
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2755290849
Cited by
59
References
1
FWCI
3.39
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Distillation with Sublogarithmic Overhead. https://app.cochat.ai/papers/10.1103/physrevlett.120.050504
The paper
Hastings, M. B., & Haah, J. (2018). Distillation with Sublogarithmic Overhead. Physical Review Letters. https://doi.org/10.1103/physrevlett.120.050504

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.