- Open Access
Surface Code with Imperfect Erasure Checks
PRX Quantum 6, 040355 – Published 4 December, 2025
DOI: https://doi.org/10.1103/d1v7-nctj
Abstract
Recently, significant effort has been devoted towards designing erasure qubits in which dominant physical noise excites detectable leakage states that can be returned to the qubit subspace. Interest in these erasure qubits has been driven by studies showing that the requirements for fault-tolerant quantum error correction are significantly relaxed when noise in every gate operation is dominated by erasures. However, these studies assume perfectly accurate erasure checks after every gate operation which generally come with undesirable time and hardware overhead costs. In this work, we investigate the consequences of using an imperfect but overhead-efficient erasure check for fault-tolerant quantum error correction with the surface code. We show that, under physically reasonable assumptions on the imperfect erasure checks, the threshold error rate is still at least over twice that for Pauli noise. We also study the impact of imperfect erasure checks on the effective error distance and find that it degrades the effective distance under a general error model in which a qubit suffers from depolarizing noise when interacting with a leaked qubit. We then identify a more restrictive but realistic noise model for a qubit that interacts with a leaked qubit, under which the effective error distance is twice that for Pauli noise. We apply our analysis to recently proposed superconducting dual-rail erasure qubits and show that achieving good-performance surface code quantum memories with relaxed system requirements is possible.
Physics Subject Headings (PhySH)
Popular Summary
Quantum error-correcting codes are required to build scalable quantum computers; however, implementing them incurs significant space and time overhead. A promising route toward reducing this overhead is using erasure qubits, which are engineered such that the dominant noise process takes qubits to detectable leakage states. By intermittently performing erasure checks that identify qubits in these states, one can infer when and where errors occur. This additional information allows erasures to be corrected more efficiently than standard Pauli errors, which are unheralded bit- or phase-flip errors.
Previous analyses of erasure qubits typically assume that erasure checks are performed with perfect accuracy, neglecting the cost of performing frequent, high-fidelity checks in real hardware. In this work, we analyze the impact of imperfect but overhead-efficient erasure checks on the performance of the surface code, a leading quantum error-correcting code. We show that, under realistic physical assumptions, the error threshold remains more than twice as high as for standard Pauli noise, demonstrating that erasure-based architectures retain a substantial advantage even with imperfect checks.
Another important metric is the effective distance, which determines how many errors a code can correct. Idealized erasures double the effective distance compared to Pauli noise. We find that, for physically motivated imperfect checks, this doubling persists. By applying results to recently proposed superconducting dual-rail erasure qubits, we find that one can reap the benefits of an erasure architecture even with relaxed system requirements and realistically imperfect erasure checks, establishing erasure platforms as a viable and efficient path toward scalable, fault-tolerant quantum computation.
See Also
Optimizing Quantum Error-Correction Protocols with Erasure Qubits
Article Text
References (67)
- P. Aliferis, and J. Preskill, Fault-tolerant quantum computation against biased noise, Phys. Rev. A 78, 052331 (2008).
- P. Aliferis, F. Brito, D. P. DiVincenzo, J. Preskill, M. Steffen, and B. M. Terhal, Fault-tolerant computing with biased-noise superconducting qubits: A case study, New J. Phys. 11, 013061 (2009).
- P. Brooks, and J. Preskill, Fault-tolerant quantum computation with asymmetric Bacon-Shor codes, Phys. Rev. A 87, 032310 (2013).
- A. M. Stephens, W. J. Munro, and K. Nemoto, High-threshold topological quantum error correction against biased noise, Phys. Rev. A 88, 060301(R) (2013).
- P. Webster, S. D. Bartlett, and D. Poulin, Reducing the overhead for quantum computation when noise is biased, Phys. Rev. A 92, 062309 (2015).
- D. K. Tuckett, A. S. Darmawan, C. T. Chubb, S. Bravyi, S. D. Bartlett, and S. T. Flammia, Tailoring surface codes for highly biased noise, Phys. Rev. X 9, 041031 (2019).
- D. K. Tuckett, S. D. Bartlett, and S. T. Flammia, Ultrahigh error threshold for surface codes with biased noise, Phys. Rev. Lett. 120, 050505 (2018).
- D. K. Tuckett, S. D. Bartlett, S. T. Flammia, and B. J. Brown, Fault-tolerant thresholds for the surface code in excess of 5% under biased noise, Phys. Rev. Lett. 124, 130501 (2020).
- J. P. Bonilla Ataides, D. K. Tuckett, S. D. Bartlett, S. T. Flammia, and B. J. Brown, The XZZX surface code, Nat. Commun. 12, 2172 (2021).
- A. Dua, A. Kubica, L. Jiang, S. T. Flammia, and M. J. Gullans, Clifford-deformed surface codes, PRX Quantum 5, 010347 (2024).
- O. Higgott, T. C. Bohdanowicz, A. Kubica, S. T. Flammia, and E. T. Campbell, Improved decoding of circuit noise and fragile boundaries of tailored surface codes, Phys. Rev. X 13, 031007 (2023).
- Q. Xu, N. Mannucci, A. Seif, A. Kubica, S. T. Flammia, and L. Jiang, Tailored XZZX codes for biased noise, Phys. Rev. Res. 5, 013035 (2023).
- S. Singh, A. S. Darmawan, B. J. Brown, and S. Puri, High-fidelity magic-state preparation with a biased-noise architecture, Phys. Rev. A 105, 052410 (2022).
- A. S. Darmawan, B. J. Brown, A. L. Grimsmo, D. K. Tuckett, and S. Puri, Practical quantum error correction with the XZZX code and Kerr-cat qubits, PRX Quantum 2, 030345 (2021).
- D. Gottesman, Stabilizer codes and quantum error correction. Caltech Ph. D, Thesis, eprint: quant-ph/9705052 (1997).
- M. Grassl, T. Beth, and T. Pellizzari, Codes for the quantum erasure channel, Phys. Rev. A 56, 33 (1997).
- Y. Wu, S. Kolkowitz, S. Puri, and J. D. Thompson, Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays, Nat. Commun. 13, 4657 (2022).
- K. Sahay, J. Jin, J. Claes, J. D. Thompson, and S. Puri, High-threshold codes for neutral-atom qubits with biased erasure errors, Phys. Rev. X 13, 041013 (2023).
- A. Kubica, A. Haim, Y. Vaknin, H. Levine, F. Brandão, and A. Retzker, Erasure qubits: Overcoming the limit in superconducting circuits, Phys. Rev. X 13, 041022 (2023).
- J. D. Teoh, P. Winkel, H. K. Babla, B. J. Chapman, J. Claes, S. J. de Graaf, J. W. Garmon, W. D. Kalfus, Y. Lu, A. Maiti et al., Dual-rail encoding with superconducting cavities, Proc. Natl. Acad. Sci. 120, e2221736120 (2023).
- W. C. Campbell, Certified quantum gates, Phys. Rev. A 102, 022426 (2020).
- M. Kang, W. C. Campbell, and K. R. Brown, Quantum error correction with metastable states of trapped ions using erasure conversion, PRX Quantum 4, 020358 (2023).
- S. Ma, G. Liu, P. Peng, B. Zhang, S. Jandura, J. Claes, A. P. Burgers, G. Pupillo, S. Puri, and J. D. Thompson, High-fidelity gates and mid-circuit erasure conversion in an atomic qubit, Nature 622, 279 (2023).
- A. Koottandavida, I. Tsioutsios, A. Kargioti, C. R. Smith, V. R. Joshi, W. Dai, J. D. Teoh, J. C. Curtis, L. Frunzio, R. J. Schoelkopf, and M. H. Devoret, Erasure detection of a dual-rail qubit encoded in a double-post superconducting cavity, Phys. Rev. Lett. 132, 180601 (2024).
- H. Levine et al., Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons, Phys. Rev. X 14, 011051 (2024).
- K. S. Chou, T. Shemma, H. McCarrick, T.-C. Chien, J. D. Teoh, P. Winkel, A. Anderson, J. Chen, J. C. Curtis, S. J. de Graaf et al., A superconducting dual-rail cavity qubit with erasure-detected logical measurements, Nat. Phys. 20, 1454 (2024).
- S. J. de Graaf, S. H. Xue, B. J. Chapman, J. D. Teoh, T. Tsunoda, P. Winkel, J. W. O. Garmon, K. M. Chang, L. Frunzio, S. Puri, and R. J. Schoelkopf, A mid-circuit erasure check on a dual-rail cavity qubit using the joint-photon number-splitting regime of circuit QED, arXiv:2406.14621.
- T. Tsunoda, J. D. Teoh, W. D. Kalfus, S. J. de Graaf, B. J. Chapman, J. C. Curtis, N. Thakur, S. M. Girvin, and R. J. Schoelkopf, Error-detectable bosonic entangling gates with a noisy ancilla, PRX Quantum 4, 020354 (2023).
- I. L. Chuang, and Y. Yamamoto, Simple quantum computer, Phys. Rev. A 52, 3489 (1995).
- E. Knill, R. Laflamme, and G. J. Milburn, A scheme for efficient quantum computation with linear optics, Nature 409, 46 (2001).
- E. Zakka-Bajjani, F. Nguyen, M. Lee, L. R. Vale, R. W. Simmonds, and J. Aumentado, Quantum superposition of a single microwave photon in two different ‘colour’ states, Nat. Phys. 7, 599 (2011).
- Y.-P. Shim, and C. Tahan, Semiconductor-inspired design principles for superconducting quantum computing, Nat. Commun. 7, 11059 (2016).
- D. L. Campbell, Y.-P. Shim, B. Kannan, R. Winik, D. K. Kim, A. Melville, B. M. Niedzielski, J. L. Yoder, C. Tahan, S. Gustavsson et al., Universal nonadiabatic control of small-gap superconducting qubits, Phys. Rev. X 10, 041051 (2020).
- Y. Wu, and L. Zhong, Fusion blossom: Fast MWPM decoders for QEC, ArXiv:2305.08307.
- O. Higgott, and C. Gidney, Sparse blossom: Correcting a million errors per core second with minimum-weight matching, Quantum 9, 1600 (2025).
- A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A–At., Mol. Opt. Phys. 86, 032324 (2012).
- Y. Tomita, and K. M. Svore, Low-distance surface codes under realistic quantum noise, Phys. Rev. A 90, 062320 (2014).
- S. Gu, A. Retzker, and A. Kubica, Fault-tolerant quantum architectures based on erasure qubits, Phys. Rev. Res. 7, 013249 (2025).
- S. Gu, Y. Vaknin, A. Retzker, and A. Kubica, Optimizing quantum error-correction protocols with erasure qubits, PRX Quantum 6, 040354 (2025).
- E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, J. Math. Phys. 43, 4452 (2002).
- P. Aliferis, and B. M. Terhal, Fault-tolerant quantum computation for local leakage faults, Quantum Inf. Comput. 7, 139 (2007).
- A. G. Fowler, Coping with qubit leakage in topological codes, Phys. Rev. A 88, 042308 (2013).
- J. Ghosh, and A. G. Fowler, Leakage-resilient approach to fault-tolerant quantum computing with superconducting elements, Phys. Rev. A 91, 020302(R) (2015).
- M. Suchara, A. W. Cross, and J. M. Gambetta, Leakage suppression in the toric code, Quantum Inf. Comput. 15, 997 (2015).
- N. C. Brown, and K. R. Brown, Leakage mitigation for quantum error correction using a mixed qubit scheme, Phys. Rev. A 100, 032325 (2019).
- F. Battistel, B. M. Varbanov, and B. M. Terhal, Hardware-efficient leakage-reduction scheme for quantum error correction with superconducting transmon qubits, PRX Quantum 2, 030314 (2021).
- M. McEwen, D. Kafri, Z. Chen, J. Atalaya, K. Satzinger, C. Quintana, P. V. Klimov, D. Sank, C. Gidney, A. Fowler et al., Removing leakage-induced correlated errors in superconducting quantum error correction, Nat. Commun. 12, 1761 (2021).
- J. Marques, H. Ali, B. Varbanov, M. Finkel, H. Veen, S. van der Meer, S. Valles-Sanclemente, N. Muthusubramanian, M. Beekman, N. Haider et al., All-microwave leakage reduction units for quantum error correction with superconducting transmon qubits, Phys. Rev. Lett. 130, 250602 (2023).
- J. Ghosh, A. G. Fowler, J. M. Martinis, and M. R. Geller, Understanding the effects of leakage in superconducting quantum-error-detection circuits, Phys. Rev. A 88, 062329 (2013).
- N. C. Brown, and K. R. Brown, Comparing Zeeman qubits to hyperfine qubits in the context of the surface code: and , Phys. Rev. A 97, 052301 (2018).
- A. Robertson, C. Granade, S. D. Bartlett, and S. T. Flammia, Tailored codes for small quantum memories, Phys. Rev. Appl. 8, 064004 (2017).
- L. Hänggli, M. Heinze, and R. König, Enhanced noise resilience of the surface–Gottesman-Kitaev-Preskill code via designed bias, Phys. Rev. A 102, 052408 (2020).
- S. Huang, and K. R. Brown, Fault-tolerant compass codes, Phys. Rev. A 101, 042312 (2020).
- O. Higgott, and N. P. Breuckmann, Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead, Phys. Rev. X 11, 031039 (2021).
- J. Guillaud, and M. Mirrahimi, Error rates and resource overheads of repetition cat qubits, Phys. Rev. A 103, 042413 (2021).
- C. Chamberland, K. Noh, P. Arrangoiz-Arriola, E. T. Campbell, C. T. Hann, J. Iverson, H. Putterman, T. C. Bohdanowicz, S. T. Flammia, A. Keller et al., Building a fault-tolerant quantum computer using concatenated cat codes, PRX Quantum 3, 010329 (2022).
- J. Roffe, L. Z. Cohen, A. O. Quintavalle, D. Chandra, and E. T. Campbell, Bias-tailored quantum LDPC codes, Quantum 7, 1005 (2023).
- C. H. Bennett, D. P. DiVincenzo, and J. A. Smolin, Capacities of quantum erasure channels, Phys. Rev. Lett. 78, 3217 (1997).
- N. Delfosse, and G. Zémor, Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel, Phys. Rev. Res. 2, 033042 (2020).
- N. Delfosse, and N. H. Nickerson, Almost-linear time decoding algorithm for topological codes, Quantum 5, 595 (2021).
- S. Huang, M. Newman, and K. R. Brown, Fault-tolerant weighted union-find decoding on the toric code, Phys. Rev. A 102, 012419 (2020).
- C. Wang, J. H. Harrington, and J. Preskill, Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory, Ann. Phys. 303, 31 (2003).
- T. M. Stace, S. D. Barrett, and A. C. Doherty, Thresholds for topological codes in the presence of loss, Phys. Rev. Lett. 102, 200501 (2009).
- S. D. Barrett, and T. M. Stace, Fault tolerant quantum computation with very high threshold for loss errors, Phys. Rev. Lett. 105, 200502 (2010).
- C.-C. Yu, Z.-H. Chen, Y.-H. Deng, M.-C. Chen, C.-Y. Lu, and J.-W. Pan, Tracking and decoding Rydberg leakage error with MBQC, ArXiv:2411.04664.
- G. Baranes, M. Cain, J. Ataides, D. Bluvstein, J. Sinclair, V. Vuletic, H. Zhou, and M. D. Lukin, Leveraging atom loss errors in fault tolerant quantum algorithms, ArXiv:2502.20558.
- J. Claes, and S. Puri, Estimating the bias of gates via character randomized benchmarking, PRX Quantum 4, 010307 (2023).
