WIT-Greedy: Hardware System Design ofWeighted ITerative Greedy Decoder for Surface Code

被引:5
|
作者
Liao, Wang [1 ]
Suzuki, Yasunari [2 ]
Tanimoto, Teruo [3 ]
Ueno, Yosuke [4 ]
Tokunaga, Yuuki [2 ]
机构
[1] Univ Tokyo, Photon Sci Ctr, Tokyo, Japan
[2] NTT Comp & Data Sci Labs, Atsugi, Kanagawa, Japan
[3] Kyushu Univ, Fac Informat Sci & Elect Engn, Fukuoka, Japan
[4] Univ Tokyo, Grad Sch Informat Sci & Technol, Tokyo, Japan
来源
2023 28TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, ASP-DAC | 2023年
关键词
QEC; surface code; decoder; non-identical weights; FPGA;
D O I
10.1145/3566097.3567933
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Large error rates of quantum bits (qubits) are one of the main difficulties in the development of quantum computing. Performing quantum error correction (QEC) with surface codes is considered the most promising approach to reduce the error rates of qubits effectively. To perform error correction, we need an error-decoding unit, which estimates errors in the noisy physical qubits repetitively, to create a robust logical qubit. While complicated graph-matching problems must be solved within a strict time restriction for the error decoding, several hardware implementations that satisfy the restriction at a large code distance have been proposed. However, the existing decoder designs are still challenging in reducing the logical error rate. This is because they assume that the error rates of physical qubits are uniform while they have large variations in practice. According to our numerical simulation based on the quantum chip with the largest qubit number, neglecting the non-uniform error properties of a real quantum chip in the decoding process induces significant degradation of the logical error rate and spoils the benefit of QEC. To take the non-uniformity into account, decoders need to solve matching problems on a weighted graph, but they are difficult to solve using the existing designs without exceeding the time limit of decoding. Therefore, a decoder that can treat both the non-uniform physical error rates and the large surface code is strongly demanded. In this paper, we propose a hardware design of decoding units for the surface code that can treat the non-identical error properties with small latency at a large code distance. The key idea of our design is 1) constructing a look-up table for calculating the shortest paths between nodes in a weighted graph and 2) enabling parallel processing during decoding. The implementation results in field programmable gate array (FPGA) indicate that our design scales up to code distance 11 within a microsecond-level delay, which is comparable to the existing state-of-the-art designs, while our design can treat non-identical errors.
引用
收藏
页码:209 / 215
页数:7
相关论文
共 36 条
  • [1] An Iterative Greedy Algorithm for Hardware/Software Partitioning
    Lin, Geng
    2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 777 - 781
  • [2] Iterative and greedy resource allocation in an uplink OFDMA system
    Kim, K
    Kim, H
    Han, Y
    Kim, SL
    2004 IEEE 15TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2004, : 2377 - 2381
  • [3] Optimization of Orthogonal Waveform Using Memetic Algorithm with Iterative Greedy Code Search
    Wang, Wanbin
    Qian, Lu
    Zhou, Yun
    REMOTE SENSING, 2025, 17 (05)
  • [4] Greedy Code Search Based Memetic Algorithm for the Design of Orthogonal Polyphase Code Sets
    Ren, Wei
    Zhang, Honggang
    Liu, Quanhua
    Yang, Yi
    IEEE ACCESS, 2019, 7 : 13561 - 13576
  • [5] The lab reservation system design and implementation based on Greedy algorithm
    Niu Yan
    Li Jun
    Li Lala
    2009 IITA INTERNATIONAL CONFERENCE ON SERVICES SCIENCE, MANAGEMENT AND ENGINEERING, PROCEEDINGS, 2009, : 495 - 498
  • [6] Using graph greedy coloring algorithms in the hardware implementation of the HFIS fuzzy inference system
    Wyrwol, Bernard
    PRZEGLAD ELEKTROTECHNICZNY, 2011, 87 (10): : 64 - 67
  • [7] FPGA Design of an (8,4) Product Code Iterative Decoder
    Guo Li
    INTERNATIONAL CONFERENCE OF CHINA COMMUNICATION (ICCC2010), 2010, : 470 - 473
  • [8] Optimal Design of a Comprehensive Gymnasium Lighting System Based on Greedy Algorithm
    Yu Ying
    Cui Zihao
    Chen Xiao
    Sun Qing
    LASER & OPTOELECTRONICS PROGRESS, 2022, 59 (17)
  • [9] Design of ACM System Based on Non-greedy Punctured LDPC Codes
    Lu, Zijun
    Jiang, Zihong
    Zhou, Lin
    He, Yucheng
    GREEN ENERGY AND SUSTAINABLE DEVELOPMENT I, 2017, 1864
  • [10] Communication Scheduling Design of Multi-Agent System Based on Improved Greedy Algorithm
    Zhu, Hao
    Zhu, Xiaochun
    Zhang, Ye
    ADVANCES IN MATERIALS, MACHINERY, ELECTRONICS III, 2019, 2073