A Pair Measurement Surface Code on Pentagons

Craig Gidney

doi:10.22331/q-2023-10-25-1156

A Pair Measurement Surface Code on Pentagons

Craig Gidney

Google Quantum AI, Santa Barbara, California 93117, USA

Published:	2023-10-25, volume 7, page 1156
Eprint:	arXiv:2206.12780v2
Doi:	https://doi.org/10.22331/q-2023-10-25-1156
Citation:	Quantum 7, 1156 (2023).

Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.

Abstract

In this paper, I present a way to compile the surface code into two-body parity measurements ("pair measurements"), where the pair measurements run along the edges of a Cairo pentagonal tiling. The resulting circuit improves on prior work by Chao et al. by using fewer pair measurements per four-body stabilizer measurement (5 instead of 6) and fewer time steps per round of stabilizer measurement (6 instead of 10). Using Monte Carlo sampling, I show that these improvements increase the threshold of the surface code when compiling into pair measurements from $\approx 0.2\%$ to $\approx 0.4\%$, and also that they improve the teraquop footprint at a $0.1\%$ physical gate error rate from $\approx6000$ qubits to $\approx3000$ qubits. However, I also show that the teraquop footprint of Chao et al's construction improves more quickly than mine as physical error rate decreases, and is likely better below a physical gate error rate of $\approx 0.03\%$ (due to bidirectional hook errors in my construction). I also compare to the planar honeycomb code, showing that although this work does noticeably reduce the gap between the surface code and the honeycomb code (when compiling into pair measurements), the honeycomb code is still more efficient (threshold $\approx 0.8\%$, teraquop footprint at $0.1\%$ of $\approx 1000$).

Featured image: A pentagonal tiling overlaid over a surface code, showing the qubit connections used by the construction in the paper to implement a surface code.

Popular summary

Surface codes are an important type of quantum error correcting code. Usually surface codes are implemented using reversible interactions, like controlled-not gates. But some hardware architectures could be based around interactions that are irreversible, like two qubit parity measurements. This paper describes a better way to build a surface code for those architectures. The pairs of qubits interacted by the construction form the edges of a Cairo pentagonal tiling.

► BibTeX data

