Towards Practical Classical Processing for the Surface Code
Towards Practical Classical Processing for the Surface Code
复制标题
DOI：
10.1103/physrevlett.108.180501
复制
发表时间：
2012-05-01
影响因子：
8.6
通讯作者：
Hollenberg, Lloyd C. L.
中科院分区：
文献类型：
--
作者：
Fowler, Austin G.;Whiteside, Adam C.;Hollenberg, Lloyd C. L.
表面码无疑是2D最近邻架构的领先量子纠错码，具有约1%的高阈值错误率，整个Clifford组的低开销实现，以及灵活的任意长距离逻辑门。这些高度期望的特征是以显著的经典处理复杂性为代价的。我们展示了如何执行与n × n量子位格相关联的处理，每个量子位格都以现实的容错方式进行操作，每轮纠错的平均时间为O（n（2））。我们还描述了如何并行化的算法，以实现O（1）平均每轮处理，仅使用恒定的计算资源每单位面积和本地通信。这两种复杂性都是最优的。
The surface code is unarguably the leading quantum error correction code for 2D nearest neighbor architectures, featuring a high threshold error rate of approximately 1%, low overhead implementations of the entire Clifford group, and flexible, arbitrarily long-range logical gates. These highly desirable features come at the cost of significant classical processing complexity. We show how to perform the processing associated with an n x n lattice of qubits, each being manipulated in a realistic, fault-tolerant manner, in O(n(2)) average time per round of error correction. We also describe how to parallelize the algorithm to achieve O(1) average processing per round, using only constant computing resources per unit area and local communication. Both of these complexities are optimal.