Evidence map›Paper›PMID 40993394›Full record

ArticleNature2025

Low-overhead transversal fault tolerance for universal quantum computation.

Hengyun Zhou, Chen Zhao, Madelyn Cain, Dolev Bluvstein, Nishad Maskara, Casey Duckering, Hong-Ye Hu, Sheng-Tao Wang, Aleksander Kubica, Mikhail D Lukin

Abstract read
PubMed Publisher
In one paragraph

Article in Nature, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

0numbers the graph read from it
0cells of the map it votes in
7citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

7 citing papers in PubMed.

  1. Article
  2. Article
  3. Computing efficiently in QLDPC codes.Nature communications · 2026
    Article
  4. Article
  5. Article
  6. Article
  7. Learning to decode logical circuits.Nature computational science · 2025
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

10 authors.

Hengyun Zhou *QuEra Computing, Boston, MA, US. hyzhou@quera.com.ORCID http://orcid.org/0000-0002-2148-8856
Chen Zhao *QuEra Computing, Boston, MA, US.ORCID http://orcid.org/0009-0004-4386-1334
Madelyn CainDepartment of Physics, Harvard University, Cambridge, MA, USA.ORCID http://orcid.org/0000-0002-5298-3112
Dolev BluvsteinDepartment of Physics, Harvard University, Cambridge, MA, USA.ORCID http://orcid.org/0000-0002-9934-9530
Nishad MaskaraDepartment of Physics, Harvard University, Cambridge, MA, USA.ORCID http://orcid.org/0000-0001-5775-9542
Casey DuckeringQuEra Computing, Boston, MA, US.ORCID http://orcid.org/0000-0002-4656-9644
Hong-Ye HuDepartment of Physics, Harvard University, Cambridge, MA, USA.
Sheng-Tao WangQuEra Computing, Boston, MA, US.
Aleksander KubicaAWS Center for Quantum Computing, Pasadena, CA, USA.ORCID http://orcid.org/0000-0001-8213-8190
Mikhail D LukinDepartment of Physics, Harvard University, Cambridge, MA, USA. lukin@physics.harvard.edu.ORCID http://orcid.org/0000-0002-8658-1007

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Fast, reliable logical operations are essential for realizing useful quantum computers

Identifiers

PMID40993394

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.