- Physical Review Journals
All JournalsPhysics Magazine

Physical Review Research

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
  • Open Access

Optimizing compilation of error correction codes for 2×n quantum dot arrays and its NP hardness

Anthony Micciche1,*, Feroz Ahmed Mian1, Anasua Chatterjee2, Andrew McGregor1, and Stefan Krastanov1,†

  • *Contact author: amicciche@umass.edu
  • †Contact author: skrastanov@umass.edu
PDF

Phys. Rev. Research 8, 013212 – Published 25 February, 2026

DOI: https://doi.org/10.1103/l5y5-v3k7

Abstract

The ability to physically move qubits within a register allows the design of hardware-specific error correction codes, which can achieve fault tolerance while respecting other constraints. In particular, recent advancements have demonstrated the shuttling of electron and hole spin qubits through a quantum dot array with high fidelity. It is therefore timely to explore error correction architectures consisting merely of two parallel quantum dot arrays, an experimentally validated architecture compatible with classical wiring and control constraints. Upon such an architecture, we develop a suite of heuristic methods for compiling any Calderbank-Shor-Steane (CSS) error-correcting code's syndrome-extraction circuit to run with a reduced number of shuttling operations. We demonstrate how column-regular qLDPC codes can be compiled in a provably minimal number of shuttles that is exactly equal to the column weight of the code when Shor-style syndrome extraction is used. We provide tables stating the number of required shuttles for many contemporary codes of interest. In addition, we provide a proof of the NP hardness of minimizing the number of shuttle operations for general codes, even when using Shor-syndrome extraction. We also discuss how one could get around this by placing blanks in the ancilla array to achieve minimal shuttles with Shor-syndrome extraction on any CSS code, at the cost of longer ancilla arrays.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (37)

  1. A. Zwerver, Scaling spin qubits in quantum dots more—distant—industrial, Dissertation (TU Delft), Delft University of Technology, 2022, https://doi.org/10.4233/uuid:d09dedd5-de2b-4da9-b17f-5a61bc439805.
  2. G. Burkard, T. D. Ladd, A. Pan, J. M. Nichol, and J. R. Petta, Semiconductor spin qubits, Rev. Mod. Phys. 95, 025003 (2023).
  3. C.-A. Wang, V. John, H. Tidjani, C. X. Yu, A. S. Ivlev, C. Déprez, F. van Riggelen-Doelman, B. D. Woods, N. W. Hendrickx, W. I. L. Lawrie, L. E. A. Stehouwer, S. D. Oosterhout, A. Sammak, M. Friesen, G. Scappucci, S. L. de Snoo, M. Rimbach-Russ, F. Borsoi, and M. Veldhorst, Operating semiconductor quantum processors with hopping spins, Science 385, 447 (2024).
  4. A. M. J. Zwerver, S. V. Amitonov, S. L. de Snoo, M. T. Mądzik, M. Rimbach-Russ, A. Sammak, G. Scappucci, and L. M. K. Vandersypen, Shuttling an electron spin through a silicon quantum dot array, PRX Quantum 4, 030303 (2023).
  5. F. Ansaloni, A. Chatterjee, H. Bohuslavskyi, B. Bertrand, L. Hutin, M. Vinet, and F. Kuemmeth, Single-electron operations in a foundry-fabricated array of quantum dots, Nat. Commun. 11, 6399 (2020).
  6. F. Ansaloni, H. Bohuslavskyi, F. Fedele, T. Rasmussen, B. Brovang, F. Berritta, A. Heskes, J. Li, L. Hutin, B. Venitucci, B. Bertrand, M. Vinet, Y.-M. Niquet, A. Chatterjee, and F. Kuemmeth, Gate reflectometry in dense quantum dot arrays, New J. Phys. 25, 033023 (2023).
  7. A. Siegel, A. Strikis, and M. Fogarty, Towards early fault tolerance on a 2×n array of qubits equipped with shuttling, PRX Quantum 5, 040328 (2024).
  8. N. P. Breuckmann and J. N. Eberhardt, Quantum low-density parity-check codes, PRX Quantum 2, 040101 (2021).
  9. D. Gottesman, Fault-tolerant quantum computation with constant overhead, Quantum Inf. Comput. 14, 1338 (2024).
  10. A. Siegel, Z. Cai, H. Jnane, B. Koczor, S. Pexton, A. Strikis, and S. Benjamin, Quantum snakes on a plane: Mobile, low dimensional logical qubits on a 2D surface, PRX Quantum (2025).
  11. P. W. Shor, Fault-tolerant quantum computation, in Proceedings of 37th Conference on Foundations of Computer Science (IEEE, Burlington, VT, USA, 1996), pp. 56–65.
  12. https://github.com/amicciche/CircuitCompilation2xn.
  13. A. Micciche and S. Krastanov, CircuitCompilation2xn, Zenodo (2024), https://doi.org/10.5281/zenodo.14320748.
  14. QuantumClifford Contributors, QuantumSavory/QuantumClifford.jl: v0.10.1 (v0.9.12), Zenodo (2024), https://doi.org/10.5281/zenodo.13950271.
  15. A. Y. Kitaev, Quantum error correction with imperfect gates, in Quantum Communication, Computing, and Measurement, edited by O. Hirota, A. S. Holevo, and C. M. Caves (Springer US, Boston, MA, 1997), pp. 181–188.
  16. S. B. Bravyi and A. Y. Kitaev, Quantum codes on a lattice with boundary, arXiv:quant-ph/9811052.
  17. P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A 52, R2493 (1995).
  18. A. Steane, Multiple particle interference and quantum error correction, Proc. R. Soc. London A 452, 2551 (1996).
  19. A. J. Landahl, J. T. Anderson, and P. R. Rice, Fault-tolerant quantum computing with color codes, arXiv:1108.5738.
  20. J. Roffe, L. Z. Cohen, A. O. Quintavalle, D. Chandra, and E. T. Campbell, Bias-tailored quantum LDPC codes, Quantum 7, 1005 (2023).
  21. N. Raveendran, N. Rengaswamy, F. Rozpędek, A. Raina, L. Jiang, and B. Vasić, Finite rate qLDPC-GKP coding scheme that surpasses the CSS hamming bound, Quantum 6, 767 (2022).
  22. P. Panteleev and G. Kalachev, Degenerate quantum LDPC codes with good finite length performance, Quantum 5, 585 (2021).
  23. H.-K. Lin and L. P. Pryadko, Quantum two-block group algebra codes, Phys. Rev. A 109, 022407 (2024).
  24. L. Voss, S. J. Xian, T. Haug, and K. Bharti, Multivariate bicycle codes, Phys. Rev. A 111, L060401 (2025).
  25. S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, High-threshold and low-overhead fault-tolerant quantum memory, Nature (London) 627, 778 (2024).
  26. A. Jacob, C. McLauchlan, and D. E. Browne, Single-shot decoding and fault-tolerant gates with trivariate tricycle codes, arXiv:2508.08191.
  27. L. Pecorari, S. Jandura, G. K. Brennen, and G. Pupillo, High-rate quantum LDPC codes for long-range-connected neutral atom registers, Nat. Commun. 16, 1111 (2025).
  28. N. Berthusen, J. Dreiling, C. Foltz, J. P. Gaebler, T. M. Gatterman, D. Gresh, N. Hewitt, M. Mills, S. A. Moses, B. Neyenhuis, P. Siegfried, and D. Hayes, Experiments with the four-dimensional surface code on a quantum charge-coupled device quantum computer, Phys. Rev. A 110, 062413 (2024).
  29. Z. Liang, K. Liu, H. Song, and Y.-A. Chen, Generalized toric codes on twisted tori for quantum error correction, PRX Quantum 6, 020357 (2025).
  30. Q. Xu, H. Zhou, G. Zheng, D. Bluvstein, J. P. B. Ataides, M. D. Lukin, and L. Jiang, Fast and parallelizable logical computation with homological product codes, Phys. Rev. X 15, 021065 (2025).
  31. E. T. Campbell, A theory of single-shot error correction for adversarial noise, Quantum Sci. Technol. 4, 025006 (2019).
  32. Regular LDPC code, in The Error Correction Zoo, edited by V. V. Albert and P. Faist (2023), https://errorcorrectionzoo.org/c/regular_ldpc.
  33. E. D. Demaine and M. L. Demaine, Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity, Graphs Combin. 23, 195 (2007).
  34. C. Gidney, Stim: A fast stabilizer circuit simulator, Quantum 5, 497 (2021).
  35. E. Knill, Quantum computing with realistically noisy devices, Nature (London) 434, 39 (2005).
  36. O. Higgott and C. Gidney, Sparse blossom: Correcting a million errors per core second with minimum-weight matching, Quantum 9, 1600 (2025).
  37. M. Veldhorst, J. C. C. Hwang, C. H. Yang, A. W. Leenstra, B. de Ronde, J. P. Dehollain, J. T. Muhonen, F. E. Hudson, K. M. Itoh, A. Morello, and A. S. Dzurak, An addressable quantum dot qubit with fault-tolerant control-fidelity, Nat. Nanotechnol. 9, 981 (2014).

Outline

Information

Phys. Rev. Research 8, 013212– Published 25 February, 2026
  • Received 27 February 2025
  • Accepted 12 January 2026
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation