betaFeedback

WorksPhysics and Astronomy

Simplifying models of noisy stabilizer QEC on leakage qubits by Pauli twirling

Abstract

The growing capabilities of quantum error-correction (QEC) experiments make it increasingly important to develop methods that predict or assess logical performance over many QEC cycles. Prior work has shown that a stabilizer QEC cycle subject to Pauli-stochastic noise can be modeled by a classical Markov process over syndrome states, with a logical Pauli channel attached to each syndrome transition. Here, we extend this framework to systems in which physical qubits are subject to leakage. We first develop the theory of leakage-dephased Pauli twirling and show that twirled processes can be expressed in terms of Pauli maps on the computational subspace, conditioned on transitions between leakage patterns. We apply this theory to noisy stabilizer QEC with leakage, demonstrating that a QEC cycle with leakage can be modeled by a classical Markov process over the joint syndrome and leakage patterns, with a logical Pauli channel attached to each joint transition. Finally, we derive a transfer-matrix description of repeated QEC cycles and an exact transfer-matrix expression for the success probability of a QEC memory experiment. This framework connects leaky error models of the individual components of the QEC cycle to many-cycle logical performance and provides a foundation for logical characterization and benchmarking methods that can account for leakage.

Introduction

As quantum error-correction (QEC) experiments continue to improve, it becomes increasingly important to develop methods to predict and assess logical performance over many QEC cycles [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]. One approach is to predict logical performance via measurements or models of the individual, low-level physical components involved in the QEC cycle [12, 13, 14, 15, 16]. Alternatively, logical performance can be characterized directly at the logical level, without consideration of the low-level components [17, 18, 19, 20, 21]. However, both approaches are complicated by the fact that the effective logical dynamics under repeated QEC cycles can be non-Markovian (i.e., retain memory) even when the low-level error model is Markovian [2]. Importantly, Ref. [1] has established that a stabilizer QEC cycle subject to Pauli-stochastic noise can be modeled by a classical Markov process over syndrome states, with a logical Pauli channel attached to each syndrome transition. As discussed in Ref. [1], studying the family of logical Pauli channels of a QEC cycle provides a direct means of characterizing the logical performance of repeated applications of that QEC cycle. However, these results do not hold in systems in which qubits experience leakage.

Leakage substantially complicates both the prediction and the assessment of logical performance in stabilizer QEC. A Pauli error acts within the computational qubit space, whereas leakage transfers population into noncomputational levels and can leave information there from one QEC cycle to the next. As a result, modeling a general leakage process could require consideration of the full quantum dynamics, rather than the much simpler stochastic description available for Pauli errors. Furthermore, in general the full quantum state, including the leaked degrees of freedom, can influence subsequent gates and thereby affect the errors that occur in later cycles. Because these effects can substantially degrade logical performance, accurately accounting for them is essential. Consequently, modeling repeated QEC in the presence of leakage errors can be considerably more complicated than modeling QEC with Pauli errors. The key simplification in this work comes from Pauli twirling. We develop a version of Pauli twirling for leakage-extended qubits such that twirled error processes can be modeled by Pauli error channels on the computational subspace, conditioned on transitions between leakage patterns. This is formalized in Theorem 1. In this work we apply it to error processes of QEC cycles, but we hope it will be of independent interest in other contexts as well.

Our second main result is obtained by applying Theorem 1 to the mathematical model developed in § 0.2.2 for a noisy stabilizer-code QEC cycle in the presence of leakage. We show that the complete-cycle channel decomposes into subnormalized logical Pauli maps indexed by joint transitions of the syndrome and the data-leakage pattern. This is formalized in Theorem 2. One interpretation of this result is that the syndrome and the data-leakage pattern jointly function as a hidden-memory state carried from one QEC cycle to the next. Thus, a single QEC cycle can be viewed as a classical Markov transition rule on the hidden-memory state space, together with a logical Pauli channel conditioned on each transition. In the setting of Ref. [1], where the error model consists of Pauli noise and no leakage, the analogous hidden-memory state is the syndrome alone. Consequently, Theorem 2 can be interpreted as a generalization of the formalism of Ref. [1] to account for leakage.

