Fault-tolerant operation and materials science with neutral atom logical qubits

Abstract We report on the fault-tolerant operation of logical qubits on a neutral atom quantum computer, with logical performance surpassing physical performance for multiple circuits including Bell state preparation (12x error reduction), random circuits (15x), and a prototype Anderson Impurity Model ground state solver for materials science applications (up to 6x, non-fault-tolerantly). The logical qubits are implemented via the [[4, 2, 2]] code (C 4 ). Our work constitutes the first complete realization of the benchmarking protocol proposed by Gottesman 2016 demonstrating results consistent with fault tolerance. In light of recent advances on applying concatenated C 4 /C 6 detection codes to achieve error correction with high code rates and thresholds, our work can be regarded as a building block towards a practical scheme for fault tolerant quantum computation. Our demonstration of a materials science application with logical qubits particularly demonstrates the immediate value of these techniques on current experiments.

Authors

Institutions

Publication Details

Journal
npj Quantum Information
Published
2025-12-05
DOI
https://doi.org/10.1038/s41534-025-01095-w
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fault-tolerant operation and materials science with neutral atom logical qubits

Nathan A. Neff-Mallon, M. Saffman, Rich Rines, Pranav Gokhale et al.
1 citations
npj Quantum Information
Quantum Computing Algorithms and Architecture
2.48
article

Fault-tolerant operation and materials science with neutral atom logical qubits

Nathan A. Neff-Mallon, M. Saffman, Rich Rines, Pranav Gokhale, Bettina Heim, Stephanie J. Lee, Eric B. Jones, David L. Mason, Thomas Noël, Woo Chang Chung, Martin Lichtman, Victory Omole, Ryan Jones, Pradnya Khalate, Kevin W. Kuper, Michelle L. Blakely, Caitlin Carnahan, A. G. Radnaev, Daniel C. Cole, Teague Tomesh, Garrett Hickman, Palash Goiporia, Jinsung Kim, Peter. D. Buttler, Matt J. Bedalov, Frederic T. Chong, A. Tucker, Bharath Thotakura, Efrat Shabtai, Mariesa H. Teo
article en
1 citations

Abstract

Abstract We report on the fault-tolerant operation of logical qubits on a neutral atom quantum computer, with logical performance surpassing physical performance for multiple circuits including Bell state preparation (12x error reduction), random circuits (15x), and a prototype Anderson Impurity Model ground state solver for materials science applications (up to 6x, non-fault-tolerantly). The logical qubits are implemented via the [[4, 2, 2]] code (C 4 ). Our work constitutes the first complete realization of the benchmarking protocol proposed by Gottesman 2016 demonstrating results consistent with fault tolerance. In light of recent advances on applying concatenated C 4 /C 6 detection codes to achieve error correction with high code rates and thresholds, our work can be regarded as a building block towards a practical scheme for fault tolerant quantum computation. Our demonstration of a materials science application with logical qubits particularly demonstrates the immediate value of these techniques on current experiments.

npj Quantum InformationVol. 11(1)
University of Wisconsin–Madison (US), University of Chicago (US), Nvidia (United States) (US)
U.S. Department of Energy, Office of Science, Advanced Scientific Computing Research
Openalex Percentile: Top 8%
Quantum Computing Algorithms and Architecture
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.