.png){kind=icon}
.png){kind=icon}
Return
Tensor-Network Decoding Beyond 2D
.png){kind=icon}
OA
AI
DOI：10.1103/PRXQuantum.5.040303.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Decoding algorithms based on approximate tensor-network (TN) contraction have proven tremendously successful in decoding two-dimensional (2D) local quantum codes such as toric or surface codes and color codes, effectively achieving optimal decoding accuracy. In this work, we introduce several techniques to generalize TN decoding to higher dimensions so that it can be applied to three-dimensional (3D) codes as well as 2D codes with noisy syndrome measurements (phenomenological noise or circuit- level noise). The 3D case is significantly more challenging than 2D, as the involved approximate tensor contraction is dramatically less well behaved than its 2D counterpart. Nonetheless, we numerically demonstrate that the decoding accuracy of our approach outperforms state-of-the-art decoders on the 3D surface code, both in the point and loop sectors, as well as for depolarizing noise. Our techniques could prove useful in near-term experimental demonstrations of quantum error correction, when decoding is to be performed off line and accuracy is of the utmost importance. To this end, we show how TN decoding can be applied to circuit-level noise and demonstrate that it outperforms the matching decoder on the rotated surface code.
Keywords:
RENORMALIZATION-GROUP DECODER
ACCURACY THRESHOLD
QUANTUM
CODES
Journal
P
IF:
11
Papers:
919
Citations:
9.0K