Scalable Surface-Code Decoders with Parallelization in Time
Fast classical processing is essential for most quantum fault-tolerance architectures. We introduce a sliding-window decoding scheme that provides fast classical processing for the surface code through parallelism. Our scheme divides the syndromes in space-time into overlapping windows along the tim...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2023-12-01
|
| Series: | PRX Quantum |
| Online Access: | http://doi.org/10.1103/PRXQuantum.4.040344 |
| _version_ | 1797389860785356800 |
|---|---|
| author | Xinyu Tan Fang Zhang Rui Chao Yaoyun Shi Jianxin Chen |
| author_facet | Xinyu Tan Fang Zhang Rui Chao Yaoyun Shi Jianxin Chen |
| author_sort | Xinyu Tan |
| collection | DOAJ |
| description | Fast classical processing is essential for most quantum fault-tolerance architectures. We introduce a sliding-window decoding scheme that provides fast classical processing for the surface code through parallelism. Our scheme divides the syndromes in space-time into overlapping windows along the time direction, which can be decoded in parallel with any inner decoder. With this parallelism, our scheme can solve the backlog problem as the code scales up, even if the inner decoder is slow. When using minimum-weight perfect matching and union find as the inner decoders, we observe circuit-level thresholds of 0.68% and 0.55%, respectively, which are almost identical to those for the batch decoding. |
| first_indexed | 2024-03-08T23:02:13Z |
| format | Article |
| id | doaj.art-238646de350f429bb3f9d1d6b3417eec |
| institution | Directory Open Access Journal |
| issn | 2691-3399 |
| language | English |
| last_indexed | 2024-03-08T23:02:13Z |
| publishDate | 2023-12-01 |
| publisher | American Physical Society |
| record_format | Article |
| series | PRX Quantum |
| spelling | doaj.art-238646de350f429bb3f9d1d6b3417eec2023-12-15T15:00:52ZengAmerican Physical SocietyPRX Quantum2691-33992023-12-014404034410.1103/PRXQuantum.4.040344Scalable Surface-Code Decoders with Parallelization in TimeXinyu TanFang ZhangRui ChaoYaoyun ShiJianxin ChenFast classical processing is essential for most quantum fault-tolerance architectures. We introduce a sliding-window decoding scheme that provides fast classical processing for the surface code through parallelism. Our scheme divides the syndromes in space-time into overlapping windows along the time direction, which can be decoded in parallel with any inner decoder. With this parallelism, our scheme can solve the backlog problem as the code scales up, even if the inner decoder is slow. When using minimum-weight perfect matching and union find as the inner decoders, we observe circuit-level thresholds of 0.68% and 0.55%, respectively, which are almost identical to those for the batch decoding.http://doi.org/10.1103/PRXQuantum.4.040344 |
| spellingShingle | Xinyu Tan Fang Zhang Rui Chao Yaoyun Shi Jianxin Chen Scalable Surface-Code Decoders with Parallelization in Time PRX Quantum |
| title | Scalable Surface-Code Decoders with Parallelization in Time |
| title_full | Scalable Surface-Code Decoders with Parallelization in Time |
| title_fullStr | Scalable Surface-Code Decoders with Parallelization in Time |
| title_full_unstemmed | Scalable Surface-Code Decoders with Parallelization in Time |
| title_short | Scalable Surface-Code Decoders with Parallelization in Time |
| title_sort | scalable surface code decoders with parallelization in time |
| url | http://doi.org/10.1103/PRXQuantum.4.040344 |
| work_keys_str_mv | AT xinyutan scalablesurfacecodedecoderswithparallelizationintime AT fangzhang scalablesurfacecodedecoderswithparallelizationintime AT ruichao scalablesurfacecodedecoderswithparallelizationintime AT yaoyunshi scalablesurfacecodedecoderswithparallelizationintime AT jianxinchen scalablesurfacecodedecoderswithparallelizationintime |