Fault-tolerant pairwise measurement-based code on eight qubits

We construct a pairwise measurement-based code on eight qubits that is error-correcting for circuit noise, with fault distance 3. The code can be implemented on a subset of a rectangular array of qubits with nearest-neighbor connectivity of pairwise Pauli measurements, with a syndrome extraction circuit of depth 28. We describe fault-tolerant logical operations on patches of this eight-qubit code that generate the full Clifford group. We estimate the performance under circuit noise both during logical idle and during a logical two-qubit measurement. We estimate the pseudothreshold to be between ${10}^{\ensuremath{-}5}$ and $2\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}4}$, depending on the amount of noise on idle physical qubits. The use of postselection in addition to error correction (correcting all degree-one faults and rejecting a subset of the higher degree faults) can improve the pseudothreshold by up to an order of magnitude.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2025-10-09
DOI
https://doi.org/10.1103/c54n-y9vw
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fault-tolerant pairwise measurement-based code on eight qubits

Linnea Grans-Samuelsson, Parsa Bonderson, David Aasen
Physical review. A/Physical review, A
Quantum Computing Algorithms and Architecture
article

Fault-tolerant pairwise measurement-based code on eight qubits

Linnea Grans-Samuelsson, Parsa Bonderson, David Aasen
article en

Abstract

We construct a pairwise measurement-based code on eight qubits that is error-correcting for circuit noise, with fault distance 3. The code can be implemented on a subset of a rectangular array of qubits with nearest-neighbor connectivity of pairwise Pauli measurements, with a syndrome extraction circuit of depth 28. We describe fault-tolerant logical operations on patches of this eight-qubit code that generate the full Clifford group. We estimate the performance under circuit noise both during logical idle and during a logical two-qubit measurement. We estimate the pseudothreshold to be between ${10}^{\ensuremath{-}5}$ and $2\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}4}$, depending on the amount of noise on idle physical qubits. The use of postselection in addition to error correction (correcting all degree-one faults and rejecting a subset of the higher degree faults) can improve the pseudothreshold by up to an order of magnitude.

Physical review. A/Physical review, AVol. 112(4)
Microsoft (United States) (US)
Openalex Percentile: Top 85%
Quantum Computing Algorithms and Architecture
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.