.png){kind=icon}
返回
Scalable Surface-Code Decoders with Parallelization in Time
.png){kind=icon}
OA
AI
DOI：10.1103/PRXQuantum.4.040344.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
TOLERANT QUANTUM COMPUTATION
ACCURACY THRESHOLD
ERROR-CORRECTION
期刊
P
IF:
11
论文数:
919
被引数:
9.0K
机构
暂无机构信息
引用论文
分享收藏Rocket-grenade measurements of temperatures and winds in the mesosphere over Churchill, Canada加拿大丘吉尔上空中层温度和风的火箭手榴弹测量
PREAI
分享收藏BER-H2: a new anti-Ki-1 (CD30) monoclonal antibody directed at a formol- resistant epitope.png)
Blood
OAAI
BloodIF0
OAAI分享收藏Synthesis, spectral properties and reactions of the novel acetonitrile diiodotricarbonyltriphenyl phosphine, arsine and antimony complexes of molybdenum(II) and tungsten(II)Polyhedron
PolyhedronIF0
PREAI
分享收藏
查看更多内容