Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Editors' Suggestion
  • Open Access

Tile Codes: High-Efficiency Quantum Codes on a Lattice with Boundary

Vincent Steffan1,*,†, Shin Ho Choe1,*, Nikolas P. Breuckmann2, Francisco Revson Fernandes Pereira1, and Jens Niklas Eberhardt3

  • *These authors contributed equally to this work.
  • †Contact author: vincent.steffan@meetiqm.com

Phys. Rev. Lett. 135, 170601 – Published 21 October, 2025

DOI: https://doi.org/10.1103/l4mx-l3xx

Abstract

We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer weight. Our construction does not compromise on the fact that the codes are local on a lattice with open boundary conditions. Despite its simplicity, we use our construction to find codes with parameters [[288,8,12]] using weight-6 stabilizers and [[288,8,14]] using weight-8 stabilizers, outperforming all previously known constructions in this direction. Allowing for a slightly higher nonlocality, we find a [[512,18,19]] code using weight-8 stabilizers, which outperforms the rotated surface code by a factor of more than 12. Our approach provides a unified framework for understanding the structure of codes that are local on a 2D planar lattice and offers a systematic way to explore the space of possible code parameters. In particular, due to its simplicity, the construction naturally accommodates various types of boundary conditions and stabilizer configurations, making it a versatile tool for quantum error-correction code design.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (31)

  1. S. B. Bravyi and A. Y. Kitaev, arXiv:quant-ph/9811052.
  2. M. H. Freedman and D. A. Meyer, Found. Comput. Math. 1, 325 (2001).
  3. C. K. Andersen, A. Remm, S. Lazar, S. Krinner, N. Lacroix, G. J. Norris, M. Gabureac, C. Eichler, and A. Wallraff, Nat. Phys. 16, 875 (2020).
  4. S. Krinner, N. Lacroix, A. Remm, A. Di Paolo, E. Genois, C. Leroux, C. Hellings, S. Lazar, F. Swiadek, J. Herrmann, G. J. Norris, C. K. Andersen, M. Müller, A. Blais, C. Eichler, and A. Wallraff, Nature (London) 605, 669 (2022).
  5. Google Quantum AI and Collaborators, Nature (London) 614, 676 (2023).
  6. Google Quantum AI and Collaborators, Nature (London) 638, 920 (2024).
  7. N. P. Breuckmann and J. N. Eberhardt, PRX Quantum 2, 040101 (2021).
  8. S. Bravyi, D. Poulin, and B. Terhal, Phys. Rev. Lett. 104, 050503 (2010).
  9. F. Vigneau, S. Majumder, A. Rath, P. Parrado-Rodríguez, F. R. F. Pereira, S. Pogorzalek, T. Jones, N. Wurz, M. Renger, J. Verjauw, P. Yang, H.-S. Ku, W. Kindel, F. Deppe, and J. Heinsoo, arXiv:2503.12869.
  10. M. Renger et al., arXiv:2503.10903.
  11. A. Wallraff, D. I. Schuster, A. Blais, L. Frunzio, R.-. S. Huang, J. Majer, S. Kumar, S. M. Girvin, and R. J. Schoelkopf, Nature (London) 431, 162 (2004).
  12. A. Blais, R.-S. Huang, A. Wallraff, S. M. Girvin, and R. J. Schoelkopf, Phys. Rev. A 69, 062320 (2004).
  13. C. Song, K. Xu, W. Liu, C.-p. Yang, S.-B. Zheng, H. Deng, Q. Xie, K. Huang, Q. Guo, L. Zhang et al., Phys. Rev. Lett. 119, 180511 (2017).
  14. C. Song, K. Xu, H. Li, Y.-R. Zhang, X. Zhang, W. Liu, Q. Guo, Z. Wang, W. Ren, J. Hao et al., Science 365, 574 (2019).
  15. Z. Liang, J. N. Eberhardt, and Y.-A. Chen, arXiv:2504.08887.
  16. H.-K. Lin and L. P. Pryadko, Phys. Rev. A 109, 022407 (2024).
  17. S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, Nature (London) 627, 778 (2024).
  18. J. N. Eberhardt, F. R. F. Pereira, and V. Steffan, arXiv:2412.04181.
  19. J. N. Eberhardt and V. Steffan, IEEE Transactions on Information Theory (IEEE, 2025), 10.1109/TIT.2024.3521638.
  20. K. Chen, Y. Liu, Y. Zhang, Z. Liang, Y.-A. Chen, K. Liu, and H. Song, Phys. Rev. Lett. 135, 076603 (2025).
  21. Z. Liang, K. Liu, H. Song, and Y.-A. Chen, arXiv:2503.03827.
  22. Z. Liang, B. Yang, J. T. Iosue, and Y.-A. Chen, arXiv:2410.11942.
  23. N. Berthusen, D. Devulapalli, E. Schoute, A. M. Childs, M. J. Gullans, A. V. Gorshkov, and D. Gottesman, PRX Quantum 6, 010306 (2025).
  24. C. A. Pattison, A. Krishna, and J. Preskill, Quantum 9, 1728 (2025).
  25. Note that our convention is to label both the horizontal and vertical edges touching the origin of the box in (T1) with (0,0).

  26. Consider an X tile with support (x,y) shifted by (a,b) overlapping with a Z tile at (x+a,y+b). By condition (T2), the unshifted X tile must have support [(B−1)−x−a,(B−1)−y−b]. Thus, the shifted X tile has support [(B−1)−x,(B−1)−y], which by (T2) is also in the Z tile’s support. This symmetry ensures that all overlaps are even.

  27. On the infinite lattice Z×Z, tiles with condition (T2) give rise to a Pauli Hamiltonian with commuting terms. It turns out [20, 28] that the groundspace of this Hamiltonian exhibits topological order only if (T2) holds. Practically, this means that (T2) is necessary if we want these tile codes to have distance scaling with the dimensions of the layout.

  28. J. Haah, Revista colombiana de matematicas 50, 299 (2017).
  29. L. Pecorari, S. Jandura, G. K. Brennen, and G. Pupillo, Nat. Commun. 16, 1111 (2025).
  30. GAP, GAP—Groups, Algorithms, and Programming, Version 4.13.1, The GAP Group (2024), https://www.gap-system.org/cite/.
  31. L. P. Pryadko, V. A. Shabashov, and V. K. Kozin, J. Open Source Software 7, 4120 (2022).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation