Authors: Neereja Sundaresan Theodore J. Yoder Youngseok Kim Muyuan Li Edward H. Chen Grace Harper Ted Thorbeck Andrew W. Cross Antonio D. Córcoles Maika Takita Authors: Neereja Sundaresan Theodore J. Yoder Youngseok Kim Muyuan Li Edward H. Chen Grace Harper Ted Thorbeck Andrew W. Cross Antonio D. Córcoles Maika Takita Neereja Sundaresan Theodore J. Yoder Youngseok Kim Muyuan Li Edward H. Chen Grace Harper Ted Thorbeck Andrew W. Cross Antonio D. Córcoles Maika Takita Abstract Quantum error correction offers a promising path for performing high fidelity quantum computations. Although fully fault-tolerant executions of algorithms remain unrealized, recent improvements in control electronics and quantum hardware enable increasingly advanced demonstrations of the necessary operations for error correction. Here, we perform quantum error correction on superconducting qubits connected in a heavy-hexagon lattice. We encode a logical qubit with distance three and perform several rounds of fault-tolerant syndrome measurements that allow for the correction of any single fault in the circuitry. Using real-time feedback, we reset syndrome and flag qubits conditionally after each syndrome extraction cycle. We report decoder dependent logical error, with average logical error per syndrome measurement in Z(X)-basis of ~0.040 (~0.088) and ~0.037 (~0.087) for matching and maximum likelihood decoders, respectively, on leakage post-selected data. Introduction The outcomes of quantum computations can be faulty, in practice, due to noise in the hardware. To eliminate the resulting faults, quantum error correction (QEC) codes can be used to encode the quantum information into protected, logical degrees of freedom, and then by correcting the faults faster than they accumulate enable fault-tolerant (FT) computations. A complete execution of QEC will likely require: preparation of logical states; realization of a universal set of logical gates, which may require the preparation of magic states; repeated measurements of syndromes; and the decoding of the syndromes for correcting errors. If successful, the resulting logical error rates should be less than the underlying physical error rates, and decrease with increasing code distances down to negligible values. Choosing a QEC code requires consideration of the underlying hardware and its noise properties. For a heavy-hexagon lattice1,2 of qubits, subsystem QEC codes3 are attractive because they are well-suited for qubits with reduced connectivities. Other codes have shown promise due to their relatively high threshold for FT4 or large number of transversal logical gates5. Although their space and time overhead may pose a significant hurdle for scalability, there exist encouraging approaches to reduce the most expensive resources by exploiting some form of error mitigation6. 1 2 3 4 5 6 In the decoding process, successful correction depends not only on the performance of the quantum hardware, but also on the implementation of the control electronics used for acquiring and processing the classical information obtained from syndrome measurements. In our case, initializing both syndrome and flag qubits via real-time feedback between measurement cycles can help mitigate errors. At the decoding level, whereas some protocols exist to perform QEC asynchronously within a FT formalism7,8, the rate at which the error syndromes are received should be commensurate with their classical processing time to avoid an increasing backlog of syndrome data. Also, some protocols, like using a magic state for a logical T-gate9, require the application of real-time feed-forward. 7 8 T 9 Thus, the long term vision of QEC does not gravitate around a single ultimate goal but should be seen as a continuum of deeply interrelated tasks. The experimental path in the development of this technology will comprise the demonstration of these tasks in isolation first and their progressive combination later, always while continuously improving their associated metrics. Some of this progress is reflected in numerous recent advances on quantum systems across different physical platforms, which have demonstrated or approximated several aspects of the desiderata for FT quantum computing. In particular, FT logical state preparation has been demonstrated on ions10, nuclear spins in diamond11 and superconducting qubits12. Repeated cycles of syndrome extraction have been shown in superconducting qubits in small error detecting codes13,14, including partial error correction15 as well as a universal (albeit not FT) set of single-qubit gates16. A FT demonstration of a universal gate set on two logical qubits has recently been reported in ions17. In the realm of error correction, there have been recent realizations of the distance-3 surface code on superconducting qubits with decoding18 and post-selection19, as well as a FT implementation of a dynamically protected quantum memory using the color code20 and the FT state preparation, operation, and measurement, including its stabilizers, of a logical state in the Bacon-Shor code in ions20,21. 10 11 12 13 14 15 16 17 18 19 20 20 21 Here we combine the capability of real-time feedback on a superconducting qubit system with a maximum likelihood decoding protocol hitherto unexplored experimentally in order to improve the survivability of logical states. We demonstrate these tools as part of the FT operation of a subsystem code22, the heavy-hexagon code1, on a superconducting quantum processor. Essential to making our implementation of this code fault-tolerant are flag qubits that, when found to be non-zero, alert the decoder to circuit errors. By conditionally resetting flag and syndrome qubits after each syndrome measurement cycle, we protect our system against errors arising from the noise asymmetry inherent to energy relaxation. We further exploit recently described decoding strategies15 and extend the decoding ideas to include maximum likelihood concepts4,23,24. 22 1 15 4 23 24 Results The heavy-hexagon code and multi-round circuits The heavy-hexagon code we consider is an n = 9 qubit code encoding k = 1 logical qubit with distance d = 31. The Z and X gauge (see Fig. 1a) and stabilizer groups are generated by n k d 1 Z X 1 The stabilizer groups are the centers of the respective gauge groups . This means the stabilizers, as products of gauge operators, can be deduced from measurements of only the gauge operators. Logical operators can be chosen to be XL = X1X2X3 and ZL = Z1Z3Z7. XL X X X ZL Z Z Z a Z (blue) and X (red) gauge operators (eqs. (1) and (2)) mapped onto the 23 qubits required with the distance-3 heavy-hexagon code. Code qubits (Q1 − Q9) are shown in yellow, syndrome qubits (Q17, Q19, Q20, Q22) used for Z stabilizers in blue, and flag qubits and syndromes used in X stabilizers in white. The order and direction that CX gates are applied within each sub-section (0 to 4) are denoted by the numbered arrows. b Circuit diagram of one syndrome measurement round, including both X and Z stabilizers. The circuit diagram illustrates permitted parallelization of gate operations: those within the bounds set by scheduling barriers (vertical dashed gray lines). As each two-qubit gate duration differs, the final gate scheduling is determined with a standard as-late-as-possible circuit transpilation pass; after which dynamical decoupling is added to data qubits where time permits. Measurement and reset operations are isolated from other gate operations by barriers to allow for uniform dynamical decoupling to be added to idling data qubits. Decoding graphs for three rounds of (c) Z and (d) X stabilizer measurements with circuit-level noise allow correction of X and Z errors, respectively. The blue and red nodes in the graphs correspond to difference syndromes, while the black nodes are the boundary. Edges encode various ways errors can occur in the circuit as described in the text. Nodes are labeled by the type of stabilizer measurement (Z or X), along with a subscripts indexing the stabilizer, and superscripts denoting the round. e Black edges, arising from Pauli Y errors on code qubits (and so are just size-2), connect the two graphs in c and d, but are not used in the matching decoder. f The size-4 hyperedges, which are not used by matching, but are used in the maximum likelihood decoder. Colors are just for clarity. Translating each in time by one round also gives a valid hyperedge (with some variation at the time boundaries). Also not shown are any of the size-3 hyperedges. a Z X 1 2 Q Q Q Q Q Q Z X b X Z c Z d X X Z Z X e Y c d f Here we focus on a particular FT circuit, many of our techniques can be used more generally with different codes and circuits. Two sub-circuits, shown in Fig. 1b, are constructed to measure the X- and Z-gauge operators. The Z-gauge measurement circuit also acquires useful information by measuring flag qubits. 1 X Z Z We prepare code states in the logical () state by first preparing nine qubits in the () state and measuring the X-gauge (Z-gauge). We then perform r rounds of syndrome measurement, where a round consists of a Z-gauge measurement followed by an X-gauge measurement (respectively, X-gauge followed by Z-gauge). Finally, we read out all nine code qubits in the Z (X) basis. We perform the same experiments for initial logical states and as well, by simply initializing the nine qubits in and instead. X Z r Z X X Z Z X Decoding algorithms In the setting of FT quantum computing, a decoder is an algorithm that takes as input syndrome measurements from an error correcting code and outputs a correction to the qubits or measurement data. In this section we describe two decoding algorithms: perfect matching decoding and maximum likelihood decoding. The decoding hypergraph15 is a concise description of the information gathered by a FT circuit and made available to a decoding algorithm. It consists of a set of vertices, or error-sensitive events, V, and a set of hyperedges E, which encode the correlations between events caused by errors in the circuit. Figure 1c–f depicts parts of the decoding hypergraph for our experiment. 15 V E 1 Constructing a decoding hypergraph for stabilizer circuits with Pauli noise can be done using standard Gottesman-Knill simulations25 or similar Pauli tracing techniques26. First, an error-sensitive event is created for each measurement that is deterministic in the error-free circuit. A deterministic measurement M is any measurement whose outcome m ∈ {0, 1} can be predicted by adding modulo two the measurement outcomes from a set of earlier measurements. That is, for an error-free circuit, , where the set can be found by simulation of the circuit. Set the value of the error-sensitive event to m − FM(mod2), which is zero (also called trivial) in the absence of errors. Thus, observing a non-zero (also called non-trivial) error-sensitive event implies the circuit suffered at least one error. In our circuits, error-sensitive events are either flag qubit measurements or the difference of subsequent measurements of the same stabilizer (also sometimes called difference syndromes). 25 26 M m m FM Next, hyperedges are added by considering circuit faults. Our model contains a fault probability pC for each of several circuit components pC Here we distinguish the identity operation id on qubits during a time when other qubits are undergoing unitary gates, from the identity operation idm on qubits when others are undergoing measurement and reset. We reset qubits after they are measured, while we initialize qubits that have not been used in the experiment yet. Finally cx is the controlled-not gate, h is the Hadamard gate, and x, y, z are Pauli gates. (see Methods “IBM_Peekskill and experimental details” for more detail). Numerical values for pC are listed in Methods “IBM_Peekskill and experimental details”. pC Our error model is circuit depolarizing noise. For initialization and reset errors, a Pauli X is applied with the respective probabilities pinit and preset after the ideal state preparation. For measurement errors, Pauli X is applied with probability before the ideal measurement. A one-qubit unitary gate (two-qubit gate) C suffers with probability pC one of the three (fifteen) non-identity one-qubit (two-qubit) Pauli errors following the ideal gate. There is an equal chance of any of the three (fifteen) Pauli errors occurring. X p p X C pC When a single fault occurs in the circuit, it causes some subset of error-sensitive events to be non-trivial. This set of error-sensitive events becomes a hyperedge. The set of all hyperedges is E. Two different faults may lead to the same hyperedge, so each hyperedge may be viewed as representing a set of faults, each of which individually causes the events in the hyperedge to be non-trivial. Associated with each hyperedge is a probability, which, at first order, is the sum of the probabilities of faults in the set. E A fault may also lead to an error which, propagated to the end of the circuit, anti-commutes with one or more of the code’s logical operators, necessitating a logical correction. We assume for generality that the code has k logical qubits and a basis of 2k logical operators, but note k = 1 for the heavy-hexagon code used in the experiment. We can keep track of which logical operators anti-commute with the error using a vector from . Thus, each hyperedge h is also labeled by one of these vectors , called a logical label. Note that if the code has distance at least three, each hyperedge has a unique logical label. k k k h Lastly, we note that a decoding algorithm can choose to simplify the decoding hypergraph in various ways. One way that we always employ here is the process of deflagging. Flag measurements from qubits 16, 18, 21, 23 are simply ignored with no corrections applied. If flag 11 is non-trivial and 12 trivial, apply Z to 2. If 12 is non-trivial and 11 trivial, apply Z to qubit 6. If flag 13 is non-trivial and 14 trivial, apply Z to qubit 4. If 14 is non-trivial and 13 trivial, apply Z to qubit 8. See ref. 15 for details on why this is sufficient for fault-tolerance. This means that instead of including error-sensitive events from the flag qubit measurements directly, we preprocess the data by using the flag information to apply virtual Pauli Z corrections and adjust subsequent error-sensitive events accordingly. Hyperedges for the deflagged hypergraph can be found through stabilizer simulation incorporating the Z corrections. Let r indicate the number of rounds. After deflagging, the size of the set V for Z (resp. X basis) experiments are ∣V∣ = 6r + 2 (resp. 6r + 4), due to measuring six stabilizers per round and having two (resp. four) initial error-sensitive stabilizers after state preparation. The size of E is similarly ∣E∣ = 60r − 13 (resp. 60r − 1) for r > 0. Z Z Z Z 15 Z Z r V Z X V r r E E r r r Considering X and Z errors separately, the problem of finding a minimum weight error correction for the surface code can be reduced to finding a minimum weight perfect matching in a graph4. Matching decoders continue to be studied because of their practicality27 and broad applicability28,29. In this section, we describe the matching decoder for our distance-3 heavy-hexagon code. X Z 4 27 28 29 The decoding graphs, one for the X-errors (Fig. 1c) and one for the Z-errors (Fig. 1d), for minimum weight perfect matching are in fact subgraphs of the decoding hypergraph in the previous section. Let us focus here on the graph for correcting X-errors, since the Z-error graph is analogous. In this case, from the decoding hypergraph we keep nodes VZ corresponding to (the difference of subsequent) Z-stabilizer measurements and edges (i.e. hyperedges with size two) between them. Additionally, a boundary vertex b is created, and size-one hyperedges of the form {v} with v ∈ VZ, are represented by including edges {v, b}. All edges in the X-error graph inherit probabilities and logical labels from their corresponding hyperedges (see Table 1 for X and Z-error edge data for 2-round experiment). X 1 Z 1 X Z VZ Z b v v VZ v b X 1 X Z A perfect matching algorithm takes a graph with weighted edges and an even-sized set of highlighted nodes, and returns a set of edges in the graph that connects all highlighted nodes in pairs and has minimum total weight among all such edge sets. In our case, highlighted nodes are the non-trivial error-sensitive events (if there are an odd number, the boundary node is also highlighted), and edge weights are either chosen to all be one (uniform method) or set as , where pe is the edge probability (analytic method). The latter choice means that the total weight of an edge set is equal to the log-likelihood of that set, and minimum weight perfect matching tries to maximize this likelihood over the edges in the graph. pe Given a minimum weight perfect matching, one can use the logical labels of the edges in the matching to decide on a correction to the logical state. Alternatively, the X-error (Z-error) graph for the matching decoder is such that each edge can be associated to a code qubit (or a meausurement error), such that including an edge in the matching implies an X (Z) correction should be applied to the corresponding qubit. X Z X Z Maximum likelihood decoding (MLD) is an optimal, albeit non-scalable, method for decoding quantum error-correcting codes. In its original conception, MLD was applied to phenomenological noise models where errors occur only just before syndromes are measured24,30. This of course ignores the more realistic case where errors can propagate through the syndrome measurement circuitry. More recently, MLD has been extended to include circuit noise23,31. Here, we describe how MLD corrects circuit noise using the decoding hypergraph. 24 30 23 31 MLD deduces the most likely logical correction given an observation of the error-sensitive events. This is done by calculating the probability distribution Pr[β, γ], where represents error-sensitive events and represents a logical correction. β γ We can calculate Pr[β, γ] by including every hyperedge from the decoding hypergraph, Fig. 1c–f, starting from the zero-error distribution, i.e. Pr[0∣V∣, 02k] = 1. If hyperedge h has probability ph of occurring, independent of any other hyperedge, we include h by performing the update β γ 1 V k h ph h where is just a binary vector representation of the hyperedge. This update should be applied once for every hyperedge in E. E Once Pr[β, γ] is calculated, we can use it to deduce the best logical correction. If is observed in a run of the experiment, β γ indicates how measurements of the logical operators should be corrected. For more details on specific implementations of MLD, refer to Methods “Maximum likelihood implementations”. Experimental realization For this demonstration we use ibm_peekskill v2.0. 0, a 27 qubit IBM Quantum Falcon processor32 whose coupling map enables a distance-3 heavy-hexagon code, see Fig. 1. The total time for qubit measurement and subsequent real-time conditional reset, for each round, takes 768ns and is the same for all qubits. All syndrome measurements and resets occur simultaneously for improved performance. A simple Xπ-Xπ dynamical decoupling sequence is added to all code qubits during their respective idling periods. 32 1 Xπ Xπ Qubit leakage is a significant reason why the Pauli depolarizing error-model assumed by the decoder design might be inaccurate. In some cases, we can detect whether a qubit has leaked out of the computation subspace at the time it is measured (see Methods “Post-selection method” for more information on the post-selection method and limitations). Using this, we can post-select on runs of the experiment when leakage has not been detected, similar to ref. 18. 18 In Fig. 2a, we initialize the logical state (), and apply r syndrome measurement rounds, where one round includes both X and Z stabilizers (total time of approximately 5.3μs per round, Fig. 1b). Using analytical perfect matching decoding on the full data set (500,000 shots per run), we extract the logical errors in Fig. 2a, red (blue) triangles. Details of optimized parameters used in analytical perfect matching decoding can be found in Methods “IBM_Peekskill and experimental details”. Fitting the full decay curves (eq. (14)) up to 10 rounds, we extract logical error per round without post-selection in Fig. 2b of 0.059(2) (0.058(3)) for () and 0.113(5) (0.107(4)) for (). 2 r X Z μ 1 2 14 2 a Logical error versus number of syndrome measurement rounds r, where one round includes both a Z and an X stabilizer measurement. Blue right-pointing triangles (red triangles) mark logical errors obtained from using matching analytical decoding on raw experimental data for () states. Light blue squares (light red circles) mark those for () with the same decoding method but using leakage-post-selected experimental data. Error bars denote sampling error of each run (500,000 shots for raw data, variable number of shots for post-selected). Dashed line fits of error yield error per round plotted in b. b Applying the same decoding method on leakage-post-selected data, shows substantial reduction in overall error for all four logical states. See Methods “Post-selection method” for details on post-selection. Fitted rejection rate per round for , , , are 4.91%, 4.64%, 4.37%, and 4.89%, respectively. Error bars denote one standard deviation on the fitted rate. c, d Using post-selected data, we compare logical error obtained with the four decoders: matching uniform (pink circles), matching analytical (green circles), matching analytical with soft information (gray circles), and maximum likelihood (blue circles). (See Fig. 6 for and ). Dashed fitted rates presented in e, f. Error bars denote sampling error. e, f Comparison of fitted error per round for all four logical states using matching uniform (pink), matching analytical (green), matching analytical with soft information (gray), and maximum likelihood (blue) decoders on leakage-post-selected data. Error bars represent one standard deviation on the fitted rate. a r Z X b b c d 6 e f e f Applying the same decoding method on leakage-post-selected data reduces logical errors in Fig. 2a, and leads to fitted error rates of 0.041(1) (0.044(4)) for () and 0.088(3) (0.085(3)) for () as shown in Fig. 2b. Rejection rates per round from post-selection for , , , and are 4.91%, 4.64%, 4.37%, and 4.89%, respectively. See Methods “Post-selection method” for details. 2 2 In Fig. 2c–f, we compare the logical error for each round and extracted logical error per round obtained from the post-selected data sets using the three decoders described previously in Section “Decoding algorithms”. We also include a version of the analytical decoder that exploits soft-information33, which is described in Methods “Soft-information decoding”. We observe (see Fig. 2e, f) a consistent improvement in decoding moving from matching uniform (pink), to matching analytical (green), to matching analytical with soft information, to maximum likelihood (grey), though this is much less significant for the X-basis logical states. A quantitative comparison between the three decoders for all four logical states at r = 2 rounds is provided in Methods “Logical error at r = 2 rounds”. 2 33 2 X r r There are at least three reasons the X-basis states perform worse than the Z-basis. The first is the natural asymmetry in the circuits. The larger depth required for measuring Z stabilizers leads to more time where Z errors on data qubits can accumulate undetected. This is supported by simulations, like those in1, which uses a different decoder, and here in Methods “Simulation details”, which see worse performance of the X-basis for this d = 3 code. Second, choices made in decoding, particularly the deflagging step, can exacerbate the asymmetry by essentially converting measurement and reset errors into Z errors on the data qubits. This leads to a high effective Z-error rate that cannot be improved much, even by maximum likelihood decoding. In contrast, if we deflag only the first round of measurements, the logical error of the maximum likelihood decoder on the r = 2 round, experiment decreases by around 2.8% to 18.02(7)%. Flagged decoding like this becomes time-consuming for larger round counts as adding flag nodes to the decoding hypergraph greatly increases its size. Finally, decoders are only as good as our model of the experimental noise. Non-depolarizing noise sources such as spectator ZZ errors, which we know are present, are not modeled by any of our decoders and will more adversely affect X-basis states. More accurate estimation and inclusion of such experimental noise and its implications for fault-tolerance is an important subject for further research. X Z Z Z 1 X d Z Z r ZZ X Discussion The results presented in this work highlight the importance of the joint progress of quantum hardware, both in size and quality, and classical information processing, both concurrent with circuit execution and asynchronous to it, as described with the studied decoders. Our experiments incorporate mid-circuit measurements and conditional operations as part of a QEC protocol. These technical capabilities serve as foundational elements for further enhancement of the role of dynamic circuits in QEC, for example towards real-time correction and other feed-forward operations that will be critical for large-scale FT computations. We also show how experimental platforms for QEC of this size and capabilities can trigger new ideas towards more robust decoders. Our comparison between a perfect matching and a maximum likelihood decoder sets a promising starting point towards the understanding of the trade-off between decoder scalability versus performance in the presence of experimental noise. Better noise modeling and the techniques of pre-decoding errors34, 35 might improve the performance and run-time of these decoders. 34 35 All these key components will play a crucial role in larger distance codes, where the quality of the real-time operations (qubit conditional reset and leakage removal, teleportation protocols for logical gates, and decoding), along with device noise levels, will determine the performance of the code, potentially enabling the demonstration of logical error suppression with increased code distance. Methods Minimum weight perfect matching edge probabilities and implementation We use the Gottesman-Knill theorem25 to propagate Pauli errors through our Clifford circuits and determine what error-sensitive events are made non-trivial. An example is shown in Fig. 3. If p is the probability of specific Pauli error and e is the corresponding set of non-trivial events, p is added to the edge probability pe. 25 3 p e p pe Two examples of Pauli propagation through the flagged measurement circuit for a Z-gauge operator. Pauli Z corrections due to deflagging are shown in dotted boxes and depend on the flag qubit measurement results. In the lower half of the figure in blue, a cx gate is followed by a XY error (blue) with probability pcx/15. The subsequent cx gate propagates the X error to the syndrome qubit Q19, flipping the measurement m, and meanwhile the Y error on Q2 propagates without change (it will have an effect on future measurement rounds). The propagated errors are in dotted circles. Note the flag measurement b is not flipped, as the Hadamard gate takes the X error to a harmless Z error. In the top half of the figure, a Pauli Z error occurs on a flag qubit (red) with probability pcx/15, and propagates to a Z error on Q6 and an X error before the measurement a (dashed circles). Deflagging applies Z to Q6, canceling the error there, so that the final propagated error is just the flip of measurement a. Z Z XY p X Q m Y Q b X Z Z p Z Q X a Z Q a Note that for experiments on states and , we need only correct X errors and so just use the Z stabilizers, Fig. 1c. For experiments on and , we need only correct Z errors with the graph in Fig. 1d. Edge probabilities are given for the and 2-round experiments in Table 1. We present just the edge weights for r = 2 rounds of syndrome extraction because this captures the behavior at time boundaries t = 1 and t = r + 1, as well as the behavior for 1 < t < r + 1. This latter bulk behavior is repeated over time for cases r > 2. X Z 1 Z 1 1 r t t r t r r To implement matching, we use PyMatching28 to perform the matching and decode. After the decoding graph is set up, decoding an entire leakage-postselected data set (i.e. typically somewhere between 100,000 and 200,000 unique bit strings) takes about 10 seconds, largely independent of r > 1. 28 r Maximum likelihood implementations There are at least two different ways to implement maximum likelihood decoding (MLD), which we call the offline and online implementations of the decoder. Though they give the same results, the implementations can differ significantly in run-time depending on the specific application. In the offline case, one calculates and stores the entire distribution Pr[β, γ] and queries it to determine the correction for each run of the circuit. The calculation takes O(∣E∣2∣V∣+2k) time, since we must perform updates from Eq. (6) to the distribution for each hyperedge in E. Determining a correction using Eq. (7) takes O(22k) time per run. β γ O E V k 6 E 7 O k Alternatively, one can forgo calculating the whole distribution, and instead calculate sparse distributions specific to each observation string β* in a data set. Online MLD achieves this by pruning the distribution as updates are performed, keeping only entries consistent with β*. We imagine receiving one bit of β* at a time. For the jth bit, updates are made using Eq. (6) for all hyperedges that contain bit j and have not already been included. In fact, all these updates for a given bit can be combined into a pre-calculated transition matrix. Since no further updates will be made to bit j, we can now truncate the distribution by keeping only entries Pr[β, γ] where . β β β j 6 j j β γ We can run through a quick example of this procedure for the 0-round, experiment. Here there are just ∣V∣ = 2 error-sensitive events and ∣E∣ = 3 hyperedges. Organizing the hyperedge parameters like (βh, γh): ph, we write V E βh γh ph where we have left out the ZL bit of γh since ZL corrections are not relevant to experiments. This corresponds to just one round of the graph in Fig. 1c, and the expressions for p1, p2, p3 are the last three rows of Table 1. We will use to mean 1 − p below. ZL γh ZL 1 p p p 1 p Suppose we want to decode the observation β* = 01. We start with probability distribution P0 = {(00, 0): 1}. This notation means Pr[β = 00, γ = 0] = 1. All other values of β and γ have probability zero and are not written. Perform updates according to hyperedges (10, 1) and (11, 0) to obtain β P β γ β γ Now we can truncate the distribution because we are done with all updates involving the first event. Since the first bit of β* is 0, this leaves us with β Now updates proceed for any other hyperedges involving the second event, just (01, 0) in this case. which similarly is truncated to To determine whether β* requires a logical correction or not, compare with . As perror is second order in experimental error rates and pnoerror is first order, we deduce that it is more likely that no logical error has occurred and apply no correction. β p p Suppose the number of nonzero entries in the probability distribution after truncating after the jth bit is Sj. During the course of online MLD, there is some maximum instantaneous size of the probability distribution, say . The total time to determine a correction is per run, assuming a constant number of hyperedge updates per bit. Note that depends on the decoding hypergraph and also the order in which error-sensitive events are incorporated. It can be argued that for [[n, k]] codes, repeated rounds of syndrome measurements, and events incorporated chronologically, . The lower bound holds because after completing update and truncation for a complete round, any of the entire next round of n − k stabilizer bits may be flipped due to syndrome measurement errors. The upper bound follows from hyperedges being bounded to contain events from at most two consecutive rounds. j Sj n k n k The online decoder is also amenable to dynamic programming, storing partially calculated probability distributions up to some moderately-sized j. This saves time by avoiding repeating the same calculations when observations with same prefixes are decoded. For instance, in the example above, we could store P1 since both observations β* = 00 and 01 would end up calculating it. In our analysis of three-round experiments, we store distributions up to j = 15, while for four rounds we keep up to j = 21, in what is largely an attempt to balance time and memory consumption. j P β j j Since online MLD takes exponential (in n, the number of physical qubits in the code) time per run, if ∣V∣ is small enough, offline MLD is preferable. If ∣V∣ is large but n and k are small (perhaps a small code experiment performing many rounds of syndrome measurements), the online decoder becomes the only feasible option. n V V n k In the experiments here, online MLD becomes preferable over offline MLD for three rounds and greater. For r = 2, either offline or online MLD can decode a complete data set in around 90 seconds for logical Z-eigenstates (about 13,000 unique bit strings) and around 12 minutes for logical X-eigenstates (about 21,000 unique bit strings). However for r = 10, online MLD can take up to 3 weeks for a complete data set (around 130,000 unique bit strings). r Z X r All r ≥ 3 online MLD computations were run on a shared x86_64 Linux server. Using specialized hardware, like FPGAs is not an avenue we explored. However, given the factor in the time complexity, we do not expect online MLD to be feasible for use in larger quantum devices. r Simulation details We obtain theoretical simulation results using stabilizer simulations of the Qiskit software stack36. In order to estimate the performance of quantum error correction circuits on IBM Quantum Falcon systems, we performed simulations of the quantum circuits with qubits mapped onto the Falcon devices using customized error models to reflect the noise behavior of experimental hardware. 36 Circuit errors in our simulation are modeled as depolarizing errors, so that the effect for different error sources of varying strength can be captured. Noise models were built following error locations and error channels described in Section “Decoding algorithms” using a depolarizing error model for each single and two qubit operation in the quantum circuit with error rates obtained from simultaneous randomized benchmarking (RB) a bit-flip error model for error in measurement, initialize, and reset operations a depolarizing noise model for idling error a depolarizing error model for each single and two qubit operation in the quantum circuit with error rates obtained from simultaneous randomized benchmarking (RB) a bit-flip error model for error in measurement, initialize, and reset operations a depolarizing noise model for idling error Using the above described error model, we define a realistic depolarizing error model where simulations are carried out with noise parameters directly exported from the IBM Quantum processor used for this work, ibm_peekskill (Tables 2 and 3), including 2 3) specific error rates for each single and two-qubit quantum operation with depolarizing quantum channel parameter obtained from simultaneous RB according to the relation where ϵgate, n, αgate represents error per gate, number of qubits in gate, and depolarizing quantum channel parameter, initialization, measurement, and reset error obtained as described in Table 2, idling errors with noise strength proportional to coherence limit of the gate, where coherence limit is computed using T1, T2 and idle time of each qubit during the execution of each quantum operation in the circuit. And each gate length matches that of the actual device (the circuit schedule matches that of experiment). specific error rates for each single and two-qubit quantum operation with depolarizing quantum channel parameter obtained from simultaneous RB according to the relation where ϵgate, n, αgate represents error per gate, number of qubits in gate, and depolarizing quantum channel parameter, specific error rates for each single and two-qubit quantum operation with depolarizing quantum channel parameter obtained from simultaneous RB according to the relation where ϵgate, n, αgate represents error per gate, number of qubits in gate, and depolarizing quantum channel parameter, ϵ n α initialization, measurement, and reset error obtained as described in Table 2, initialization, measurement, and reset error obtained as described in Table 2, 2 idling errors with noise strength proportional to coherence limit of the gate, where coherence limit is computed using T1, T2 and idle time of each qubit during the execution of each quantum operation in the circuit. And each gate length matches that of the actual device (the circuit schedule matches that of experiment). idling errors with noise strength proportional to coherence limit of the gate, where coherence limit is computed using T1, T2 and idle time of each qubit during the execution of each quantum operation in the circuit. And each gate length matches that of the actual device (the circuit schedule matches that of experiment). T T Furthermore, to demonstrate average performance of the circuit in a relatively uniform depolarizing error model, we define an average depolarizing error model where instead of the specific error rates for different gates and qubits stated above we use average error rates throughout the entire device to define the depolarizing error channels. Using the analytical perfect matching decoder parameters pC = [0.0126, 0.000266, 0.0, 0.001, 0.002, 0.000266, 0.000266, 0.0, 0.00713, 0.0142, 0.0290] ordered by error locations defined in Section “Decoding algorithms”, we obtained simulated per round logical error rates for circuits with up to 10 syndrome measurement rounds as 0.059 (0.038) for logical state and 0.152 (0.106) for logical state under the influence of realistic (average) depolarizing error model, respectively. Comparing to logical error per round on leakage post-selected data (with analytical matching decoding) as shown in Fig. 2a, of 0.0409 for and 0.0882 for , logical error per rounds using the average depolarizing error model match the data better than the realistic model. However the average model still over estimates state, showing that this simpler model does not fully capture the errors in the system. We believe the realistic model overestimates both Z and X-basis errors in part because the error benchmarks (see Tables 2 and 3) supplied to the model were themselves not leakage-aware and so the error benchmarks were likely inflated by leakage errors. We do see that the realistic model similarly does a better job predicting than . This is an area of open work, for simulation and perhaps also decoding, to better capture the experimental data beyond leakage. pC 2 2 3 IBM_Peekskill and experimental details Data in this section uses the qubit numbering (QFN contrasting with QN in Fig. 1) notation presented in Fig. 4a, matching standard IBM Quantum Falcon systems. Summarized in Table 2 are single qubit benchmarks for ibm_peekskill, where single qubit gates for all qubits (excluding virtual Z gates) are identically 35.55ns. While the Falcon layout has 27 qubits, for the d=3 circuits presented in this paper we only needed to use 23 of those qubits as shown in Fig. 4a, excluding qubits QF0, QF6, QF20, and QF26. QFN QN 1) 4 2 4 QF QF QF QF a Translation of Fig. 1a qubit numbering (QN) to standard IBM-Falcon numbering(QFN). b Static ZZ between all connected qubits pairs versus detuning between qubits. Median qubit anharmonicity, see Table 2 for breakdown, is -345 MHz. a 1 QN QFN b 2 Full size image Full size image The always-on coupling between connected qubits on ibm_peekskill also results in undesirable static ZZ, plotted in Fig. 4b, as a function of qubit-qubit detuning. To mitigate some of these effects, a simple Xπ-Xπ dynamical decoupling sequence is added to code qubits throughout the circuit. Furthermore, by introducing mixed dimensionality simultaneous RB37, we can further capture the undesired side-effects of this coupling by comparing one and two-qubit gate error taken with standard RB with spectator qubits/gates fully idling or with those simultaneously driven as set by scheduling requirements of the Z and X checks. Simultaneous gate error for gates and qubits not part of these measurements (always idling during the experiments presented in the main text) are thus not included in this extra characterization (in table as NaN). These results are presented in Tables 2 and 3. Optimization of two-qubit gates was undertaken on ibm_peekskill to ensure that no significant degradation in gate error or increase in leakage out of the computational manifold occurred in simultaneous benchmarking. 4 Xπ Xπ 37 Z X 2 3 Using the same methodology presented in ref. 15, reset operations conditioned on the preceding measurement result are used for mid-circuit reset operations shown Fig. 1b. The total time of the measurement + reset cycle is 768ns, and includes an approximately 400ns measurement pulse, cavity ring-down time overlapping with classical control path delays, and application of the conditional Xπ. For consistency, all qubits are calibrated to use the same duration pulse and delays, with pulse amplitude calibrated individually to optimize QND-ness of readout. 15 1 Xπ To optimize the performance of the analytical perfect matching decoding on experimental data, an optimization algorithm was run on experimental data of one round stabilizer measurement of distance-3 heavy hexagon code on the same hardware to find a set of input error parameters that minimizes the decoder output logical error rates. Here we chose to use the L-BFGS-B algorithm38 due to efficiency of optimization and ability to work with simple linear constraints. This optimization was done by starting with the physical noise parameters found through device calibration, iteratively updating the parameters while minimizing the overall logical error. It aims to compensate for decoder’s lack of knowledge of realistic noise processes, and outputs a set of decoding parameters that produces improved decoder performance. The optimization resulted in the following set of input error parameters for the analytical perfect matching decoding algorithm pC = [0.01, 0.00028, 0.0, 0.001, 0.002, 0.00028, 0.00028, 0.0, 0.0005, 0.0, 0.00001] following the error locations as defined in Section “Decoding algorithms”. 38 pC We use the following equation to fit logical errors at syndrome measurement round, r, r where A is SPAM error, , and ϵ is the logical error rate per syndrome measurement round (Fig. 2b, e, f). A ϵ 2 Leakage in the system Leakage errors outside the computational space comprising the states (g-state) and (e-state) into (f-state) or higher states cannot be corrected by our quantum error correction code and thus pose a serious threat to fault-tolerant computing. For fixed-frequency superconducting qubits, a certain set of qubit frequency assignments may lead to frequency collisions during the cross-resonant gate operation2. For example, when the target qubit frequency is close to the e → f transition frequency of the control qubit, leakage error is induced during the two qubit gate operation. Another example is a simultaneous operation of a two-qubit gate with a spectator single-qubit gate where the spectator qubit frequency together with target qubit frequency match the e → f transition of the control qubit. This can result in leakage errors which can be characterized by randomized benchmarking of the corresponding single- and two-qubit gates39. g e f 2 e f e f 39 Leakage errors can also occur during measurements40. As we speed up the measurement time by increasing the measurement power, qubits become more prone to leakage. We characterize this measurement-induced leakage by repeatedly measuring the qubit and extracting the leakage rate. The experiment is described in Fig. 5a, where the sequence consists of Xπ/2 followed by a measurement tone. The Xπ/2 pulse will map either or to the equator of the Bloch sphere, so the sequence randomly samples either or during the subsequent measurement. The obtained measurement leakage rate thus obtained is an average of the leakage rates from and states. The outcomes obtained from the sequence in Fig. 5a are classified according to calibration data obtained by preparing the , , and states, using the closest distribution mean for each outcome, and then applying readout error mitigation by constraining the formalism described in ref. 41 for multi-qubit readout to our single-qubit three-state subspace. This single-qubit readout error mitigation is applied to the ensemble of measurements obtained for each iteration of the pulse sequence. The measurement sequence is repeated for m = 70 times and we average over the 10,000 shots for each m to compute the averaged probability that the qubit is binned in the state. Figure 5b shows the measurement leakage probability, , where the qubit leaks to the state per measurement. (See Table 2 for further details). Eventually a steady state population in the state, determined by the measurement leakage and seepage rates, is reached. We extract the leakage and seepage rates using the equation 40 5 Xπ Xπ 5 41 m m 5 2 where the leakage rate ΓL is the probability of the qubit leaking during a measurement, the seepage rate ΓS is the probability of a leaked state returning to the qubit subspace during a measurement. Here, ΓL,S measures rate per measurement, therefore it is a unitless quantity. The obtained average and median value of ΓL are 6.54 × 10−3 and 4.86 × 10−3 per measurement, respectively. L S L S L a Repeated measurement sequence for extracting leakage error during the measurement. The Xπ/2 pulse allows us to randomly sample leakage events from or states. b The leakage probability () to the state measured at QF14. The leakage and seepage rate is obtained by fitting the data with Eq. (15). c, d Qubit leakage in the system as a function of syndrome measurement rounds for Z − and X − basis logical states. Bar plots show the as computed from the gate and measurement leakage rates, obtained from randomized benchmarking (2Q gates) and from the sequence shown in a, respectively. Experimental results, , where paccept is the acceptance probability calculated from the method outlined in Methods “Post-selection method”, are shown as black symbols for comparison. The experimental results plotted here do not include initialization leakage. e Readout calibration data for QF12 (see Fig. 4a). The qubit is prepared in its , , and states and measured. The collected statistics can be seen in as blue (), red (), and grey () where the dot-dashed lines represent 3-σ for each distribution. f 3-state classification results for QF12 after qubit initialization, and g after the first X − syndrome measurement. a Xπ b QF 15 c d Z X a p e QF 4 σ f QF g X We extract the two-qubit gate leakage and seepage rate of the state from simultaneous randomized benchmarking, with the simultaneity chosen to match the Z − and X − stabilizer sequences as illustrated in Fig. 1. Similarly, we extract the leakage/seepage rate from repeated measurement described in Fig. 5a. In these estimations, we account for the number of gate operations and measurements for each syndrome/flag qubits as well as the code qubits measured at the end. For instance, a two round experiment for the logical Z − basis consists of an X − check for state preparation, two rounds of X − and Z − checks, and a final measurement of the code qubits. Each check consists of two-qubit gates and measurements. As a result, there are three sets of two-qubit gates and measurements on X − check qubits, two sets of two-qubit gates and measurements on Z − check qubits, and one measurement of the code qubits. The post-selection procedure discards the result if any of the qubit is leaked from the computational subspace. Therefore, we sum all the leakage probabilities to compute for each syndrome measurement round. Z X 1 5 Z X X Z X Z Figure 5c, d shows as a function of the number of rounds for the logical Z- and X-basis, respectively. Black symbols denote leakage detected, as outlined in Methods “Post-selection method”, during the course of the error correction circuits themselves. This method onlys detect the occurrence of leakage and cannot differentiate the cause of leakage (measurement versus 2Q gate). With the analysis described in this section, we obtain estimates as shown by each bar in Fig. 5c, d, which represents from two-qubit gates (blue) and measurement (red) operations. When combined, the estimated leakage rate per round matches the experimental values decently well. 5 Z X 5 This analysis shows that reducing leakage error from both two-qubit gates and measurements is important. Decreasing leakage induced by two-qubit gates in our architecture will be associated with slower gates. With respect to measurement, as noted above, it is well known that a strong drive on a superconducting qubit system can lead to transitions both beyond the computational space40 and beyond the confinement of the Josephson cosine potential42. There is therefore a trade-off to be considered between readout error and measurement length and leakage probability. Slower readout impacts the system by increasing the idle time of the qubits not being measured. There have been proposals to deal with leakage in superconducting qubit systems by moving all the qubit excitations to the readout resonator, from which they decay to the environment43, or by designing readout resonator leakage reduction units (LRU)44 which exploit particular transition levels of the qubit-resonator system and which transform leakage errors into Pauli errors. LRU have also been proposed at the code level45. These options, as well as higher branching capabilities in readout and control electronics to conditionally reset qubits to the ground state from higher excitation levels, could be explored in experimental systems demonstrating quantum error correction in the near future. 40 42 43 44 45 Post-selection method We post-select all our results to remove detected leakage events in any of the qubits in our system. To do this, we look at 5000 integrated outputs for each qubit when prepared in each of the states , , and . We show this calibration for QF12 (see Fig. 4a) in Fig. 5e. The overlap between the and states, which is significant in all 23 qubits used in this work, makes the classification of these states challenging. Furthermore, the presence of decay events ( to , to , or to ) may impair the results using this training data within a supervised learning protocol. We instead apply clustering methods to our calibration data using a Gaussian Mixture Model (GMM) with three clusters, each cluster with an independent diagonal covariance matrix. The diagonal entries of the covariance matrices can be used to extract the standard deviations of the distribution for each qubit state. This offers a convenient way for us to define more flexible classification rules, compared to, for example, simpler clustering algorithms like K-means. Once the centroids and standard deviations (σx and σy) are determined from the calibration data, we define regions for each state within the I/Q plane determined by a radius of 3σ on each axis around the corresponding centroid (see Fig. 5). QF 4 5 σx σy I Q σ 5) For any given measurement in any of the qubits, if the integrated outcome is within the -state region and the I-quadrature is negative, we classify that outcome as . If the integrated outcome is not within the -state region or the I-quadrature is positive, if it is within the -state region we classify it as , and if it is within the -state region but not within the -state region, we classify it as . For all other results, we classify the output according to its closest centroid. I I This classification method is applied to every qubit after every measurement and the experimental runs in which any qubit is measured as is discarded. Figure 5f shows the readout outcomes of QF12 after the last initialization measurement. We only discard uncorrectable errors ( state) and retain experimental shots in which a qubit is in the state after initialization, as that should be a correctable error by the code. Figure 5g shows the QF12 results after the first X − check for a logical state preparation. Both the initialization and the mid-circuit contain the 500,000 shots that are used for each error correction run in our experiments. For the initialization classification we obtain populations of 0.9910, 0.0071, and 0.0019 for the , , and states, respectively. For the mid-circuit X − syndrome classification, those populations are observed to be 0.4972, 0.4962, and 0.0066. 5 QF 5 QF X X Logical error at r = 2 rounds r Table 4 shows a comparison across the decoders studied in this work for state preparation and two rounds of syndrome measurement for the logical states , , , and . These results correspond to the values shown in Fig. 2c, d and Fig. 6 at r = 2 rounds. 4 2 6 r Soft-information decoding In the main text, binary measurement outcomes (0 or 1) were deduced from experimental data and used in decoding. However, it has been shown33 that exploiting soft measurement information before it is converted into hard, binary information can improve decoding performance. Here we attempt this strategy with the matching decoder and find small improvements in our logical error rates per round. 33 Let us first describe how the soft information decoding works. For each measurement, three probabilities can be calculated based on the classification Gaussians described in Section “Post-selection method”. These probabilities are , the probability of measurement assuming the true qubit state was i = 0, 1, 2. After leakage post-selection, we assume the qubits were not in state , so only the i = 0, 1 probabilities feature into our modified matching algorithm. i i We can use Bayes’ rule to write , where P[i] and are a priori probabilities. We form the likelihood ratio33 P i 33 where is the hard outcome corresponding to measurement . We also make the assumption that a priori P[0] = P[1]. This is not a very accurate assumption, especially for the flag qubits, which are expected to be the majority of the time. However, this simplifies the likelihood ratio to , a ratio of probabilities that are calculated directly from the experimental readout. Inputting more a priori information, perhaps expected probabilities from Pauli tracing, is a way to potentially improve soft information decoding. P P We now modify the edge weights we and edge flip probabilities in the decoding graph (the same graph used by the uniform and analytical matching decoders). The first change is that in Table 1 is replaced by the appropriate likelihoods . Note that while refers to the average probability a measurement fails, is different for each of the 18r + 15 (or 18r + 21) measurements in a Z-basis (or X-basis) experiment, so Pauli tracing must be modified to assign unique likelihoods to each measurement. Finally, because we now use likelihoods, we replace all other terms aipi in , for , with aipi/(1 − pi), and set . we 1 r r Z X aipi aipi pi Performing minimum-weight perfect matching with these modified edge weights on leakage post-selected data gives the logical error rates in Fig. 2c, d, and Fig. 6. We also attempted to use both hard and soft likelihood terms in the edge probabilities, but this produced worse error rates. It’s possible the value of could be adjusted to improve this hard and soft combination decoding. 2 6 Data availability Data available upon request to contributing authors. References Chamberland, C., Zhu, G., Yoder, T. J., Hertzberg, J. B. & Cross, A. W. Topological and subsystem codes on low-degree graphs with flag qubits. Phys. Rev. X 10, 011022 (2020). Hertzberg, J. B. et al. Laser-annealing josephson junctions for yielding scaled-up superconducting quantum processors. npj Quantum Inf. 7, 1 (2021). Poulin, D. Stabilizer formalism for operator quantum error correction. Phys. Rev. Lett. 95, 230504 (2005). Dennis, E., Kitaev, A. Y., Landahl, A. J. & Preskill, J. Topological quantum memory. J. Math. Phys. 43, 4452 (2002). Bombin, H. & Martin-Delgado, M. A. Topological quantum distillation. Phys. Rev. Lett. 97, 180501 (2006). Piveteau, C., Sutter, D., Bravyi, S., Gambetta, J. M. & Temme, K. Error mitigation for universal gates on encoded qubits. Phys. Rev. Lett. 127, 200505 (2021). Chamberland, C., Iyer, P. & Poulin, D. Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics. Quantum 2, 43 (2018). DiVincenzo, D. P. & Aliferis, P. Effective fault-tolerant quantum computation with slow measurements. Phys. Rev. Lett. 98, 020501 (2007). Bravyi, S. & Kitaev, A. Universal quantum computation with ideal clifford gates and noisy ancillas. Phys. Rev. A 71, 022316 (2005). Linke, N. M. et al. Fault-tolerant quantum error detection. Sci. Adv. 3, e1701074 (2017). Abobeih, M. H. et al. Fault-tolerant operation of a logical qubit in a diamond quantum processor. Nature 606, 884–889 (2022). Takita, M., Cross, A. W., Córcoles, A. D., Chow, J. M. & Gambetta, J. M. Experimental demonstration of fault-tolerant state preparation with superconducting qubits. Phys. Rev. Lett. 119, 180501 (2017). Andersen, C. K. et al. Repeated quantum error detection in a surface code. Nat. Phys. 16, 875 (2020). Chen, Z. et al. Exponential suppression of bit or phase errors with cyclic error correction. Nature 595, 383 (2021). Chen, E. H. et al. Calibrated decoders for experimental quantum error correction. Phys. Rev. Lett. 128, 110504 (2022). Marques, J. F. et al. Logical-qubit operations in an error-detecting surface code. Nat. Phys. 18, 80–86 (2022). Postler, L. et al. Demonstration of fault-tolerant universal quantum gate operations. Nature 605, 675–680 (2022). Krinner, S. et al. Realizing repeated quantum error correction in a distance-three surface code. Nature 605, 669 (2022). Zhao, Y.-W. et al. Realization of an error-correcting surface code with superconducting qubits. Phys. Rev. Lett. 129, 030501 (2022). Ryan-Anderson, C. et al. Realization of real-time fault-tolerant quantum error correction. Phys. Rev. X 11, 041058 (2021). Egan, L. et al. Fault-tolerant control of an error-corrected qubit. Nature 598, 281–286 (2021). Bacon, D. Operator quantum error-correcting subsystems for self-correcting quantum memories. Phys. Rev. A 73, 012340 (2006). Pryadko, L. P. On maximum-likelihood decoding with circuit-level errors. Quantum 4, 304 (2020). Bravyi, S., Suchara, M. & Vargo, A. Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code. Phys. Rev. A 90, 032326 (2014). Gottesman, D. The Heisenberg representation of quantum computers. arXiv preprint quant-ph/9807006 (1998). Gidney, C. Stim: a fast stabilizer circuit simulator. Quantum 5, 497 (2021). Fowler, A. G., Whiteside, A. C. & Hollenberg, L. C. L. Towards practical classical processing for the surface code. Phys. Rev. Lett. 108, 180501 (2012). Higgott, O. PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching. https://arxiv.org/abs/2105.13082 (2021). Dua, A., Jochym-O’Connor, T. & Zhu, G. Quantum error correction with fractal topological codes. arXiv:2201.03568 (2022). Bravyi, S. & Cross, A. Doubled Color Codes. https://arxiv.org/abs/1509.03239 (2015). Heim, B., Svore, K. M. & Hastings, M. B. Optimal Circuit-Level Decoding for Surface Codes. https://arxiv.org/abs/1609.06373 (2016). IBM Quantum, https://quantum-computing.ibm.com/services/resources?tab=systems&system=ibm_peekskill Services, (2022). Pattison, C. A., Beverland, M. E., da Silva, M. P. & Delfosse, N., Improved quantum error correction using soft information. arXiv:2107.13589 (2021). Das, P. et al. A scalable decoder micro-architecture for fault-tolerant quantum computing. arXiv:2001.06598 (2020). Smith, S. C., Brown, B. J. & Bartlett, S. D. Local predecoder to reduce the bandwidth and latency of quantum error correction. Phys. Rev. App. 19, 034050 (2023). IBM Quantum and Community https://doi.org/10.5281/zenodo.2573505 Qiskit: An open-source framework for quantum computing (2021). McKay, D. C., Sheldon, S., Smolin, J. A., Chow, J. M. & Gambetta, J. M. Three-qubit randomized benchmarking. Phys. Rev. Lett. 122, 200502 (2019). Byrd, R. H., Lu, P., Nocedal, J. & Zhu, C. A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16, 1190 (1995). Wood, C. J. & Gambetta, J. M. Quantification and characterization of leakage errors. Phys. Rev. A 97, 032306 (2018). Sank, D. et al. Measurement-induced state transitions in a superconducting qubit: Beyond the rotating wave approximation. Phys. Rev. Lett. 117, 190503 (2016). Bravyi, S., Sheldon, S., Kandala, A., Mckay, D. C. & Gambetta, J. M. Mitigating measurement errors in multiqubit experiments. Phys. Rev. A 103, 042605 (2021). Lescanne, R. et al. Escape of a driven quantum josephson circuit into unconfined states. Phys. Rev. Appl. 11, 014030 (2019). McEwen, M. et al. Removing leakage-induced correlated errors in superconducting quantum error correction. Nat. Commun. 12, 1761 (2021). Battistel, F., Varbanov, B. & Terhal, B. Hardware-efficient leakage-reduction scheme for quantum error correction with superconducting transmon qubits. PRX Quantum 2, 030314 (2021). Suchara, M, Cross, A. W. & Gambetta, J. M. Leakage suppression in the toric code. In Proc. IEEE International Symposium on Information Theory (ISIT), 1119 (2015). Sundaresan, N. et al. Reducing Unitary and Spectator Errors in Cross Resonance with Optimized Rotary Echoes. PRX Quantum 1, 020318 (2020). Chamberland, C., Zhu, G., Yoder, T. J., Hertzberg, J. B. & Cross, A. W. Topological and subsystem codes on low-degree graphs with flag qubits. Phys. Rev. X 10, 011022 (2020). Phys. Rev. X 10 Hertzberg, J. B. et al. Laser-annealing josephson junctions for yielding scaled-up superconducting quantum processors. npj Quantum Inf. 7, 1 (2021). npj Quantum Inf. 7 Poulin, D. Stabilizer formalism for operator quantum error correction. Phys. Rev. Lett. 95, 230504 (2005). Phys. Rev. Lett. 95 Dennis, E., Kitaev, A. Y., Landahl, A. J. & Preskill, J. Topological quantum memory. J. Math. Phys. 43, 4452 (2002). J. Math. Phys. 43 Bombin, H. & Martin-Delgado, M. A. Topological quantum distillation. Phys. Rev. Lett. 97, 180501 (2006). Phys. Rev. Lett. 97 Piveteau, C., Sutter, D., Bravyi, S., Gambetta, J. M. & Temme, K. Error mitigation for universal gates on encoded qubits. Phys. Rev. Lett. 127, 200505 (2021). Phys. Rev. Lett. 127 Chamberland, C., Iyer, P. & Poulin, D. Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics. Quantum 2, 43 (2018). Quantum 2 DiVincenzo, D. P. & Aliferis, P. Effective fault-tolerant quantum computation with slow measurements. Phys. Rev. Lett. 98, 020501 (2007). Phys. Rev. Lett. 98 Bravyi, S. & Kitaev, A. Universal quantum computation with ideal clifford gates and noisy ancillas. Phys. Rev. A 71, 022316 (2005). Phys. Rev. A 71 Linke, N. M. et al. Fault-tolerant quantum error detection. Sci. Adv. 3, e1701074 (2017). Sci. Adv. 3 Abobeih, M. H. et al. Fault-tolerant operation of a logical qubit in a diamond quantum processor. Nature 606, 884–889 (2022). Nature 606 Takita, M., Cross, A. W., Córcoles, A. D., Chow, J. M. & Gambetta, J. M. Experimental demonstration of fault-tolerant state preparation with superconducting qubits. Phys. Rev. Lett. 119, 180501 (2017). Phys. Rev. Lett. 119 Andersen, C. K. et al. Repeated quantum error detection in a surface code. Nat. Phys. 16, 875 (2020). Nat. Phys. 16 Chen, Z. et al. Exponential suppression of bit or phase errors with cyclic error correction. Nature 595, 383 (2021). Nature 595 Chen, E. H. et al. Calibrated decoders for experimental quantum error correction. Phys. Rev. Lett. 128, 110504 (2022). Phys. Rev. Lett. 128 Marques, J. F. et al. Logical-qubit operations in an error-detecting surface code. Nat. Phys. 18, 80–86 (2022). Nat. Phys. 18 Postler, L. et al. Demonstration of fault-tolerant universal quantum gate operations. Nature 605, 675–680 (2022). Nature 605 Krinner, S. et al. Realizing repeated quantum error correction in a distance-three surface code. Nature 605, 669 (2022). Nature 605 Zhao, Y.-W. et al. Realization of an error-correcting surface code with superconducting qubits. Phys. Rev. Lett. 129, 030501 (2022). Phys. Rev. Lett. 129 Ryan-Anderson, C. et al. Realization of real-time fault-tolerant quantum error correction. Phys. Rev. X 11, 041058 (2021). Phys. Rev. X 11 Egan, L. et al. Fault-tolerant control of an error-corrected qubit. Nature 598, 281–286 (2021). Nature 598 Bacon, D. Operator quantum error-correcting subsystems for self-correcting quantum memories. Phys. Rev. A 73, 012340 (2006). Phys. Rev. A 73 Pryadko, L. P. On maximum-likelihood decoding with circuit-level errors. Quantum 4, 304 (2020). Quantum 4 Bravyi, S., Suchara, M. & Vargo, A. Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code. Phys. Rev. A 90, 032326 (2014). Phys. Rev. A 90 Gottesman, D. The Heisenberg representation of quantum computers. arXiv preprint quant-ph/9807006 (1998). arXiv preprint quant-ph/9807006 Gidney, C. Stim: a fast stabilizer circuit simulator. Quantum 5, 497 (2021). Quantum 5 Fowler, A. G., Whiteside, A. C. & Hollenberg, L. C. L. Towards practical classical processing for the surface code. Phys. Rev. Lett. 108, 180501 (2012). Phys. Rev. Lett. 108 Higgott, O. PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching. https://arxiv.org/abs/2105.13082 (2021). https://arxiv.org/abs/2105.13082 Dua, A., Jochym-O’Connor, T. & Zhu, G. Quantum error correction with fractal topological codes. arXiv:2201.03568 (2022). arXiv:2201.03568 Bravyi, S. & Cross, A. Doubled Color Codes. https://arxiv.org/abs/1509.03239 (2015). https://arxiv.org/abs/1509.03239 Heim, B., Svore, K. M. & Hastings, M. B. Optimal Circuit-Level Decoding for Surface Codes. https://arxiv.org/abs/1609.06373 (2016). https://arxiv.org/abs/1609.06373 IBM Quantum, https://quantum-computing.ibm.com/services/resources?tab=systems&system=ibm_peekskill Services, (2022). https://quantum-computing.ibm.com/services/resources?tab=systems&system=ibm_peekskill Pattison, C. A., Beverland, M. E., da Silva, M. P. & Delfosse, N., Improved quantum error correction using soft information. arXiv:2107.13589 (2021). arXiv:2107.13589 Das, P. et al. A scalable decoder micro-architecture for fault-tolerant quantum computing. arXiv:2001.06598 (2020). arXiv:2001.06598 Smith, S. C., Brown, B. J. & Bartlett, S. D. Local predecoder to reduce the bandwidth and latency of quantum error correction. Phys. Rev. App. 19, 034050 (2023). Phys. Rev. App. 19 IBM Quantum and Community https://doi.org/10.5281/zenodo.2573505 Qiskit: An open-source framework for quantum computing (2021). https://doi.org/10.5281/zenodo.2573505 McKay, D. C., Sheldon, S., Smolin, J. A., Chow, J. M. & Gambetta, J. M. Three-qubit randomized benchmarking. Phys. Rev. Lett. 122, 200502 (2019). Phys. Rev. Lett. 122 Byrd, R. H., Lu, P., Nocedal, J. & Zhu, C. A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16, 1190 (1995). SIAM J. Sci. Comput. 16 Wood, C. J. & Gambetta, J. M. Quantification and characterization of leakage errors. Phys. Rev. A 97, 032306 (2018). Phys. Rev. A 97 Sank, D. et al. Measurement-induced state transitions in a superconducting qubit: Beyond the rotating wave approximation. Phys. Rev. Lett. 117, 190503 (2016). Phys. Rev. Lett. 117 Bravyi, S., Sheldon, S., Kandala, A., Mckay, D. C. & Gambetta, J. M. Mitigating measurement errors in multiqubit experiments. Phys. Rev. A 103, 042605 (2021). Phys. Rev. A 103 Lescanne, R. et al. Escape of a driven quantum josephson circuit into unconfined states. Phys. Rev. Appl. 11, 014030 (2019). Phys. Rev. Appl. 11 McEwen, M. et al. Removing leakage-induced correlated errors in superconducting quantum error correction. Nat. Commun. 12, 1761 (2021). Nat. Commun. 12 Battistel, F., Varbanov, B. & Terhal, B. Hardware-efficient leakage-reduction scheme for quantum error correction with superconducting transmon qubits. PRX Quantum 2, 030314 (2021). PRX Quantum 2 Suchara, M, Cross, A. W. & Gambetta, J. M. Leakage suppression in the toric code. In Proc. IEEE International Symposium on Information Theory (ISIT), 1119 (2015). Proc. IEEE International Symposium on Information Theory (ISIT) Sundaresan, N. et al. Reducing Unitary and Spectator Errors in Cross Resonance with Optimized Rotary Echoes. PRX Quantum 1, 020318 (2020). PRX Quantum 1 Acknowledgements The authors would like to thank Christophe Piveteau for his thorough proofreading and Malcolm Carroll for discussions on simulations using noisy parameters. We also thank John Lapeyre for converting the codebase from Python to Julia allowing for easier debugging and multithreading. The device was designed and fabricated internally at IBM. We acknowledge the use of IBM Quantum services for this work, and these results were enabled by the work of the IBM Quantum software and hardware teams. This code demonstration work was supported by IARPA under LogiQ (contract W911NF-16-1-0114) - N.S., T.J.Y., Y.K., M.L., E.H.C., G.H., T.T., A.W.C., A.D.C., and M.T. All statements of fact, opinion or conclusions contained herein are those of the authors and should not be construed as representing the official views or policies of the US Government. This paper is available on nature under CC by 4.0 Deed (Attribution 4.0 International) license. This paper is available on nature under CC by 4.0 Deed (Attribution 4.0 International) license. available on nature
