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
- Junichiro Kadomoto (ORCID: https://orcid.org/0000-0002-8973-0864)
- Kazutoshi Kobayashi (ORCID: https://orcid.org/0000-0002-7139-7274)
- Y. G. (ORCID: https://orcid.org/0000-0002-0233-9900)
Institutions
- Kyoto Institute of Technology (JP)
- The University of Tokyo (JP)
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