.png){kind=icon}
返回
Floquet Codes without Parent Subsystem Codes
.png){kind=icon}
OA
AI
DOI：10.1103/PRXQuantum.4.020341.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a new class of error-correcting dynamic codes in two and three dimensions that has no explicit connection to any parent subsystem code. The two-dimensional code, which we call the CSS (Calderbank-Shor-Steane) honeycomb code, is geometrically similar to that of the honeycomb code by Hastings and Haah and also dynamically embeds an instantaneous toric code. However, unlike the honeycomb code, it possesses an explicit CSS structure and its gauge checks do not form a subsystem code. Nevertheless, we show that our dynamic protocol conserves logical information and possesses a threshold for error correction. We generalize this construction to three dimensions and obtain a code that fault tolerantly alternates between realizing two type-I fracton models, the checkerboard and the X-cube model. Finally, we show the compatibility of our CSS honeycomb-code protocol and the honeycomb code by showing the possibility of randomly switching between the two protocols without information loss while still measuring error syndromes. We call this more general aperiodic structure dynamic tree codes, which we also generalize to three dimensions. We construct a probabilistic finite automaton prescription that generates dynamic tree codes correcting any single-qubit Pauli errors and can be viewed as a step toward the development of practical fault-tolerant random codes.
期刊
P
IF:
11
论文数:
919
被引数:
9.1K
机构
引用论文
分享收藏Hierarchical porous nano-MFI zeolite-pillared montmorillonite clay synthesized by recrystallization for hydrocracking of residual oil.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏
查看更多内容