arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.02468quant-phcond-mat.str-el

没有父子系统码的 Floquet 码

Floquet codes without parent subsystem codes

Margarita Davydova, Nathanan Tantivasadakarn, Shankar Balasubramanian

AI总结:

提出无父子系统码的二维 CSS honeycomb code 及三维扩展,通过动态协议实现容错纠错与交替分形子模型,并构建概率有限自动机生成动态树码以纠正单比特错误。

摘要:

我们提出了一类新的二维和三维纠错动态码,它与任何父子系统码都没有明确的联系。我们将其中的二维码称为 CSS honeycomb code,它在几何上类似于 Hastings 和 Haah 提出的 honeycomb code,并且在动态上也嵌入了一个瞬态 toric code。然而,与 honeycomb code 不同的是,它具有显式的 CSS 结构,且其规范校验不构成子系统码。尽管如此,我们证明了我们的动态协议能够保持逻辑信息,并具备纠错阈值。我们将此构造推广到三维,得到了一种容错地交替实现两种 type-I fracton model(即 checkerboard model 和 X-cube model)的码。最后,我们通过证明可以在两个协议之间随机切换而不丢失信息,同时仍能测量错误伴随式,展示了我们的 CSS honeycomb code 协议与 honeycomb code 的兼容性。我们将这种更一般的非周期结构称为“dynamic tree codes”,并将其推广到了三维。我们构建了一种概率有限自动机方案,用于生成能够纠正任意单比特 Pauli 错误的 dynamic tree codes,这可以被视为迈向实用容错随机码开发的一步。

英文摘要:

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 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 towards the development of practical fault-tolerant random codes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