Our third main result comes from applying Theorem 2 to QEC memory experiments. We define a QEC memory experiment to consist of state preparation, kk repeated QEC cycles, and a final measurement for which one outcome is designated “success.” For each logical Pauli component, we express its contribution to the success probability in terms of a transfer matrix, a state-preparation vector, and a measurement vector. Each transfer matrix is determined by the dynamics of a single QEC cycle and the dependence on kk enters only through the kkth power of that matrix. The state-preparation vector depends only on the input state, while the measurement vector depends only on the measurement process and its distinguished success outcome; neither depends on the details of the QEC cycle. This is formalized in Theorem 3. Altogether, this formulation of memory experiment success probabilities provides a concrete connection between a single-cycle error model and predictions of many-cycle QEC performance. Furthermore, if the action of the transfer matrices can be well approximated by their dominant left and right eigenspaces, this representation could also lead to approximate Markovian models of the kind developed in Ref. [1]. Although we do not address this direction in detail here, it is an important matter for future work.

Leakage has long been recognized as an important challenge for fault-tolerant QEC. There has been substantial effort to develop methods for analyzing, suppressing, or removing leakage [22, 23, 24, 25, 26, 27, 28]; detecting leakage and incorporating leakage information into error correction [29, 30, 31]; and obtaining tractable representations or simulations of multilevel leakage noise [32, 33, 34]. Our contribution is complementary to these efforts: for any leakage-handling scheme described by our QEC-cycle model, our framework provides a general way to understand how its dynamics contribute to logical errors.

Pauli twirling has long been used to map general qubit noise to Pauli noise, both for simpler noise characterization and as a tractable approximation in simulations of fault-tolerant circuits and QEC [35, 36, 37]. For a noisy implementation of a Clifford operation, a random input Pauli can be propagated through the target Clifford to determine a compensating output Pauli, thereby preserving the target operation while Pauli twirling its residual noise. This construction—which we refer to as Pauli twirling with respect to a Clifford—underlies Pauli-frame randomization, randomized compiling, cycle benchmarking, and other noise-characterization protocols [38, 39, 40]. We note that prior work has generalized some of these ideas to scenarios involving leakage. Randomized-benchmarking protocols have been developed that account for leakage, with some constructions using random relative phases between the computational and leakage subspaces to suppress coherence between them [41, 42, 43]. The subspace-twirling approximation has been used to obtain a tractable incoherent model of leakage in QEC [32], while, under gate-independent, time-independent Markovian-noise assumptions, independent Pauli twirling has been shown to depolarize each leakage-pattern sector, leading to a classical Markov process on the leakage patterns [44].

This work is organized as follows. Section 2 gives a high-level summary of the results and discusses their implications, limitations, and directions for future work. The appendices provide a detailed, largely self-contained mathematical presentation of the results. Appendix A introduces standard Pauli twirling and the structure of Pauli maps in the absence of leakage. Appendix B develops the theory of Pauli twirling with respect to a Clifford. Appendix C introduces leakage-extended qubits, leakage-extended qubit registers, and other mathematical concepts related to leakage, and then proves Theorem 1. Appendix D provides the mathematical formulation of a QEC cycle on leakage-extended qubit registers. Appendix E formulates the model of a QEC cycle in terms of logical Pauli maps conditioned on transitions between leakage patterns and syndrome states, and proves Theorem 2. Appendix F develops the joint syndrome-leakage hidden-memory representation and the transfer-matrix description of repeated QEC experiments, and proves Theorem 3. Finally, Appendix G contains lemmas related to operator spaces.

Summary of results and discussion

Leakage-extended qubits and leakage-dephased Pauli twirling

Our first main result is a structure theorem for leakage-dephased Pauli twirling. This is formalized in Theorem 1, and is described in detail in the rest of this subsection.

Throughout this paper, a leakage-extended qubit space is a Hilbert space H=C⊕L\mathcal{H} = \mathcal{C} \oplus\mathcal{L}, where C\mathcal{C} is a two-dimensional computational qubit subspace and L\mathcal{L} is a one-dimensional leakage subspace (see Definition C.1). Theorem 1 is formulated in terms of a leakage-extended qubit register Q\mathsf{Q}, which consists of a set QQ of system (qubit) labels and a leakage-extended qubit space Hi\mathcal{H}_i for each label i∈Qi \in Q (see Definition C.3). The register’s total Hilbert space is HQ=⨂i∈QHi\mathcal{H}_Q = \bigotimes_{i \in Q} \mathcal{H}_i. A leakage pattern S⊆QS \subseteq Q specifies which labels correspond to leaked qubits (see Definition C.5) and determines a leakage subspace HQS\mathcal{H}_Q^S (see Definition C.7). These subspaces give the decomposition HQ=⨁S⊆QHQS\mathcal{H}_Q = \bigoplus_{S \subseteq Q} \mathcal{H}_Q^S (C.14).

Denote by KQ\mathsf{K}_Q the computational qubit register associated with QQ, obtained by considering only the computational subspace Ci\mathcal{C}_i for each leakage-extended qubit in QQ (see Definition C.23). The Hilbert space of KQ\mathsf{K}_Q is denoted KQ\mathcal{K}_Q, and it embeds naturally as a subspace of HQ\mathcal{H}_Q. Pauli operators on KQ\mathcal{K}_Q are indexed by the Pauli-label space VKQV_{\mathsf{K}_Q}, with binary XX and ZZ labels for each qubit (see Definition A.6).

For v∈VKQv \in V_{\mathcal K_Q}, denote by WKQ(v)W^{\mathcal K_Q}(v) the corresponding Pauli operator (see Definition A.12), acting on KQ\mathcal K_Q. Denote by WQ(v)W^Q(v) the corresponding leakage-extended Pauli operator, which acts as the Pauli labeled by vv on the computational subspace of HQ\mathcal H_Q and as the identity on the leakage subspaces (see Definition C.24). We denote by WN(v)=Ad⁡WN(v)\mathcal W^N(v) = \operatorname{Ad}_{W^N(v)} the map associated with conjugation by the Pauli WN(v)W^N(v). For a leakage-extended register QQ, the Pauli map WKQ(v):End⁡(KQ)→End⁡(KQ)W^{\mathcal K_Q}(v) : \operatorname{End}(\mathcal K_Q) \to\operatorname{End}(\mathcal K_Q) is a standard Pauli map on the computational subspace, while WQ(v):End⁡(HQ)→End⁡(HQ)W^Q(v) : \operatorname{End}(\mathcal H_Q) \to\operatorname{End}(\mathcal H_Q) is a leakage-extended Pauli map.

Consider a Clifford unitary CC on the computational subspace KQ\mathcal K_Q. Denote by C\mathcal C the associated superoperator, C(Y)=CYC†\mathcal C(Y) = CYC^\dagger for any operator Y∈End⁡(KQ)Y \in\operatorname{End}(\mathcal K_Q). Let ΦK:End⁡(KQ)→End⁡(KQ)\Phi_{\mathcal K} : \operatorname{End}(\mathcal K_Q) \to\operatorname{End}(\mathcal K_Q) be a superoperator, whose ideal (noise-free) realization is C\mathcal C. The map ΦK\Phi_{\mathcal K} can be twirled into a more convenient form via the Pauli twirl with respect to CC, denoted TCKQ\mathcal T_C^{\mathcal K_Q} (see Definition B.3).

Here we develop an analogous theory of Pauli twirling on leakage-extended qubit registers. Denote by Δ\Delta the leakage-pattern dephasing channel, which removes coherence between distinct leakage subspaces (see Definition C.15). Fix a superoperator Φ:End⁡(HQ)→End⁡(HQ)\Phi: \operatorname{End}(\mathcal H_Q) \to\operatorname{End}(\mathcal H_Q), a Clifford unitary CC defined on KQ\mathcal K_Q that is intended to be the nominal action of Φ\Phi in the computational subspace, and an associated symplectic automorphism FC:VKQ→VKQF_C : V_{\mathcal K_Q} \to V_{\mathcal K_Q} (see Definition B.1). We define the leakage-dephased Pauli twirl (see Definition C.26) of Φ\Phi according to

TCQ(Φ)=Δ∘[1∣VKQ∣∑v∈VKQWQ(FCv)∘Φ∘WQ(v)]∘Δ.(1)\mathcal T_C^Q(\Phi) = \Delta\circ\left[ \frac{1}{\lvert V_{\mathcal K_Q}\rvert} \sum_{v \in V_{\mathcal K_Q}} W^Q(F_Cv) \circ\Phi\circ W^Q(v) \right] \circ\Delta. \tag*{(1)}

Theorem 1 provides a convenient decomposition of Eq. (1). To state Theorem 1, we introduce the following maps for each leakage pattern R⊆QR \subseteq Q. The leakage-subspace projection map PR\mathcal P_R restricts an operator on HQ\mathcal H_Q to HQR\mathcal H_Q^R, and the leakage-subspace extension map ER\mathcal E_R embeds an operator on HQR\mathcal H_Q^R as an operator on HQ\mathcal H_Q (see Definitions C.48 and C.50). The filling map FR\mathcal F_R replaces the leaked systems with maximally mixed computational qubits (i.e., for i∈Ri \in R, system ii is placed in the state 1/2∈End⁡(Ci)1/2 \in\operatorname{End}(\mathcal C_i)), and the leakage map LR\mathcal L_R places the systems labeled i∈Ri \in R in their leakage states (see Definitions C.28 and C.30). For S,T⊆QS,T \subseteq Q, define the map DT,SΦ:End⁡(KQ)→End⁡(KQ)\mathcal D^\Phi_{T,S} : \operatorname{End}(\mathcal K_Q) \to\operatorname{End}(\mathcal K_Q) (see Definition C.67) via

DT,SΦ=TCKQ(FT∘PT∘Φ∘ES∘LS)∘C−1.(2)\mathcal D^\Phi_{T,S} = \mathcal T_C^{\mathcal K_Q} \left(\mathcal F_T \circ\mathcal P_T \circ\Phi\circ\mathcal E_S \circ\mathcal L_S\right) \circ\mathcal C^{-1}. \tag*{(2)}

Theorem 1 establishes that the leakage-dephased Pauli twirl can be written

TCQ(Φ)=∑S,T⊆QET∘LT∘DT,SΦ∘C∘FS∘PS.(3)\mathcal T_C^Q(\Phi) = \sum_{S,T \subseteq Q} \mathcal E_T \circ\mathcal L_T \circ\mathcal D^\Phi_{T,S} \circ\mathcal C \circ\mathcal F_S \circ\mathcal P_S. \tag*{(3)}

This expression admits the following interpretation. First, the sum decomposes the twirled map into branches indexed by the incoming and outgoing leakage patterns, SS and TT, respectively. For a given S→TS \to T branch, the projection map PS\mathcal P_S selects the incoming leakage subspace SS, and then FS\mathcal F_S replaces all leaked systems labeled i∈Si \in S with maximally mixed computational qubits. Then, the ideal Clifford CC acts on the computational subspace, followed by the Pauli map DT,SΦ\mathcal D^\Phi_{T,S}. Finally, LT\mathcal L_T produces the outgoing leakage pattern and ET\mathcal E_T embeds the result into HQ\mathcal H_Q.

When Φ\Phi is completely positive and trace preserving (CPTP), these Pauli maps DT,SΦ\mathcal D^\Phi_{T,S} are subnormalized, and the sum of their weights (see Definition A.47) over the outgoing leakage patterns TT is unity for each incoming pattern SS (see Proposition C.70). Thus, Eq. (3) describes the leakage-pattern transitions induced by the twirled channel TC(Φ)T_{\mathop{\mathrm{C}}}(\Phi) in terms of a classical Markov process, where the weight p(T∣S)=wt⁡(DT,SΦ)p(T|S) = \operatorname{wt}(D^\Phi_{T,S}) gives the probability of the transition S↦TS \mapsto T. For each nontrivial transition, the corresponding action on the computational subspace consists of the ideal Clifford CC followed by the Pauli channel obtained by normalizing DT,SΦD^\Phi_{T,S} (see Definition C.78).

Model of a QEC cycle

Here we introduce the mathematical model of a QEC cycle that is used in the remainder of this paper. Diagram 2.4 gives its circuit representation. This abstract formulation is not the usual way of presenting a QEC cycle, but it provides a convenient framework for our analysis while accommodating a very broad class of QEC-cycle constructions. The results in this paper apply to any QEC cycle that admits this abstract description.

Circuit representation of a QEC cycle

Figure 2.4.

