Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time
Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time
复制标题
平均O(1)并行时间内容错拓扑量子纠错的最小权完美匹配
DOI：
--
复制
发表时间：
2013
影响因子：
1
通讯作者：
A. Fowler
中科院分区：
文献类型：
--
作者：
A. Fowler
考虑一个长度为L × L的二维量子位方阵。我们提供了一个证明，与在这个阵列上运行特定类别的拓扑量子纠错码相关联的最小权重完美匹配问题可以用经典计算设备的2-D正方形阵列精确地解决，每个正方形阵列名义上与固定数量N的量子比特相关联，假设物理错误率低于固定的非零值，以及其他物理上合理的假设，则每轮错误检测的恒定平均时间与L无关。该证明仅适用于完全容错的情况，而不适用于完美稳定器测量的情况。
Consider a 2-D square array of qubits of extent L × L. We provide a proof that the minimum weight perfect matching problem associated with running a particular class of topological quantum error correction codes on this array can be exactly solved with a 2-D square array of classical computing devices, each of which is nominally associated with a fixed number N of qubits, in constant average time per round of error detection independent of L provided physical error rates are below fixed nonzero values, and other physically reasonable assumptions. This proof is applicable to the fully fault-tolerant case only, not the case of perfect stabilizer measurements.