A 22-nm Surface Code Decoder Using Greedy Algorithm

To realize a fault-tolerant quantum computer, a quantum error decoder that can handle a large number of qubits with high speed is required. This paper demonstrates an ASIC implementation of a quantum error decoder based on a greedy algorithm. The simple algorithm and microarchitecture enable a low-power and compact design. A test chip is fabricated using 22-nm CMOS technology, and its operation is verified through empirical evaluation.

Authors

Institutions

Publication Details

Published
2025-05-25
DOI
https://doi.org/10.1109/iscas56072.2025.11044096
Citations
2
Primary Topic
Advanced Surface Polishing Techniques
Type
article
Field-Weighted Citation Impact
1.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A 22-nm Surface Code Decoder Using Greedy Algorithm

Junichiro Kadomoto, Kazutoshi Kobayashi, Y. G.
2 citations
Advanced Surface Polishing Techniques
1.35
article

A 22-nm Surface Code Decoder Using Greedy Algorithm

Junichiro Kadomoto, Kazutoshi Kobayashi, Y. G.
article en
2 citations

Abstract

To realize a fault-tolerant quantum computer, a quantum error decoder that can handle a large number of qubits with high speed is required. This paper demonstrates an ASIC implementation of a quantum error decoder based on a greedy algorithm. The simple algorithm and microarchitecture enable a low-power and compact design. A test chip is fabricated using 22-nm CMOS technology, and its operation is verified through empirical evaluation.

Kyoto Institute of Technology (JP), The University of Tokyo (JP)
Openalex Percentile: Top 19%
Advanced Surface Polishing Techniques
1.35
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.

A 22-nm Surface Code Decoder Using Greedy Algorithm — Junichiro Kadomoto, Kazutoshi Kobayashi, et al. · (2025) | TGRS Research Map | TGRS