.png){kind=icon}
.png){kind=icon}
Return
Scalable Surface-Code Decoders with Parallelization in Time
.png){kind=icon}
OA
AI
DOI：10.1103/PRXQuantum.4.040344.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Fast classical processing is essential for most quantum fault-tolerance architectures. We introduce a 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 minimumweight 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.
Keywords:
TOLERANT QUANTUM COMPUTATION
ACCURACY THRESHOLD
ERROR-CORRECTION