Benchmarking the Planar Honeycomb Code

Craig Gidney, Michael Newman, Matt McEwen · 2022 · arXiv

| 编号 QE212 | 主题 Floquet 与动态码 | 链接 arXiv:2202.11845 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

We improve the planar honeycomb code by describing boundaries that need no additional physical connectivity, and by optimizing the shape of the qubit patch. We then benchmark the code using Monte Carlo sampling to estimate logical error rates and derive metrics including thresholds, lambdas, and teraquop qubit counts. We determine that the planar honeycomb code can create a logical qubit with one-in-a-trillion logical error rates using 7000 physical qubits at a 0.1% gate-level error rate (or 900 physical qubits given native two-qubit parity measurements). Our results cement the honeycomb code as a promising candidate for two-dimensional qubit architectures with sparse connectivity.

本站词条在引用该文献时，会以 wikilink（sources/QE212）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。