{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T04:12:02Z","timestamp":1780978322206,"version":"3.54.1"},"reference-count":17,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.22331\/q-2022-09-21-813","type":"journal-article","created":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T12:09:46Z","timestamp":1663762186000},"page":"813","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":39,"title":["Benchmarking the Planar Honeycomb Code"],"prefix":"10.22331","volume":"6","author":[{"given":"Craig","family":"Gidney","sequence":"first","affiliation":[{"name":"Google Quantum AI, Santa Barbara, California 93117, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Newman","sequence":"additional","affiliation":[{"name":"Google Quantum AI, Santa Barbara, California 93117, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matt","family":"McEwen","sequence":"additional","affiliation":[{"name":"Google Quantum AI, Santa Barbara, California 93117, USA"},{"name":"University of California, Santa Barbara, 93106, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"9598","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Google Quantum AI. Exponential suppression of bit or phase errors with cyclic error correction. Nature, 595 (7867): 383, 2021. 10.1038\/s41586-021-03588-y.","DOI":"10.1038\/s41586-021-03588-y"},{"key":"1","doi-asserted-by":"publisher","unstructured":"Dave Bacon. Operator quantum error-correcting subsystems for self-correcting quantum memories. Physical Review A, 73 (1): 012340, 2006. 10.1103\/PhysRevA.73.012340.","DOI":"10.1103\/PhysRevA.73.012340"},{"key":"2","doi-asserted-by":"publisher","unstructured":"H\u00e9ctor Bomb\u00edn and Miguel A Martin-Delgado. Optimal resources for topological two-dimensional stabilizer codes: Comparative study. Physical Review A, 76 (1): 012305, 2007. 10.1103\/PhysRevA.76.012305.","DOI":"10.1103\/PhysRevA.76.012305"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Christopher Chamberland, Guanyu Zhu, Theodore J Yoder, Jared B Hertzberg, and Andrew W Cross. Topological and subsystem codes on low-degree graphs with flag qubits. Physical Review X, 10 (1): 011022, 2020. 10.1103\/PhysRevX.10.011022.","DOI":"10.1103\/PhysRevX.10.011022"},{"key":"4","doi-asserted-by":"publisher","unstructured":"Rui Chao, Michael E Beverland, Nicolas Delfosse, and Jeongwan Haah. Optimization of the surface code design for majorana-based qubits. Quantum, 4: 352, 2020. 10.22331\/q-2020-10-28-352.","DOI":"10.22331\/q-2020-10-28-352"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Austin G Fowler. Optimal complexity correction of correlated errors in the surface code. arXiv preprint arXiv:1310.0863, 2013. 10.48550\/arXiv.1310.0863.","DOI":"10.48550\/arXiv.1310.0863"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Craig Gidney. Stim: a fast stabilizer circuit simulator. Quantum, 5: 497, July 2021a. ISSN 2521-327X. 10.22331\/q-2021-07-06-497.","DOI":"10.22331\/q-2021-07-06-497"},{"key":"7","unstructured":"Craig Gidney. The stim circuit file format (.stim). https:\/\/github.com\/quantumlib\/Stim\/blob\/main\/doc\/file_format_stim_circuit.md, 2021b. Accessed: 2021-08-16."},{"key":"8","doi-asserted-by":"publisher","unstructured":"Craig Gidney, Michael Newman, Austin Fowler, and Michael Broughton. A fault-tolerant honeycomb memory. Quantum, 5: 605, 2021. 10.22331\/q-2021-12-20-605.","DOI":"10.22331\/q-2021-12-20-605"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Craig Gidney, Michael Newman, and Matt Mcewen. Data for \"Benchmarking the Planar Honeycomb Code\". Zenodo, September 2022. 10.5281\/zenodo.7072889.","DOI":"10.5281\/zenodo.7072889"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Jeongwan Haah and Matthew B Hastings. Boundaries for the honeycomb code. Quantum, 6: 693, 2022. 10.22331\/q-2022-04-21-693.","DOI":"10.22331\/q-2022-04-21-693"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Matthew B Hastings and Jeongwan Haah. Dynamically generated logical qubits. Quantum, 5: 564, 2021. 10.22331\/q-2021-10-19-564.","DOI":"10.22331\/q-2021-10-19-564"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Alexei Kitaev. Anyons in an exactly solved model and beyond. Annals of Physics, 321 (1): 2\u2013111, 2006. 10.1016\/j.aop.2005.10.005.","DOI":"10.1016\/j.aop.2005.10.005"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Yi-Chan Lee, Courtney G Brell, and Steven T Flammia. Topological quantum error correction in the kitaev honeycomb model. Journal of Statistical Mechanics: Theory and Experiment, 2017 (8): 083106, 2017. 10.1088\/1742-5468\/aa7ee2.","DOI":"10.1088\/1742-5468\/aa7ee2"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Muyuan Li, Daniel Miller, Michael Newman, Yukai Wu, and Kenneth R. Brown. 2d compass codes. Physical Review X, 9 (2), may 2019. 10.1103\/physrevx.9.021041.","DOI":"10.1103\/physrevx.9.021041"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Martin Suchara, Sergey Bravyi, and Barbara Terhal. Constructions and noise threshold of topological subsystem codes. Journal of Physics A: Mathematical and Theoretical, 44 (15): 155301, 2011. 10.1088\/1751-8113\/44\/15\/155301.","DOI":"10.1088\/1751-8113\/44\/15\/155301"},{"key":"16","doi-asserted-by":"publisher","unstructured":"James R Wootton. Hexagonal matching codes with two-body measurements. Journal of Physics A: Mathematical and Theoretical, 55 (29): 295302, jul 2022. 10.1088\/1751-8121\/ac7a75.","DOI":"10.1088\/1751-8121\/ac7a75"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2022-09-21-813\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T12:09:53Z","timestamp":1663762193000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2022-09-21-813\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,21]]},"references-count":17,"URL":"https:\/\/doi.org\/10.22331\/q-2022-09-21-813","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,21]]},"article-number":"813"}}