arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1012.0425quant-ph
收藏

拓扑子系统码的构造及其噪声门限

Constructions and Noise Threshold of Topological Subsystem Codes

Martin Suchara, Sergey Bravyi, Barbara M. Terhal

摘要:

Bombin最近提出的拓扑子系统码是定义在二维量子比特网格上的量子纠错码,它允许以恒定的错误阈值可靠地存储量子信息。这些代码只需要测量两个量子比特的最近邻算子进行纠错。在本文中,我们证明了拓扑子系统代码(TSC)可以被看作是推广Kitaev的蜂窝模型的三价超图。这种新的连接提供了一种系统的方法来构建TSC和分析它们的特性。我们还导出了一个充分必要条件,在此条件下,子系统代码中的伴随式测量可以减少到规范群生成元的测量。此外,我们提出并实现了一些候选解码算法,一个特定的TSC假设完美的纠错。我们的蒙特卡罗模拟表明,这种代码,我们称之为五平方码,有一个阈值对去极化噪声至少为2%。

英文摘要:

Topological subsystem codes proposed recently by Bombin are quantum error correcting codes defined on a two-dimensional grid of qubits that permit reliable quantum information storage with a constant error threshold. These codes require only the measurement of two-qubit nearest-neighbor operators for error correction. In this paper we demonstrate that topological subsystem codes (TSCs) can be viewed as generalizations of Kitaev's honeycomb model to trivalent hypergraphs. This new connection provides a systematic way of constructing TSCs and analyzing their properties. We also derive a necessary and sufficient condition under which a syndrome measurement in a subsystem code can be reduced to measurements of the gauge group generators. Furthermore, we propose and implement some candidate decoding algorithms for one particular TSC assuming perfect error correction. Our Monte Carlo simulations indicate that this code, which we call the five-squares code, has a threshold against depolarizing noise of at least 2%.

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

↑