Fault-tolerant quantum computing with high-rate symplectic double codes

High-rate and large-distance quantum codes are expected to make fault-tolerant quantum computing more efficient, but most of them lack efficient fault-tolerant encoded-state preparation methods. We propose such fault-tolerant encoders for two symplectic double codes, [[30,6,5]] and [[36,12,5]]. The advantage of these codes is their compactness, namely, their small code block sizes for their high encoding rates and large distance, allowing for early experimental realization of high-rate codes. Detecting crucial errors during encoding with as few auxiliary qubits as possible, our encoders can reduce resource overheads while keeping low logical error rates compared to more naive methods. Numerical simulations with a circuit-level noise model demonstrate the reliability and effectiveness of the proposed methods. We also develop arbitrary-state encoders that enable the injection of arbitrary quantum states into the code spaces. Combined with basic fault-tolerant operations, they support universal quantum computation. We thus demonstrate that efficient and reliable logical state preparation is achievable even for compact and high-rate codes, offering a potential step toward efficient fault-tolerant quantum computing suitable for near-term experiments.

Authors

Institutions

Publication Details

Journal
Science Advances
Published
2026-11-13
DOI
https://doi.org/10.1126/sciadv.aec4142
Citations
6
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
6.97

Funders

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

Fault-tolerant quantum computing with high-rate symplectic double codes

Hayato Goto, Naoyuki Kanomata
6 citations
Science Advances
Quantum Computing Algorithms and Architecture
6.97
article

Fault-tolerant quantum computing with high-rate symplectic double codes

Hayato Goto, Naoyuki Kanomata
article en
6 citations

Abstract

High-rate and large-distance quantum codes are expected to make fault-tolerant quantum computing more efficient, but most of them lack efficient fault-tolerant encoded-state preparation methods. We propose such fault-tolerant encoders for two symplectic double codes, [[30,6,5]] and [[36,12,5]]. The advantage of these codes is their compactness, namely, their small code block sizes for their high encoding rates and large distance, allowing for early experimental realization of high-rate codes. Detecting crucial errors during encoding with as few auxiliary qubits as possible, our encoders can reduce resource overheads while keeping low logical error rates compared to more naive methods. Numerical simulations with a circuit-level noise model demonstrate the reliability and effectiveness of the proposed methods. We also develop arbitrary-state encoders that enable the injection of arbitrary quantum states into the code spaces. Combined with basic fault-tolerant operations, they support universal quantum computation. We thus demonstrate that efficient and reliable logical state preparation is achievable even for compact and high-rate codes, offering a potential step toward efficient fault-tolerant quantum computing suitable for near-term experiments.

Science AdvancesVol. 12(46)
Toshiba (Japan) (JP), RIKEN Center for Quantum Computing (JP)
RIKEN, Moonshot Research and Development Program
Openalex Percentile: Top 3%
Quantum Computing Algorithms and Architecture
6.97
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.

Laika access coming soon