@article{Gidney2023pairmeasurement,
  doi = {10.22331/q-2023-10-25-1156},
  url = {https://doi.org/10.22331/q-2023-10-25-1156},
  title = {A {P}air {M}easurement {S}urface {C}ode on {P}entagons},
  author = {Gidney, Craig},
  journal = {{Quantum}},
  issn = {2521-327X},
  publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
  volume = {7},
  pages = {1156},
  month = oct,
  year = {2023}
}

► References

[1] Miriam Backens, Simon Perdrix, and Quanlong Wang. A simplified stabilizer ZX-calculus. Electronic Proceedings in Theoretical Computer Science, 236: 1–20, January 2017. 10.4204/eptcs.236.1. URL https://doi.org/10.4204/eptcs.236.1.
https://doi.org/10.4204/eptcs.236.1

[2] 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.
https://doi.org/10.22331/q-2020-10-28-352

[3] Bob Coecke and Ross Duncan. Interacting quantum observables: categorical algebra and diagrammatics. New Journal of Physics, 13 (4): 043016, 2011. 10.1088/1367-2630/13/4/043016.
https://doi.org/10.1088/1367-2630/13/4/043016

[4] Bob Coecke and Aleks Kissinger. Picturing quantum processes. Cambridge University Press, 2017.

[5] Niel de Beaudrap and Dominic Horsman. The ZX calculus is a language for surface code lattice surgery. Quantum, 4: 218, January 2020. 10.22331/q-2020-01-09-218. URL https://doi.org/10.22331/q-2020-01-09-218.
https://doi.org/10.22331/q-2020-01-09-218

[6] Nicolas Delfosse and Naomi H Nickerson. Almost-linear time decoding algorithm for topological codes. Quantum, 5: 595, 2021. 10.22331/q-2021-12-02-595.
https://doi.org/10.22331/q-2021-12-02-595

[7] A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland. Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A, 86: 032324, 2012. 10.1103/PhysRevA.86.032324. arXiv:1208.0928.
https://doi.org/10.1103/PhysRevA.86.032324
arXiv:1208.0928

[8] Craig Gidney. Stim: a fast stabilizer circuit simulator. Quantum, 5: 497, July 2021. ISSN 2521-327X. 10.22331/q-2021-07-06-497.
https://doi.org/10.22331/q-2021-07-06-497

[9] Craig Gidney. Data for "A Pair Measurement Surface Code on Pentagons", June 2022a. URL https://doi.org/10.5281/zenodo.6626417.
https://doi.org/10.5281/zenodo.6626417

[10] Craig Gidney. Sinter source code on github. https://github.com/quantumlib/Stim/tree/main/glue/sample, 2022b.
https://github.com/quantumlib/Stim/tree/main/glue/sample

[11] Craig Gidney and Michael Newman. Benchmarking the planar honeycomb code. arXiv preprint arXiv:2202.11845, 2022. 10.48550/arXiv.2202.11845.
https://doi.org/10.48550/arXiv.2202.11845
arXiv:2202.11845

[12] 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.
https://doi.org/10.22331/q-2021-12-20-605

[13] Matthew B Hastings and Jeongwan Haah. Dynamically generated logical qubits. Quantum, 5: 564, 2021. 10.22331/q-2021-10-19-564.
https://doi.org/10.22331/q-2021-10-19-564

[14] Clare Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter. Surface code quantum computing by lattice surgery. New Journal of Physics, 14 (12): 123011, 2012. 10.1088/1367-2630/14/12/123011.
https://doi.org/10.1088/1367-2630/14/12/123011

[15] Adam Paetznick, Christina Knapp, Nicolas Delfosse, Bela Bauer, Jeongwan Haah, Matthew B Hastings, and Marcus P da Silva. Performance of planar floquet codes with majorana-based qubits. arXiv preprint arXiv:2202.11829, 2022. 10.48550/arXiv.2202.11829.
https://doi.org/10.48550/arXiv.2202.11829
arXiv:2202.11829

[16] Wikipedia. Cairo pentagonal tiling — Wikipedia, the free encyclopedia. https://en.wikipedia.org/wiki/Cairo_pentagonal_tiling, 2022. [Online; accessed 4-June-2022].
https://en.wikipedia.org/wiki/Cairo_pentagonal_tiling

Cited by

[1] Andreas Bauer, "Topological error correcting processes from fixed-point path integrals", Quantum 8, 1288 (2024).

[2] Shi Jie Samuel Tan and Lev Stambler, "Effective Distance of Higher Dimensional HGPs and Weight-Reduced Quantum LDPC Codes", Quantum 9, 1897 (2025).

[3] Ali Fahimniya, Hossein Dehghani, Kishor Bharti, Sheryl Mathew, Alicia J. Kollár, Alexey V. Gorshkov, and Michael J. Gullans, "Fault-tolerant hyperbolic Floquet quantum error correcting codes", Quantum 9, 1849 (2025).

[4] Peter-Jan H.S. Derks, Alex Townsend-Teague, Jens Eisert, Markus S. Kesselring, Oscar Higgott, and Benjamin J. Brown, "Dynamical codes for hardware with noisy readouts", Quantum 10, 2176 (2026).

[5] Linnea Grans-Samuelsson, Ryan V. Mishmash, David Aasen, Christina Knapp, Bela Bauer, Brad Lackey, Marcus P. da Silva, and Parsa Bonderson, "Improved Pairwise Measurement-Based Surface Code", Quantum 8, 1429 (2024).

[6] Guillermo Escobar-Arrieta and Mauricio Gutiérrez, "Improved performance of the Bacon-Shor code with Steane's syndrome extraction method", Physical Review A 111 3, 032427 (2025).

[7] Andreas Bauer, "x+y Floquet code: A simple example for topological quantum computation in the path-integral approach", Physical Review A 111 3, 032413 (2025).

[8] Ioana Moflic and Alexandru Paler, "On the constant depth implementation of Pauli exponentials", npj Quantum Information 12 1, 82 (2026).

[9] Andreas Bauer and Julio C. Magdalena de la Fuente, "Planar Fault-Tolerant Circuits for Non-Clifford Gates on the 2D Color Code", PRX Quantum 7 2, 020367 (2026).

[10] Oscar Higgott and Nikolas P. Breuckmann, "Constructions and Performance of Hyperbolic and Semi-Hyperbolic Floquet Codes", PRX Quantum 5 4, 040327 (2024).

[11] Hector Bombin, Daniel Litinski, Naomi Nickerson, Fernando Pastawski, and Sam Roberts, "Unifying flavors of fault tolerance with the ZX calculus", Quantum 8, 1379 (2024).

[12] György P. Gehér, Marcin Jastrzebski, Earl T. Campbell, and Ophelia Crawford, "To reset, or not to reset—that is the question", npj Quantum Information 11 1, 39 (2025).

[13] César Benito, Esperanza López, Borja Peropadre, and Alejandro Bermudez, "Comparative study of quantum error correction strategies for the heavy-hexagonal lattice", Quantum 9, 1623 (2025).

[14] Linnea Grans-Samuelsson, David Aasen, and Parsa Bonderson, "Fault-tolerant pairwise measurement-based code on eight qubits", Physical Review A 112 4, 042413 (2025).

[15] David Aasen, Morteza Aghaee, Zulfi Alam, Mariusz Andrzejczuk, Andrey Antipov, Mikhail Astafev, Lukas Avilovas, Amin Barzegar, Bela Bauer, Jonathan Becker, Juan M. Bello-Rivas, Umesh Bhaskar, Alex Bocharov, Srini Boddapati, David Bohn, Jouri Bommer, Parsa Bonderson, Jan Borovsky, Leo Bourdet, Samuel Boutin, Tom Brown, Gary Campbell, Lucas Casparis, Srivatsa Chakravarthi, Rui Chao, Benjamin J. Chapman, Sohail Chatoor, Anna Wulff Christensen, Patrick Codd, William Cole, Paul Cooper, Fabiano Corsetti, Ajuan Cui, Wim van Dam, Tareq El Dandachi, Sahar Daraeizadeh, Adrian Dumitrascu, Andreas Ekefjärd, Saeed Fallahi, Luca Galletti, Geoff Gardner, Raghu Gatta, Haris Gavranovic, Michael Goulding, Deshan Govender, Flavio Griggio, Ruben Grigoryan, Sebastian Grijalva, Sergei Gronin, Jan Gukelberger, Jeongwan Haah, Marzie Hamdast, Esben Bork Hansen, Matthew Hastings, Sebastian Heedt, Samantha Ho, Justin Hogaboam, Laurens Holgaard, Kevin Van Hoogdalem, Jinnapat Indrapiromkul, Henrik Ingerslev, Lovro Ivancevic, Sarah Jablonski, Thomas Jensen, Jaspreet Jhoja, Jeffrey Jones, Kostya Kalashnikov, Ray Kallaher, Rachpon Kalra, Farhad Karimi, Torsten Karzig, Seth Kimes, Vadym Kliuchnikov, Maren Elisabeth Kloster, Christina Knapp, Derek Knee, Jonne Koski, Pasi Kostamo, Jamie Kuesel, Brad Lackey, Tom Laeven, Jeffrey Lai, Gijs de Lange, Thorvald Larsen, Jason Lee, Kyunghoon Lee, Grant Leum, Kongyi Li, Tyler Lindemann, Marijn Lucas, Roman Lutchyn, Morten Hannibal Madsen, Nash Madulid, Michael Manfra, Signe Brynold Markussen, Esteban Martinez, Marco Mattila, Jake Mattinson, Robert McNeil, Antonio Rodolph Mei, Ryan V. Mishmash, Gopakumar Mohandas, Christian Mollgaard, Michiel de Moor, Trevor Morgan, George Moussa, Anirudh Narla, Chetan Nayak, Jens Hedegaard Nielsen, William Hvidtfelt Padkær Nielsen, Frédéric Nolet, Mike Nystrom, Eoin O’Farrell, Keita Otani, Adam Paetznick, Camille Papon, Andres Paz, Karl Petersson, Luca Petit, Dima Pikulin, Diego Olivier Fernandez Pons, Sam Quinn, Mohana Rajpalke, Alejandro Alcaraz Ramirez, Katrine Rasmussen, David Razmadze, Ben Reichardt, Yuan Ren, Ken Reneris, Roy Riccomini, Ivan Sadovskyy, Lauri Sainiemi, Juan Carlos Estrada Saldaña, Irene Sanlorenzo, Simon Schaal, Emma Schmidgall, Cristina Sfiligoj, Marcus P. da Silva, Shilpi Singh, Sarat Sinha, Mathias Soeken, Patrick Sohr, Tomas Stankevic, Lieuwe Stek, Patrick Strøm-Hansen, Eric Stuppard, Aarthi Sundaram, Henri Suominen, Judith Suter, Satoshi Suzuki, Krysta Svore, Sam Teicher, Nivetha Thiyagarajah, Raj Tholapi, Mason Thomas, Dennis Tom, Emily Toomey, Josh Tracy, Matthias Troyer, Michelle Turley, Matthew D. Turner, Shivendra Upadhyay, Ivan Urban, Alexander Vaschillo, Dmitrii Viazmitinov, Dominik Vogel, Zhenghan Wang, John Watson, Alex Webster, Joseph Weston, Timothy Williamson, Georg W. Winkler, David J. van Woerkom, Brian Paquelet Wütz, Chung Kai Yang, Richard Yu, Emrah Yucelen, Jesús Herranz Zamorano, Roland Zeisel, Guoji Zheng, Justin Zilke, and Andrew Zimmerman, "Blueprint for fault-tolerant quantum computation with topological qubit arrays", Physical Review Research 7 4, 041002 (2025).

[16] Alon Kukliansky and Brad Lackey, "Quantum Circuit Tensors and Enumerators With Applications to Quantum Fault Tolerance", IEEE Transactions on Information Theory 71 6, 4406 (2025).

[17] Shouzhen Gu, Alex Retzker, and Aleksander Kubica, "Fault-tolerant quantum architectures based on erasure qubits", Physical Review Research 7 1, 013249 (2025).

[18] Matt McEwen, Dave Bacon, and Craig Gidney, "Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics", Quantum 7, 1172 (2023).

[19] Nicolas Delfosse and Adam Paetznick, "Spacetime codes of Clifford circuits", arXiv:2304.05943, (2023).

[20] Craig Gidney and Cody Jones, "New circuits and an open source decoder for the color code", arXiv:2312.08813, (2023).

[21] Gözde Üstün, Andrea Morello, and Simon Devitt, "Single-step parity check gate set for quantum error correction", Quantum Science and Technology 9 3, 035037 (2024).

[22] David Aasen, Jeongwan Haah, Zhi Li, and Roger S. K. Mong, "Measurement Quantum Cellular Automata and Anomalies in Floquet Codes", arXiv:2304.01277, (2023).

[23] Benjamin Rodatz, Boldizsár Poór, and Aleks Kissinger, "Floquetifying stabiliser codes with distance-preserving rewrites", arXiv:2410.17240, (2024).

[24] Hector Bombin, Chris Dawson, Terry Farrelly, Yehua Liu, Naomi Nickerson, Mihir Pant, Fernando Pastawski, and Sam Roberts, "Fault-tolerant complexes", arXiv:2308.07844, (2023).

[25] Nicolas Delfosse, Andres Paz, Alexander Vaschillo, and Krysta M. Svore, "How to choose a decoder for a fault-tolerant quantum computer? The speed vs accuracy trade-off", arXiv:2310.15313, (2023).

[26] Alex Townsend-Teague, Julio Magdalena de la Fuente, and Markus Kesselring, "Floquetifying the Colour Code", arXiv:2307.11136, (2023).

[27] Benjamin Rodatz, Boldizsár Poór, and Aleks Kissinger, "Fault Tolerance by Construction", arXiv:2506.17181, (2025).

[28] Peter-Jan H. S. Derks, Alex Townsend-Teague, Jens Eisert, Markus S. Kesselring, Oscar Higgott, and Benjamin J. Brown, "Dynamical codes for hardware with noisy readouts", arXiv:2505.07658, (2025).

[29] Jiaxin Huang, Sarah Meng Li, Lia Yeh, Aleks Kissinger, Michele Mosca, and Michael Vasmer, "Graphical CSS Code Transformation Using ZX Calculus", arXiv:2307.02437, (2023).

[30] Yichen Xu and Arpit Dua, "Fault-tolerant protocols through spacetime concatenation", arXiv:2504.08918, (2025).

[31] Matthew J. Reagor, Thomas C. Bohdanowicz, David Rodriguez Perez, Eyob A. Sete, and William J. Zeng, "Hardware optimized parity check gates for superconducting surface codes", arXiv:2211.06382, (2022).

[32] Victor V. Albert and Philippe Faist, "Handbook of Error-Correcting Codes", arXiv:2606.11484, (2026).

[33] Nicolas Delfosse and Adam Paetznick, "Simulation of noisy Clifford circuits without fault propagation", arXiv:2309.15345, (2023).

[34] Tuomas Laakkonen, Konstantinos Meichanetzidis, and John van de Wetering, "Picturing Counting Reductions with the ZH-Calculus", arXiv:2304.02524, (2023).

The above citations are from Crossref's cited-by service (last updated successfully 2026-08-08 18:19:25) and SAO/NASA ADS (last updated successfully 2026-08-08 18:19:27). The list may be incomplete as not all publishers provide suitable and complete citation data.

This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.