Consider a fixed stabilizer code on nn physical qubits that encodes kk logical qubits. We model a QEC cycle for this code using the registers D, A, and O depicted in Diagram 2.4, which are all leakage-extended qubit registers (see Definition C.3). The data register D contains the physical qubits of the code and persists from one QEC cycle to the next. The ancilla register A contains auxiliary qubits used for fault-tolerant syndrome extraction and leakage detection, and is reset between QEC cycles. The outcome register O represents the classical outcomes produced by those processes, and is also reset between QEC cycles. Although the information contained in O is classical, we model O as a leakage-extended qubit register to model all errors associated with the QEC cycle, including leakage, as a channel on the joint D, A, and O system. The subsequent measurement of O is taken to be perfect. We denote by T the joint leakage-extended qubit register comprising D, A, and O (see Definition D.2).

References

  1. [1]A. Kwiatkowski, A. J. Friedman, S. Geller, J. A. Ziyad, S. Glancy, and E. Knill, Constructing an approximate logical Markovian model of consecutive QEC cycles of a stabilizer code (2025), arXiv:2509.16887.arxiv.org/abs/2509.16887
  2. [2]J. A. Ziyad, R. Blume-Kohout, and K. Rudinger, Emergent non-Markovianity in logical qubit dynamics (2025), arXiv:2512.08893.arxiv.org/abs/2512.08893
  3. [3]K. C. Miao, M. McEwen, J. Atalaya, et al., Overcoming leakage in quantum error correction, Nature Physics 19, 1780 (2023).DOI
  4. [4]Google Quantum AI and Collaborators, Quantum error correction below the surface code threshold, Nature 638, 920 (2025).
  5. [5]N. Lacroix, A. Bourassa, F. J. H. Heras, et al., Scaling and logic in the colour code on a superconducting quantum processor, Nature 645, 614 (2025).DOI
  6. [6]L. Caune, L. Skoric, N. S. Blunt, et al., Demonstrating real-time and low-latency quantum error correction with superconducting qubits, Nature Communications 17, 7383 (2026), arXiv:2410.05202.arxiv.org/abs/2410.05202
  7. [7]Atom Computing and Collaborators, Quantum error correction with the toric code (2026), arXiv:2606.04079.arxiv.org/abs/2606.04079
  8. [8]L. Postler, F. Butt, I. Pogorelov, C. D. Marciniak, S. Heußen, R. Blatt, P. Schindler, M. Rispler, M. Müller, and T. Monz, Demonstration of fault-tolerant steane quantum error correction, PRX Quantum 5, 030326 (2024), arXiv:2312.09745.DOI
  9. [9]A. Paetznick, B. W. Reichardt, M. P. da Silva, C. Ryan-Anderson, et al., Improved quantum processor logical error rates via correction and detection, Nature 654, 349 (2026), arXiv:2404.02280.
  10. [10]Y. Xin, S. L. M. van der Meer, M. Serra-Peralta, T. H. F. Vroomans, M. Finkel, H. M. Veen, M. W. Beekman, and L. DiCarlo, Improved error correction with leakage reduction units built into qubit measurement in a superconducting quantum processor, PRX Quantum 10.1103/v66v-988s (2026), arXiv:2511.17460.DOI
  11. [11]N. Berthusen, A. Lavasani, A. Benhemou, M. S. Allman, J. Dreiling, B. Estey, C. Foltz, T. Jacobs, M. Mills, A. J. Park, A. P. Reed, D. Hayes, T. S. Metodi, and A. C. Potter, Experimental validation of a compact fault-tolerant architecture for trapped ions (2026), arXiv:2609.03194.arxiv.org/abs/2609.03194
  12. [12]Google Quantum AI, Exponential suppression of bit or phase errors with cyclic error correction, Nature 595, 383 (2021).DOI
  13. [13]P. Iyer, A. Jain, S. D. Bartlett, and J. Emerson, Efficient diagnostics for quantum error correction, Physical Review Research 4, 043218 (2022), arXiv:2108.10830.DOI
  14. [14]Google Quantum AI, Suppressing quantum errors by scaling a surface code logical qubit, Nature 614, 676 (2023), arXiv:2207.06431.
  15. [15]R. Harper and S. T. Flammia, Learning correlated noise in a 39-qubit quantum processor, PRX Quantum 4, 040311 (2023), arXiv:2303.00780.DOI
  16. [16]N. Fazio, R. Freund, D. Sannamoth, A. Steiner, C. D. Marciniak, M. Rispler, R. Harper, T. Monz, J. Emerson, and S. D. Bartlett, Characterizing physical and logical errors in a transversal CNOT gate via cycle error reconstruction, Physical Review X 16, 011030 (2026), arXiv:2504.11980.
  17. [17]J. Combes, C. Granade, C. Ferrie, and S. T. Flammia, Logical randomized benchmarking (2017), arXiv:1702.03688.arxiv.org/abs/1702.03688
  18. [18]X. Xu, N. de Beaudrap, J. O’Gorman, and S. C. Benjamin, An integrity measure to benchmark quantum error correcting memories, New Journal of Physics 20, 023009 (2018), arXiv:1707.09951.DOI
  19. [19]A. K. Pal, P. Schindler, A. Erhard, Á. Rivas, M.-A. Martin-Delgado, R. Blatt, T. Monz, and M. Müller, Relaxation times do not capture logical qubit dynamics, Quantum 6, 632 (2022), arXiv:2012.07911.DOI
  20. [20]C. Gidney, Stability experiments: The overlooked dual of memory experiments, Quantum 6, 786 (2022), arXiv:2204.13834.DOI
  21. [21]T. Wagner, H. Kampermann, D. Bruß, and M. Kliesch, Learning logical Pauli noise in quantum error correction, Physical Review Letters 130, 200601 (2023), arXiv:2209.09267.DOI
  22. [22]P. Aliferis and B. M. Terhal, Fault-tolerant quantum computation for local leakage faults, Quantum Information and Computation 7, 139 (2007).
  23. [23]A. G. Fowler, Coping with qubit leakage in topological codes, Physical Review A 88, 042308 (2013), arXiv:1308.6642.DOI
  24. [24]J. Ghosh, A. G. Fowler, J. M. Martinis, and M. R. Geller, Understanding the effects of leakage in superconducting quantum-error-detection circuits, Physical Review A 88, 062329 (2013), arXiv:1306.0925.DOI
  25. [25]J. Ghosh and A. G. Fowler, Leakage-resilient approach to fault-tolerant quantum computing with superconducting elements, Physical Review A 91, 020302 (2015), arXiv:1406.2404.DOI
  26. [26]M. Suchara, A. W. Cross, and J. M. Gambetta, Leakage suppression in the toric code, Quantum Information and Computation 15, 997 (2015), arXiv:1410.8562.arxiv.org/abs/1410.8562
  27. [27]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), arXiv:2102.08336.DOI
  28. [28]M. McEwen, D. Kafri, Z. Chen, J. Atalaya, K. J. Satzinger, C. Quintana, P. V. Klimov, D. Sank, C. Gidney, A. G. Fowler, F. Arute, K. Arya, B. Buckley, B. Burkett, N. Bushnell, B. Chiaro, R. Collins, S. Demura, A. Dunsworth, C. Erickson, B. Foxen, M. Giustina, T. Huang, S. Hong, E. Jeffrey, S. Kim, K. Kechedzhi, F. Kostritsa, P. Laptev, A. Megrant, X. Mi, J. Mutus, O. Naaman, M. Neeley, C. Neill, M. Niu, A. Paler, N. Redd, P. Roushan, T. C. White, J. Yao, P. Yeh, A. Zalcman, Y. Chen, V. N. Smelyansky, J. M. Martinis, H. Neven, J. Kelly, A. N. Korotkov, A. G. Petukhov, and R. Barends, Removing leakage-induced correlated errors in superconducting quantum error correction, Nature Communications 12, 1761 (2021), arXiv:2102.06131.
  29. [29]C. C. Bultink, T. E. O’Brien, R. Vollmer, N. Muthusubramanian, M. W. Beekman, M. A. Rol, X. Fu, B. Tarasinski, V. Ostroukh, B. Varbanov, A. Bruno, and L. DiCarlo, Protecting quantum entanglement from leakage and qubit errors via repetitive parity measurements, Science Advances 6, eaay3050 (2020), arXiv:1905.12731.DOI
  30. [30]B. M. Varbanov, F. Battistel, B. M. Tarasinski, V. P. Ostroukh, T. E. O’Brien, L. DiCarlo, and B. M. Terhal, Leakage detection for a transmon-based surface code, npj Quantum Information 6, 102 (2020), arXiv:2002.07119.DOI
  31. [31]A. B. Ziad, A. Zalawadiya, C. Topal, J. Camps, G. P. Gehér, M. P. Stafford, and M. L. Turner, Local clustering decoder as a fast and adaptive hardware decoder for the surface code, Nature Communications 16, 11048 (2025), arXiv:2411.10343.DOI
  32. [32]J. Marshall and D. Kafri, Incoherent approximation of leakage in quantum error correction, Physical Review Applied 23, 054025 (2025), arXiv:2312.10277.DOI
  33. [33]H. Manabe, Y. Suzuki, and A. S. Darmawan, Efficient simulation of leakage errors in quantum error correcting codes using tensor network methods, New Journal of Physics 27, 114512 (2025), arXiv:2308.08186.arxiv.org/abs/2308.08186
  34. [34]R. Conchello Vendrell, C. Díaz López, I. Dhand, K. Kapoor, D. Laureti, M. Massaro, P. Nayak, I. Ogoblin, M. B. Plenio, S. Prasanna Kumar, M. Santandrea, V. Veshadri, A. Száva, T. Vincent, and R. Weber, Plaquette: A hardware-aware design platform for fault-tolerant quantum computers (2026), arXiv:2607.08767.arxiv.org/abs/2607.08767
  35. [35]W. Dür, M. Hein, J. I. Cirac, and H. J. Briegel, Standard forms of noisy quantum operations via depolarization, Physical Review A 72, 052326 (2005).DOI
  36. [36]M. R. Geller and Z. Zhou, Efficient error models for fault-tolerant architectures and the Pauli twirling approximation, Physical Review A 88, 012314 (2013), arXiv:1305.2021.DOI
  37. [37]Z. Cai and S. C. Benjamin, Constructing smaller Pauli twirling sets for arbitrary error channels, Scientific Reports 9, 11281 (2019), arXiv:1807.04973.DOI
  38. [38]J. J. Wallman and J. Emerson, Noise tailoring for scalable quantum computation via randomized compiling, Physical Review A 94, 052325 (2016), arXiv:1512.01098.DOI
  39. [39]A. Erhard, J. J. Wallman, L. Postler, M. Meth, R. Stricker, E. A. Martinez, P. Schindler, T. Monz, J. Emerson, and R. Blatt, Characterizing large-scale quantum computers via cycle benchmarking, Nature Communications 10, 5347 (2019), arXiv:1902.08543.DOI
  40. [40]S. T. Flammia, Averaged circuit eigenvalue sampling, in 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 232, edited by F. Le Gall and T. Morimae (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022) pp. 4:1–4:10, arXiv:2108.05803.DOI
  41. [41]J. M. Epstein, A. W. Cross, E. Magesan, and J. M. Gambetta, Investigating the limits of randomized benchmarking protocols, Physical Review A 89, 062321 (2014), arXiv:1308.2928.DOI
  42. [42]T. Chasseur and F. K. Wilhelm, Complete randomized benchmarking protocol accounting for leakage errors, Physical Review A 92, 042333 (2015), arXiv:1505.00580.DOI
  43. [43]J. J. Wallman, M. Barnhill, and J. Emerson, Robust characterization of leakage errors, New Journal of Physics 18, 043021 (2016), arXiv:1412.4126.
  44. [44]B. Wu, X. Wang, X. Yuan, C. Huang, and J. Chen, Leakage benchmarking for universal gate sets, Entropy 26, 71 (2024), arXiv:2304.07884.DOI
  45. [45]J. Helsen, X. Xue, L. M. K. Vandersypen, and S. Wehner, A new class of efficient randomized benchmarking protocols, npj Quantum Information 5, 71 (2019).arxiv.org/abs/1806.02048
  46. [46]C. Dankert, R. Cleve, J. Emerson, and E. Livine, Exact and approximate unitary 2-designs and their application to fidelity estimation, Physical Review A 80, 012304 (2009).DOI
  47. [47]E. Knill, Fault-tolerant postselected quantum computation: Threshold analysis, arXiv (2004).DOI
  48. [48]J. Dehaene and B. De Moor, Clifford group, stabilizer states, and linear and quadratic operations over GF(2), Physical Review A 68, 042318 (2003).DOI

Paper details

vlnc:W_s3zjeq6v
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents