Research ArticleAPPLIED SCIENCES AND ENGINEERING

Protecting quantum entanglement from leakage and qubit errors via repetitive parity measurements

See allHide authors and affiliations

Science Advances  20 Mar 2020:
Vol. 6, no. 12, eaay3050
DOI: 10.1126/sciadv.aay3050

Abstract

Protecting quantum information from errors is essential for large-scale quantum computation. Quantum error correction (QEC) encodes information in entangled states of many qubits and performs parity measurements to identify errors without destroying the encoded information. However, traditional QEC cannot handle leakage from the qubit computational space. Leakage affects leading experimental platforms, based on trapped ions and superconducting circuits, which use effective qubits within many-level physical systems. We investigate how two-transmon entangled states evolve under repeated parity measurements and demonstrate the use of hidden Markov models to detect leakage using only the record of parity measurement outcomes required for QEC. We show the stabilization of Bell states over up to 26 parity measurements by mitigating leakage using postselection and correcting qubit errors using Pauli-frame transformations. Our leakage identification method is computationally efficient and thus compatible with real-time leakage tracking and correction in larger quantum processors.

INTRODUCTION

Large-scale quantum information processing hinges on overcoming errors from environmental noise and imperfect quantum operations. Fortunately, the theory of quantum error correction (QEC) predicts that the coherence of single degrees of freedom (logical qubits) can be better preserved by encoding them in ever-larger quantum systems (Hilbert spaces), provided the error rate of the constituent elements lies below a fault-tolerance threshold (1). Experimental platforms based on trapped ions and superconducting circuits have achieved error rates in single-qubit (SQ) gates (2–4), two-qubit gates (2, 4, 5), and qubit measurements (3, 6–8) at or below the threshold for popular QEC schemes such as surface (9, 10) and color codes (11). They therefore seem well poised for the experimental pursuit of quantum fault tolerance. However, a central assumption of textbook QEC that error processes can be discretized into bit flips (X), phase flips (Z), or their combination (Y = iXZ) only is difficult to satisfy experimentally. This is due to the prevalent use of many-level systems as effective qubits, such as hyperfine levels in ions and weakly anharmonic transmons in superconducting circuits, making leakage from the two-dimensional computational space of effective qubits a threatening error source. In quantum dots and trapped ions, leakage events can be as frequent as qubit errors (12, 13). However, even when leakage is less frequent than qubit errors as in superconducting circuits (2, 5), if ignored, then leakage can produce the dominant damage to encoded logical information. To address this, theoretical studies propose techniques to reduce the effect of leakage by periodically moving logical information and removing leakage when qubits are free of logical information (14–17). Alternatively, more hardware-specific solutions have been proposed for trapped ions (18) and quantum dots (19). In superconducting circuits, recent experiments have demonstrated single- and multiround parity measurements to correct qubit errors with up to nine physical qubits (20–28). Parallel approaches encoding information in the Hilbert space of single resonators using cat (29) and binomial codes (30) used transmon-based photon parity checks to approach the breakeven point for a quantum memory. However, no experiment has demonstrated the ability to detect and mitigate leakage in a QEC context.

Here, we experimentally investigate leakage detection and mitigation in a minimal QEC system. Specifically, we protect an entangled state of two transmon data qubits (QDH and QDL) from qubit errors and leakage during up to 26 rounds of parity measurements via an ancilla transmon (QA). Performing these parity checks in the Z basis protects the state from X errors, while interleaving checks in the Z and X bases protects it from general qubit errors (X, Y, and Z). Leakage manifests itself as a round-dependent degradation of data-qubit correlations ideally stabilized by the parity checks: 〈Z ⊗ Z〉 in the first case and 〈X ⊗ X〉, 〈Y ⊗ Y〉, and 〈Z ⊗ Z〉 in the second. We introduce hidden Markov models (HMMs) to efficiently detect data-qubit and ancilla leakage, using only the string of parity outcomes, demonstrating restoration of the relevant correlations. Although we use postselection here, the low technical overhead of HMMs makes them ideal for real-time leakage correction in larger QEC codes.

RESULTS

A minimal QEC setup

Repetitive parity checks can produce and stabilize two-qubit entanglement. For example, performing a Z ⊗ Z parity measurement (henceforth a ZZ check) on two data qubits prepared in the unentangled state ∣++〉 = (∣0〉 + ∣1〉) ⊗ (∣0〉 + ∣1〉) /2 will ideally project them to either of the two (entangled) Bell states ∣Φ+〉=(∣00〉+∣11〉)/2 or ∣Ψ+〉=(∣01〉+∣10〉)/2, as signaled by the ancilla measurement outcome MA. Subsequent ZZ checks will ideally leave the entangled state unchanged. However, qubit errors will alter the state in ways that may or may not be detectable and/or correctable. For instance, a bit-flip (X) error on either data qubit, which transforms ∣Φ+〉 into ∣Ψ+〉, will be detected because X anticommutes with a ZZ check. The corruption can be corrected by applying a bit flip on either data qubit because this cancels the original error (X2 = I) or completes the operation X ⊗ X, of which ∣Φ+〉 and ∣Ψ+〉 are both eigenstates. The correction can be applied in real time using feedback (20, 21, 28, 31) or kept track of using Pauli frame updating (PFU) (24, 32). We choose the latter, with PFU strategy “X on QDH.” Phase-flip errors are not detectable since Z on either data qubit commutes with a ZZ check. These errors transform ∣Φ+〉 into ∣Φ−〉=(∣00〉−∣11〉)/2 and ∣Ψ+〉 into ∣Ψ−〉=(∣01〉−∣10〉)/2. Last, Y errors produce the same signature as X errors. Our PFU strategy above converts them into Z errors. Crucially, by interleaving checks of type ZZ and XX (measuring X ⊗ X), arbitrary qubit errors can be detected and corrected. The ZZ check will signal either X or Y error, and the XX check will signal Z or Y, providing a unique signature in combination.

Generating entanglement by measurement

Our parity check is an indirect quantum measurement involving coherent interactions of the data qubits with QA and subsequent QA measurement (Fig. 1A) (33). The coherent step maps the data-qubit parity onto QA in 120 ns using SQ and two-qubit controlled-phase (CZ) gates (5). Gate characterizations (see the Supplementary Materials) indicate state-of-the-art gate errors eSQ = {0.08 ± 0.02,0.14 ± 0.016,0.21 ± 0.06}% and eCZ = {1.4 ± 0.6,0.9 ± 0.16}% with leakage per CZ L1 = {0.27 ± 0.12,0.15 ± 0.07}%. We measure QA with a 620-ns pulse including photon depletion (7, 34), achieving an assignment error ea = 1.0 ± 0.1%. We avoid data-qubit dephasing during the QA measurement by coupling each qubit to a dedicated readout resonator (RR) and a dedicated Purcell resonator (PR) (fig. S1) (8). The parity check has a cycle time of 740 ns, corresponding to only 2.5 ± 0.2% and 5.0 ± 0.3% of the data-qubit echo dephasing times (see the Supplementary Materials).

Fig. 1 Entanglement genesis by ZZ parity measurement and Pauli frame update.

(A) Quantum circuit for a parity measurement of the data qubits via coherent operations with ancilla QA and QA measurement. Tomography reconstructs the data-qubit output density matrix (ρ). Echo pulses (orange) are applied halfway the QA measurement when performing tomography sequential to the QA measurement. (B) Bloch sphere representation of the even-parity subspace with a marker on ∣Φ+⟩. (C to F) Plots of ρ with fidelity to the Bell states (indicated by frames) for tomography simultaneous with QA measurement (C to E) and sequetial to QA measurement (F). (C)[(D)] Conditioning on MA = +1[ −1] ideally generates ∣Φ+⟩ [∣Ψ+⟩] with equal probability P. (E)[(F)] PFU applies bit-flip correction (X on QDH) for MA = −1 and reconstructs ρ using all data for simultaneous [sequential] tomography.

The parity measurement performance can be quantified by correlating its outcome with input and output states. We first quantify the ability to distinguish even-parity (∣00〉, ∣11〉) from odd-parity (∣01〉, ∣10〉) data-qubit input states, finding an average parity assignment error ea,ZZ = 5.1 ± 0.2%. Second, we assess the ability to project onto the Bell states by performing a ZZ check on ∣++〉 and reconstructing the most likely physical data-qubit output density matrix ρ, conditioning on MA = ±1. When tomographic measurements are performed simultaneously with the QA measurement, we find Bell-state fidelities F∣Φ+〉∣MA=+1 = 〈Φ+∣ρMA=+1∣Φ+〉 = 94.7 ± 1.9% and F∣Ψ+〉∣MA=−1 = 94.5 ± 2.5% (Fig. 1, C and D). We connect ∣Ψ+〉 to ∣Φ+〉 by incorporating the PFU into the tomographic analysis, obtaining F∣Φ+〉 = 94.6 ± 0.9% without any postselection (Fig. 1E). The nondemolition character of the ZZ check is then validated by performing tomography only once the QA measurement completes. We include an echo pulse on both data qubits during the QA measurement to reduce intrinsic decoherence and negate residual coupling between data qubits and QA (fig. S3). The degradation to F∣Φ+〉 = 91.8 ± 0.5% is consistent with intrinsic data-qubit decoherence under echo and confirms that measurement-induced errors are minimal.

Protecting entanglement from bit flips and the observation of leakage

QEC stipulates repeated parity measurements on entangled states. We therefore study the evolution of F∣Φ+〉 = (1 + 〈X ⊗ X〉 − 〈Y ⊗ Y〉 + 〈Z ⊗ Z〉)/4 and its constituent correlations as a function of the number M of checks (Fig. 2A). When performing PFU using the first ZZ outcome only (ignoring subsequent outcomes), we observe that F∣Φ+〉 witnesses entanglement (>0.5) during 10 rounds and approaches randomization (0.25) by M = 25 (Fig. 2B). The constituent correlations also decay with simple exponential forms. A best fit of the form 〈Z ⊗ Z〉[M] = a · e−M/υZZ + b gives a decay time υZZ = 9.0 ± 0.9 rounds; similarly, we extract υXX = 11.7 ± 1.0 rounds (Fig. 2, C and D). By comparison, we observe that Bell states evolving under dynamical decoupling only (no ZZ checks; see fig. S4) decay similarly (υZZ = 8.6 ± 0.3, υXX = 12.8 ± 0.4 rounds). These similarities indicate that intrinsic data-qubit decoherence is also the dominant error source in this multiround protocol.

Fig. 2 Protecting entanglement from bit flips with repeated ZZ checks.

(A) The quantum circuit of Fig. 1A extended with M rounds of repeated ZZ checks. (B) Fidelity to ∣Φ+⟩ as a function of M. “No error” postselects the runs in which no bit flip is detected. “Final” applies PFU based on the last two outcomes (equivalent to MWPM). “First” uses the first parity outcome only. “Idling DD” are Bell states evolving under dynamical decoupling only (quantum circuit in fig. S4). (C) Corresponding 〈X ⊗ X〉. “Final” coincides with “First”. (D) Corresponding 〈Z ⊗ Z〉. The weak degradation observed for “Final” is the hallmark of leakage. Curves in (B) to (D) are best fits of a simple exponential decay.

To demonstrate the ability to detect X and Y but not Z errors, we condition the tomography on signaling no errors during M rounds. This boosts 〈Z ⊗ Z〉 to a constant, while the undetectability of Z errors only allows slowing the decay of 〈X ⊗ X〉 to υXX = 33.2 ± 1.7 rounds (and of 〈Y ⊗ Y〉 to υYY = 31.3 ± 1.9 rounds). Naturally, this conditioning comes at the cost of the postselected fraction fpost reducing with M (fig. S5).

Moving from error detection to correction, we consider the protection of ∣Φ+〉 by tracking X errors and applying corrections in postprocessing. The correction relies on the final two MA only, concluding even parity for equal measurement outcomes and odd parity for unequal. For this small-scale experiment, this strategy is equivalent to a decoder based on minimum-weight perfect matching (MWPM) (10, 35), justifying its use. Because our PFU strategy converts Y errors into Z errors, one expects a faster decay of 〈X ⊗ X〉 compared to the no-error conditioning; we observe υXX = 11.8 ± 1.0 rounds. Correction should lead to a constant 〈Z ⊗ Z〉. While 〈Z ⊗ Z〉 is clearly boosted, a weak decay to a steady state 〈Z ⊗ Z〉 = 0.73 ± 0.03 is also evident (Fig. 2D). As previously observed in (31), this degradation is the hallmark of leakage [see also (21, 24)]. We additionally compare the experimental results to simulations using a model that assumes ideal two-level systems (35) (no leakage) based on independently calibrated parameters of table S1 (fig. S8, A to D). At M = 1, the model and the experiment coincide for all correction strategies. At larger M, “first” and “final” correction strategies deviate substantially, consistent with a gradual buildup of leakage, which we now turn our focus to.

Leakage detection using HMMs

Both ancilla and data-qubit leakage in our experiment can be inferred from a string M→A=(MA[m=0],…,MA[m=M]) of measurement outcomes. Leakage of QA to the second excited transmon state ∣2〉 produces MA = −1 because measurement does not discern it from ∣1〉. This leads to the pattern M→A=(…−1,−1…) until QA seeps back to ∣1〉 (coherently or by relaxation), as it is unaffected by subsequent π/2 rotations (Fig. 3C). Leakage of a data qubit (Fig. 3B) leads to apparent repeated errors [signaled by M→A=(…+1,+1,−1,−1…)], as the echo pulses only act on the unleaked qubit. This is equivalent to a pattern of repeated error signals in the data-qubit syndrome sD[m] ≔ MA[m] · MA[m − 2]—sD = (…, −1, −1, −1, …). (We call sD[m] = −1 an error signal as in the absence of noise sD[m] = +1, while the measurements MA[m] will still depend on the ZZ parity.)

Fig. 3 Leakage detection and mitigation during repeated ZZ checks using HMMs.

(A) Simplified HMM. In each round, a hidden state (leaked or unleaked) (top) is updated probabilistically (full arrows) and produces an observable MA (bottom) with state-dependent probabilities (dashed arrows). After training, the HMM can be used to assess the likelihood of states given a produced string M→A of MA. (B) Example M→A for a data-qubit leakage event (yellow markers), showing the characteristic pattern of repeated errors. (C) Example M→A for QA leakage signaled by constant MA = −1. (D) Histograms of 105M→A with M = 25, both obtained experimentally, and simulated by the HMM optimized to detect data-qubit leakage, binned according to the likelihood (Eqs. 9 and 10) of the data qubits being unleaked (as assessed from the trained HMM). HMM training suggests 5.6% total data-qubit leakage at M = 25 [calculated from Table 1 as the steady-state fraction pleak/(pleak + pseep)]. (E) Corresponding histograms using the HMM optimized for QA leakage. This HMM suggests 3.8% total QA leakage. (F) Receiver operating characteristics (ROCs) for the trained HMMs. (G) 〈Z ⊗ Z〉 after M ZZ checks and correction based on the final outcomes, without (same data as in Fig. 2D) and with leakage mitigation by postselection (TPR = 0.7).

Neither of the above patterns is entirely unique to leakage; each may also be produced by some combination of qubit errors. Therefore, we cannot unambiguously diagnose an individual experimental run of corruption by leakage. However, given a set of ancilla measurements MA[0], …, MA[m], the likelihood Lcomp,Q(M→A) that qubit Q is in the computational subspace during the final parity checks is well defined. In this work, we infer Lcomp,Q(M→A) by using an HMM (36), which treats the system as leaking out of and seeping back to the computational subspace in a stochastic fashion between each measurement round (a leakage HMM in its simplest form is shown in Fig. 3A and further described in the “Hidden Markov models,” “HMMs for QEC experiments,” and “Simplest models for leakage discrimination” sections). This may be extended to scalable leakage detection (for the purposes of leakage mitigation) in a larger QEC code, by using a separate HMM for each data qubit and ancilla. To improve the validity of the HMMs, we extend their internal states to allow the modeling of additional noise processes in the experiments (detailed in the “Modeling additional noise” and “HMMs used in Figs. 2 and 4” sections).

Fig. 4 Protecting entanglement from general qubit error and leakage.

(A) Simplified quantum circuit with preparation, repeated pairs of ZZ and XX checks, and data-qubit tomography. (B) Fidelity to ∣Φ+⟩ as a function of M, extracted from the data-qubit tomography. “No error” postselects the runs in which no error is detected (postselected fraction in fig. S5). “Final” applies PFU based on the last three outcomes (equivalent to MWPM). “Final + HMM” includes mitigation of leakage. “First” uses only the first pair of parity outcomes. (C and D) Corresponding 〈X ⊗ X〉 and 〈Z ⊗ Z〉. Curves in (B) to (D) are best fits of a simple exponential decay.

Before assessing the ability of our HMMs to improve fidelity in a leakage mitigation scheme, we first validate and benchmark them internally. A common method to validate the HMM’s ability to model the experiment is to compare statistics of the experimentally generated data to a simulated dataset generated by the model itself. As we are concerned only with the ability of the HMM to discriminate leakage, Lcomp,Q(M→A) provides a natural metric for comparison. In Fig. 3 (D and E), we overlay histograms of 105 experimental and simulated experiments, binned according to Lcomp,Q(M→A), and observe excellent agreement. To further validate our model, we calculate the Akaike information criterion (37)A(H)=2np,H−2 log [maxpi L({o→}∣H{pi})](1)where L(o→∣M) is the likelihood of making the set of observations {o→} given model H (maximized over all parameters pi in the model, as listed in Table 1), and np, M is the number of parameters pi. The number A(H) is rather meaningless by itself; we require a comparison model H(comp) for reference. Our model is preferred over the comparison model whenever A(H) > A(H(comp)). For comparison, we take the target HMM H, remove all parameters describing leakage, and re-optimize. We find the difference A(H) − A(H(comp)) = 1.1 × 105 for the data-qubit HMM and 2.1 × 104 for the ancilla HMM, giving significant preference for the inclusion of leakage in both cases. [The added internal states beyond the simple two-state HMMs clearly improves the overlap in histograms (fig. S10, A and B). The added complexity is further justified by the Akaike information criterion (see the Supplementary Materials).]

Table 1 Values of error rates used in the various HMMs in this work.

All values are obtained by optimizing the likelihood of observing the given syndrome data except for the ancilla leakage rate (denoted as *), which is directly obtained from the experiments (as noted in the main text).

View this table:

The above validation suggests that we may assume that the ratio of actual leakage events at a given Lcomp,Q is well approximated by Lcomp,Q itself (which is true for the simulated data). Under this assumption, we expose the HMM discrimination ability by plotting its receiver operating characteristic (ROC) (38). The ROC (Fig. 3F) is a parametric plot (sweeping a threshold Lcomp,Qth) of the true-positive rate (TPR; the fraction of leaked runs correctly identified) versus the false-positive rate (FPR; the fraction of unleaked runs wrongly identified). Random rejection follows the line y = x; the better the detection, the greater the upward shift. Both ROCs indicate that most of the leakage (TPR = 0.7) can be efficiently removed with FPR ∼ 0.1. Individual mappings of TPR and FPR as a function of Lcomp,Qth can be found in fig. S9 (A and B). Further rejection is more costly, which we attribute to these leakage events being shorter lived. This is because the shorter a leakage event, the more likely its signature is due to (a combination of) qubit errors. Fortunately, shorter leakage events are also less damaging. For instance, a leaked data qubit that seeps back within the same round may be indistinguishable from a relaxation event but also has the same effect on encoded logical information (15).

We now verify and externally benchmark our HMMs by their ability to improve 〈Z ⊗ Z〉 by rejecting data with a high probability of leakage. To do this, we set a threshold Lcomp,Qth and reject experimental runs whenever Lcomp,Q(M→A)<Lcomp,Qth. For both HMMs, we choose Lcomp,Qth to achieve TPR = 0.7. With this choice, we observe a restoration of 〈Z ⊗ Z〉 to its first-round value across the entire curve (Fig. 3G), mildly reducing fpost to 0.82 (averaged over M). This restoration from leakage is confirmed by the “final + HMM” data matching the no-leakage model results in fig. S8 (A to D). As low Lcomp,Q(M→A) is also weakly correlated with qubit errors, the gain in 〈Z ⊗ Z〉 is partly due to false positives. Of the ∼ 0.13 increase at M = 25, we attribute 0.07 to actual leakage (estimated from the ROCs). By comparison, the simple two-state HMM leads to a lower improvement while rejecting a larger part of the data (fig. S10G), ultimately justifying the increased HMM complexity in this particular experiment.

Protecting entanglement from general qubit errors and mitigation of leakage

We lastly demonstrate leakage mitigation in the more interesting scenario where ∣Φ+〉 is protected from general qubit error by interleaving ZZ and XX checks (28, 31). ZZ may be converted to XX by adding π/2 y rotations on the data qubits simultaneous with those on QA. This requires that we change the definition of the syndrome to sD[m] = MA[m] · MA[m − 1] · MA[m − 2] · MA[m − 3], as we need to “undo” the interleaving of the ZZ and XX checks to detect errors. For an input state ∣+0〉=(∣0〉+∣1〉)/2⊗∣0〉, a first pair of checks ideally projects the data qubits to one of the four Bell states with equal probability. Expanding the PFU to X and/or Z on QDH, we find F∣Φ+〉 = 83.8 ± 0.8% (fig. S6). For subsequent rounds, the “final” strategy now relies on the final three MA. We observe a decay toward a steady state F∣Φ+〉 = 73.7 ± 0.9% (Fig. 4), consistent with previously observed leakage. We battle this decay by adapting the HMMs (detailed in the “Modeling additional noise” and “HMMs used in Figs. 2 and 4” sections). We find an improved ROC for QA leakage (fig. S7). For data-qubit leakage, however, the ROC is degraded. This is to be expected—when one data qubit is leaked in this experiment, the ancilla effectively performs interleaved Z and X measurements on the unleaked qubit. This leads to a signal of random noise P(sD[m] = −1) = 0.5, which is less distinguishable from unleaked experiments P(sD[m] = −1) ∼ 0 than the signal of a leaked data-qubit during the 〈Z ⊗ Z〉-only experiment P(sD[m] = −1) ∼ 1. Thresholding to TPR = 0.7 restores 〈X ⊗ X〉 and 〈Z ⊗ Z〉, leading to an almost constant F∣Φ+〉 = 82.8 ± 0.2% with fpost = 0.81 (averaged over M), as expected from the no-leakage model results in fig. S8 (E to H). In this experiment, the simple two-state HMMs perform almost identically compared to the complex HMM, achieving Bell-state fidelities within 2% while retaining the same amount of data (fig. S10N).

DISCUSSION

This HMM demonstration provides exciting prospects for leakage detection and correction. In larger systems, independent HMMs can be dedicated to each qubit because leakage produces local error signals (16). An HMM for an ancilla only needs its measurement outcomes, while a data-qubit HMM only needs the outcomes of the nearest-neighbor ancillas (details in see the Supplementary Materials). Therefore, the computational power grows linearly with the number of qubits, making the HMMs a small overhead when running parallel to MWPM. HMM outputs could be used as inputs to MWPM, allowing MWPM to dynamically adjust its weights. The outputs could also be used to trigger leakage reduction units (14–17) or qubit resets (39).

In summary, we have performed the first experimental investigation of leakage detection during repetitive parity checking, successfully protecting an entangled state from qubit errors and leakage in a circuit quantum electrodynamics processor. Future work will extend this protection to logical qubits, e.g., the 17-qubit surface code (35, 40). The low technical overhead and scalability of HMMs are attractive for performing leakage detection and correction in real time using the same parity outcomes as traditionally used to correct qubit errors only.

MATERIALS AND METHODS

Device

Our quantum processor (fig. S1) follows a three-qubit–frequency extensible layout with nearest-neighbor interactions that is designed for the surface code (41). Our chip contains low- and high-frequency data qubits (QDL and QDH) and an intermediate-frequency ancilla (QA). SQ gates around axes in the equatorial plane of the Bloch sphere are performed via a dedicated microwave drive line for each qubit. Two-qubit interactions between nearest neighbors are mediated by a dedicated bus resonator (extensible to four per qubit) and controlled by individual tuning of qubit transition frequencies via dedicated flux-bias lines (42). For measurement, each qubit is dispersively coupled to a dedicated RR, which is itself connected to a common feedline via a dedicated PR. The RR-PR pairs allow frequency-multiplexed readout of selected qubits with negligible backaction on untargeted qubits (8).

Hidden Markov models

HMMs provide an efficient tool for indirect inference of the state of a system given a set of output data (36). An HMM describes a time-dependent system as evolving between a set of Nh hidden states {h} and returning one of No outputs {o} at each timestep m. The evolution is stochastic: the system state H[m] of the system at timestep m depends probabilistically on the state H[m − 1] at the previous timestep, with probabilities determined by a Nh × Nh transition matrix AAh,h=P(H[m]=h∣H[m−1]=h′)(2)

The user cannot directly observe the system state and must infer it from the outputs O[m] ∈ {o} at each timestep m. This output is also stochastic: O[m] depends on H[m] as determined by a No × Nh output matrix BBo,h=P(O[m]=o∣H[m]=h)(3)

If the A and B matrices are known, along with the expected distribution π→(prior)[0] of the system state over the Nh possibilitiesπh(prior)[1]=P(H[1]=h)(4)one may simulate the experiment by generating data according to the above rules. Moreover, given a vector o→ of observations, we may calculate the distribution π→[m] over the possible states at a later time mπh(post)[m]=P(H[m]=h∣O [1]=o1,…,O [m]=om)(5)by interleaving rounds of Markovian evolutionπh(prior)[m]≔P(H[m]=n∣O [1]=o1,…,O [m−1]=om−1)(6)=∑h′Ah,h′πh′(post)[m−1](7)and Bayesian updateπh(post)[m]=Bom,h πh(prior)[m]∑h′Bom,h′πh′(prior)[m](8)

HMMs for QEC experiments

To maximize the discrimination ability of HMMs in the various settings studied in this work, we choose different quantities to use for our output vectors o→. In all experiments in this work, the signature of a leaked ancilla is repeated MA[m] = −1, and so, we choose o→=M→A. By contrast, the signature of leaked data qubits in both experiments may be seen as an increased error rate in their corresponding syndromes sD→, and we choose o→=sD→ for the corresponding HMMs.

One may predict the computational likelihood for data-qubit (D) leakage at timestep M in the ZZ-check experiment given π→(M). In particular, once we have declared which states h correspond to leakage, we may writeLcomp,D=∑h unleakedπh(post)[M](9)

However, in the repeated ZZ-check experiment, the ancilla (A) needs to be within the computational subspace for two rounds to perform a correct parity measurement. Therefore, the computational likelihood is slightly more complicated to calculateLcomp,A[M]=∑h,h′ unleaked Bom,h Ah,h′πh′(post)[M−1]∑h,h′ Bom,hAh,h′πh′(post)[M−1](10)

In the interleaved ZZ- and XX-check experiment, the situation is more complicated as we require data from the final two parity checks to fully characterize the quantum state. This implies that we need unleaked data qubits for the last two rounds and unleaked ancillas for the last three. The likelihood of the latter may be calculated by similar means to the above.

Simplest models for leakage discrimination

One need not capture the full dynamics of the quantum system in an HMM to infer whether a qubit is leaked. This is of critical importance if we wish to extend this method for the purposes of leakage mitigation in a large QEC code (as we discuss in the Supplementary Materials). The simplest possible HMM (Fig. 3A) has two hidden states: H[m] = 1 if the qubit(s) in question are within the computational subspace and H[m] = 2 if QA (or either data qubit) is leaked. The labels 1 and 2 are arbitrary here and explicitly have no correlation with the qubit states ∣1⟩ and ∣2⟩. Then, the 2 × 2 transition matrix simply captures the leakage and seepage rates of the system in questionA=(1001)+pleak(−1010)+pseep(010−1)(11)

The 2 × 2 output matrices then capture the different probabilities of seeing output O[m] = 0 or O[m] = 1 when the qubit(s) are leaked or unleakedB=(1001)+p0,1(−1010)+p1,0(010−1)(12)

When studying data-qubit leakage, p0,1 simply captures the rate of errors within the computational subspace. Then, in the repeated ZZ-check experiment, p1,0 captures events such as ancilla or measurement errors that cancel the error signal of a leakage event. However, in the interleaved ZZ and XX experiments, a leaked qubit causes the syndrome to be random, so we expect p1,0 ∼ 0.5. When studying ancilla leakage, p1,0 is simply the probability of ∣2⟩ state being read out as ∣0⟩ and is also expected to be close to 0. However, p0,1 ∼ 0.5, as we do not reset QA or the logical state between rounds of measurement, and thus, any measurement in isolation is roughly equally likely to be 0 or 1. In all situations, we assume that the system begins in the computational subspace—πn(0) = δn,0. With this fixed, we may choose the parameters pleak, pseep, p0,1, and p1,0 to maximize the likelihood L({o→}) of observing the recorded experimental data {o}. Note that L({o→}) is not the computational likelihood Lcomp,Q.

Modeling additional noise

The simple model described above does not completely capture all of the details of the stabilizer measurements M→A. For example, the data-qubit HMM will overestimate the leakage likelihood when an ancilla error occurs, as this gives a signal with a time correlation that is unaccounted for. As the signature of a leakage event in a fully fault-tolerant code will be large (see the Supplementary Materials), we expect these details to not significantly hinder the simple HMM in a large-scale QEC simulation. However, this lack of accuracy makes evaluating HMM performance somewhat difficult, as internal metrics may not be so trustworthy. We also risk overestimating the HMM performance in our experiment, as our only external metrics for success (e.g., fidelity) do just as poorly when errors occur near the end of the experiment as they do when leakage occurs. Therefore, we extend the set of hidden states in the HMMs to account for ancilla and measurement errors and to allow the ancilla HMM to keep track of the stabilizer state. To attach physical relevance to the states in our Markovian model, and to limit ourselves to the noise processes that we expect to be present in the system, we generalize Eqs. 11 and 12 to a linearly parametrized modelA=A0+∑errperrDerr(A), B=B0+∑errperrDerr(B)(13)

Here, we choose the matrices Di(A) and Di(B) such that the error rates pi(A),pi(B) correspond to known physical processes. [We add the superscripts (A) and (B) here to the D matrices to emphasize that each error channel only appears in one of the two above equations.]

The error generators D(A) and D(B) may be identified as derivatives of A with respect to these error ratesDi(A)=∂A∂pi(A),  Di(B)=∂B∂pi(B)(14)

This may be extended to calculate derivatives of the likelihood L({o→}) (or more practically, the log-likelihood) with respect to the various parameters pi. This allows us to obtain the maximum likelihood model within our parametrization via gradient descent methods [in particular the Newton-Conjugate Gradient (CG) method] instead of resorting to more complicated optimization algorithms such as the Baum-Welch algorithm (36). All models were averaged over between 10 and 20 optimizations using the Newton-CG method in SciPy (43), calculating likelihoods, gradients, and Hessians over 10,000 to 20,000 experiments per iteration and rejecting any failed optimizations. As the signal of ancilla leakage is identical to the signal for even ZZ and XX parities with ancilla in ∣1⟩ and no errors, we find that the optimization is unable to accurately estimate the ancilla leakage rate, and so, we fix this in accordance with independent calibration to 0.0040 per round using averaged homodyne detection of ∣2⟩ (making use of a slightly different homodyne voltage for ∣1⟩ and ∣2⟩).

HMMs used in Figs. 2 and 4

Different Markov models (with independently optimized parameters) were used to optimize ancilla and data-qubit leakage estimation for both the ZZ experiment and the experiment interleaving ZZ and XX checks. This leads to a total of four HMMs, which we label HZZ-D, HZZ-A, HZZ, XX-D, and HZZ, XX-A. A complete list of parameter values used in each HMM is given in Table 1. We now describe the features captured by each HMM. As we show in the Supplementary Materials, these additional features are not needed to increase the error mitigation performance of the HMMs but rather to ensure their closeness to the experiment and increase trust in their internal metrics.

To go beyond the simple HMM in the ZZ-check experiment when modeling data-qubit leakage (HZZ-D), we need to include additional states to account for the correlated signals of ancilla and readout errors. If we assume data-qubit errors (that remain within the logical subspace) are uncorrelated in time, then they are already well captured in the simple model. This is because any single error on a data qubit may be decomposed into a combination of Z errors (which commute with the measurement and thus are not detected) and X errors (which anticommute with the measurement and thus produce a single error signal sD[m] = 1) and is thus captured by the p0,1 parameter. When one of the data qubits is leaked, uncorrelated X errors on the other data qubit cancel the constant sD[m] = −1 signal for a single round and are thus captured by the p1,0 parameter. However, errors on the ancilla, and readout errors, give error signals that are correlated in time (separated by one or two timesteps, respectively). This may be accounted for by including extra “ancilla error states.” These may be most easily labeled by making the h labels a tuple h = (h0, h1), where h0 keeps track of whether or not the qubit is leaked, and h1 = 1,2,3 keeps track of whether or not a correlated error has occurred. In particular, we encode the future syndrome for 2 cycles in the absence of error on h1, allowing us to account for any correlations up to two rounds in the future. This extends the model to a total of 4 × 2 = 8 states. The transition and output matrices in the absence of error for the unleaked h0 = 0 states may then be written in a compact form (noting that leakage errors cancel out with correlated ancilla and readout errors to give sD[m] = +1)[A0](h0,h1//2),(h0,h1)=1,  [B0]−1h0+h1,(h0,h1)=1(15)where the double slash // refers to integer division.

Let us briefly demonstrate how the above works for an ancilla error in the system. Suppose the system was in the state h = (0,3) at time m, it would output MA[m] = −1 and then evolve to h = (0,3//2) = (0,1) at time m + 1 (in the absence of additional error). Then, it would output a second error signal [MA[m + 1] = −1] and lastly decay back to the h = (0,1//2) = (0,0) state. This gives the HMM the ability to model the ancilla error as an evolution from h = (0,0) to h(0,3). Formally, we assign the matrix Dancilla(A) to this error process, and following this argument, we have[Dancilla(A)](0,0),(0,0)=−1,  [Dancilla(A)](0,3),(0,0)=1(16)

The corresponding error rate pancilla is then an additional free parameter to be optimized to maximize the likelihood. To finish the characterization of this error channel, we need to consider the effect of the ancilla error in states other than h = (0,0). Two ancilla errors in the same timestep cancel, but two ancilla errors in subsequent timesteps will cause the signature sD = …, −1, +1, −1, …. This may be captured by an evolution from h = (0,2) to h = (0,3) [instead of h = (0,1)], which implies that we should set[Dancilla(A)](0,1),(0,3)=−1,  [Dancilla(A)](0,2),(0,3)=1(17)

[Note that A0 already captures a decay from h = (0,2) → (0,1) → (0,0), which will give the desired signal.] We note that this also matches the signature of readout error, which can then be captured by a separate error channel Dreadout(A) which increases this correlation[Dreadout(A)](0,1),(0,2)=−1,  [Dreadout(A)](0,3),(0,2)=1(18)

One can then check that ancilla errors in h = (0,3) should cause the system to remain in h = (0,3) and that ancilla or readout errors in h = (0,1) should evolve the system to h = (0,2). We note that this model cannot account for the sD = … −1, +1, +1, +1, −1 signature of readout error at time m and m + 2, but adjusting the model to include this has negligible effect.

An ancilla error in the ZZ-check experiment when the data qubits are leaked has the same correlated behavior as when they are not but may occur at a different rate. This requires that we define a new matrix Dancilla,leaked(A) by[Dancilla,leaked(A)](1,j),(1,k)=[Dancilla(A)](0,j),(0,k)(19)with a separate error rate pancilla,leaked. As we do not expect the readout of the ancilla to be significantly affected by whether the data qubit is leaked, we do not add an extra parameter to account for this behavior and instead simply set[Dreadout(A)](1,j),(1,k)=[Dreadout(A)](0,j),(0,k)(20)

We also assume that leakage pleak and seepage pseep rates are independent of these correlated errors (i.e., [Dleak(A)](0,j),(0,k),[Dseep(A)](1,j),(1,k)]∈{0,−1}). We then assume that the first measurement made following a leakage/seepage event is just as likely to have an additional error [corresponding to an evolution to (h0,1)] or not [corresponding to an evolution to (h0,0)]. We lastly account for data-qubit error in the output matrices in the same way as in the simple model but with different error rates pdata,leaked for the leaked states (1, h1) and pdata for the unleaked states (0, h1).

There are a few key differences between the interleaved ZZ-XX and ZZ experiments that need to be captured in the data-qubit HMM HZZ,XX-D. First, as the syndrome is now given by sD[m] = MA[m] · MA[m − 1] · MA[m − 2] · MA[m − 3], ancilla and classical readout errors can then generate a signal stretching up to four steps in time. This implies that we require 24 possibilities for h1 to keep track of all correlations. However, as a leaked data qubit makes ancilla output random in principle, we no longer need to keep track of the ancilla output upon leakage. This implies that we can accurately model the experiment with 16 + 1 = 17 states, which we can label by h ∈ {2, (1, h1)}. The A0 and B0 matrices in the unleaked states (1, h1) follow Eq. 15, anwd we fix [A0]2,2 = 1 (as in the absence of pseep, a leaked state stays leaked). However, we allow for some bias in the leaked state error rate—B−1,2 = pdata,leaked is not fixed to 0.5. For example, this accounts for a measurement bias toward a single state, which will reduce the error rate below 0.5. The nonzero elements in the matrices Dancilla(A) and Dreadout(A) may be written[Dancilla(A)](1,h1//2),(1,h1)=−1,  [Dancilla(A)](1,h1//2⊕5)=1(21)[Dreadout(A)](1,h1//2),(1,h1)=−1,  [Dreadout(A)](1,h1//2⊕15)=1(22)

Here, a ⊕ b refers to the addition of each binary digit of a and b modulo 2. We may use this formalism to additionally keep track of Y data-qubit errors, which show up as correlated errors on subsequent XX and ZZ stabilizer checks, by introducing a new error channel[Ddata,Y(A)](1,h1//2),(1,h1)=−1,  [Ddata,Y(A)](1,h1//2⊕3)=1(23)with a corresponding error rate pdata,Y. As before, we assume that leakage occurs at a rate pleak independently of h1 and that seepage takes the system either to the state with either no error signal h = (1,0) or one error signal h = (0,1) with a rate pseep.

As the output used for the HZZ-A HMM is the pure measurement outcome MA, the dominant signal that must be accounted for is that of the stabilizer ZZ itself. This causes either a constant signal MA[m] = MA[m − 1] or a constant flipping signal MA[m] = −MA[m − 1]. This cannot be accounted for in the simple HMM, as it cannot contain any history in a single unleaked state. To deal with this, we extend the set of states in the HZZ-A HMM to include both an estimate of the ancilla state a ∈ {0,1,2} at the point of measurement and the stabilizer state s ∈ {0,1} and label the states by the tuple (a, s). The ancilla state then immediately defines the device output in the absence of any error[B0]1,(0,s)=[B0]−1,(1,s)=[B0]−1,(2,s)=1(24)while the stabilizer state defines the transitions in the absence of any error or leakage[A0](a+s mod 2,s)(a,s)=1 if a<2,  [A0](2,s),(2,s)=1(25)

The only thing that affects the output matrices is readout error[Dreadout(B)]1,(0,s)=[Dreadout(B)]−1,(1,s)=[Dreadout(B)]−1,(2,s)=−1(26)[Dreadout(B)]−1,(0,s)=[Dreadout(B)]1,(1,s)=[Dreadout(B)]1,(2,s)=1(27)

Data-qubit errors flip the stabilizer with probability pdata[Ddata(A)](a,s),(a′,s)=−[A0](a,s),(a′,s),  [Ddata(A)](a,s),(a′,1−s)=[A0](a,s),(a′,s)(28)

Ancilla errors flip the ancilla with probability pancilla, but these are dominated by T1 decay and so are highly asymmetric. To account for this, we used different error rates panc,a,a′ for the four possible combinations of ancilla measurement at time m − 1 and expected ancilla measurement at time m[Danc,a,a′(A)](a,s)(a′,s)=−[A0](a,s),(a′,s), [Danc,a,a′(A)](a+1 mod 2,s)(a′,s)=−[A0](a,s),(a′,s)(29)

(Note that this asymmetry could not be accounted for in the data-qubit HMM as the state of the ancilla was not contained within the output vector.) As with the data-qubit HMMs, we assume that ancilla leakage is HMM state independent, as it is dominated by CZ gates during the time that the ancilla is either in ∣+⟩ or ∣−⟩. We also assume that leakage (with rate pleak) and seepage (with rate pseep) have equal chances to flip the stabilizer state, as ancilla leakage has a good chance to cause additional error on the data qubits.

The ancilla-qubit HMMs need little adjustment between the ZZ-check experiment and the experiment interleaving ZZ and XX checks. The HZZ,XX-A HMM behaves almost identically to the HZZ-A HMM, but we include in the state information on the XX stabilizer and the ZZ stabilizer. This leaves the states indexed as (a, s1, s2). The HMM needs to also keep track of which stabilizer is being measured. This may be achieved by shuffling the stabilizer labels at each timestep: For a = 0,1, we set[A0](a+s1 mod 2,s2,s1)(a,s1,s2)=1(30)

Other than this, the HMM follows the same equations as above (with the additional index added as expected).

Uncertainty calculations

All quoted uncertainties are an estimation of SEM. SEMs for the independent device characterizations (see the “Generating entanglement by measurement” section and table S1) are either obtained from at least three individually fitted repeated experiments (T2echo, T1, T2*, η, ea, ea,ZZ) or in the case that the quantitiy is only measured once (eSQ, eCZ, L1), the SEM is estimated from least-squares fitting by the LmFit fitting module using the covariance matrix (44).

SEMs in the first-round Bell-state fidelities (Fig. 1 and fig. S6 and see the “Generating entanglement by measurement,” “Protecting entanglement from bit flips and the observation of leakage,” “Leakage detection using HMMs,” and “Protecting entanglement from general qubit errors and mitigation of leakage” sections) are obtained through bootstrapping. For bootstrapping, a dataset (in total 4096 runs with each 36 tomographic elements and 28 calibration points) is subdivided into four subsets, and tomography is performed on each of these subsets individually. As verification, subdivision was performed with eight subsets leading to similar SEMs. SEMs in the multiround experiment parameters (steady-state fidelities and decay constants) are also estimated from least-squares fitting by the LmFit fitting module using the covariance matrix (see the “Protecting entanglement from bit flips and the observation of leakage,” “Leakage detection using HMMs,” and “Protecting entanglement from general qubit errors and mitigation of leakage” sections) (44).

SUPPLEMENTARY MATERIALS

Supplementary material for this article is available at http://advances.sciencemag.org/cgi/content/full/6/12/eaay3050/DC1

Supplementary Materials and Methods

Supplementary Text

Fig. S1. Quantum processor.

Fig. S2. Complete wiring diagram of electronic components inside and outside the 3He/4He dilution refrigerator (Leiden Cryogenics CF-CS81).

Fig. S3. Study of data-qubit coherence and phase accrual during ancilla measurement.

Fig. S4. Quantum circuit for Bell-state idling experiments under dynamical decoupling.

Fig. S5. Postselected fractions for the “no error” conditioning in Figs. 2 and 4.

Fig. S6. Generating entanglement by sequential ZZ and XX parity measurements and PFU.

Fig. S7. ROCs for mitigation of data-qubit and ancilla leakage during interleaved ZZ and XX checks.

Fig. S8. Comparison of experimental data and no-leakage modeling of the repeated parity check experiments of Figs. 2 and 4.

Fig. S9. Leakage mitigation for the repeated parity check experiments as a function of the chosen threshold.

Fig. S10. Leakage mitigation for the simple, two-state HMMs for repeated parity check experiments as a function of the chosen threshold.

Fig. S11. ROCs for leakage mitigation as in fig. S7 but using simple two-state HMMs.

Table S1. Measured parameters of the three-transmon device.

References (45–51)

This is an open-access article distributed under the terms of the Creative Commons Attribution-NonCommercial license, which permits use, distribution, and reproduction in any medium, so long as the resultant use is not for commercial advantage and provided the original work is properly cited.

REFERENCES AND NOTES

  1. ↵
    1. B. M. Terhal
    , Quantum error correction for quantum memories. Rev. Mod. Phys. 87, 307–346 (2015).
    OpenUrl
  2. ↵
    1. R. Barends,
    2. J. Kelly,
    3. A. Megrant,
    4. A. Veitia,
    5. D. Sank,
    6. E. Jeffrey,
    7. T. C. White,
    8. J. Mutus,
    9. A. G. Fowler,
    10. B. Campbell,
    11. Y. Chen,
    12. Z. Chen,
    13. B. Chiaro,
    14. A. Dunsworth,
    15. C. Neill,
    16. P. O’Malley,
    17. P. Roushan,
    18. A. Vainsencher,
    19. J. Wenner,
    20. A. N. Korotkov,
    21. A. N. Cleland,
    22. J. M. Martinis
    , Superconducting quantum circuits at the surface code threshold for fault tolerance. Nature 508, 500–503 (2014).
    OpenUrlCrossRefPubMedWeb of Science
  3. ↵
    1. T. P. Harty,
    2. D. T. C. Allcock,
    3. C. J. Ballance,
    4. L. Guidoni,
    5. H. A. Janacek,
    6. N. M. Linke,
    7. D. N. Stacey,
    8. D. M. Lucas
    , High-fidelity preparation, gates, memory, and readout of a trapped-ion quantum bit. Phys. Rev. Lett. 113, 220501 (2014).
    OpenUrlCrossRefPubMed
  4. ↵
    1. C. J. Ballance,
    2. T. P. Harty,
    3. N. M. Linke,
    4. M. A. Sepiol,
    5. D. M. Lucas
    , High-fidelity quantum logic gates using trapped-ion hyperfine qubits. Phys. Rev. Lett. 117, 060504 (2016).
    OpenUrl
  5. ↵
    1. M. A. Rol,
    2. F. Battistel,
    3. F. K. Malinowski,
    4. C. C. Bultink,
    5. B. M. Tarasinski,
    6. R. Vollmer,
    7. N. Haider,
    8. N. Muthusubramanian,
    9. A. Bruno,
    10. B. M. Terhal,
    11. L. DiCarlo
    , A fast, low-leakage, high-fidelity two-qubit gate for a programmable superconducting quantum computer. Phys. Rev. Lett. 123, 120502 (2019).
    OpenUrl
  6. ↵
    1. E. Jeffrey,
    2. D. Sank,
    3. J. Y. Mutus,
    4. T. C. White,
    5. J. Kelly,
    6. R. Barends,
    7. Y. Chen,
    8. Z. Chen,
    9. B. Chiaro,
    10. A. Dunsworth,
    11. A. Megrant,
    12. P. J. J. O’Malley,
    13. C. Neill,
    14. P. Roushan,
    15. A. Vainsencher,
    16. J. Wenner,
    17. A. N. Cleland,
    18. J. M. Martinis
    , Fast accurate state measurement with superconducting qubits. Phys. Rev. Lett. 112, 190504 (2014).
    OpenUrlCrossRefPubMed
  7. ↵
    1. C. C. Bultink,
    2. M. A. Rol,
    3. T. E. O’Brien,
    4. X. Fu,
    5. B. C. S. Dikken,
    6. C. Dickel,
    7. R. F. L. Vermeulen,
    8. J. C. de Sterke,
    9. A. Bruno,
    10. R. N. Schouten,
    11. L. DiCarlo
    , Active resonator reset in the nonlinear dispersive regime of circuit QED. Phys. Rev. Appl. 6, 034008 (2016).
    OpenUrl
  8. ↵
    1. J. Heinsoo,
    2. C. K. Andersen,
    3. A. Remm,
    4. S. Krinner,
    5. T. Walter,
    6. Y. Salathé,
    7. S. Gasparinetti,
    8. J.-C. Besse,
    9. A. Potočnik,
    10. A. Wallraff,
    11. C. Eichler
    , Rapid high-fidelity multiplexed readout of superconducting qubits. Phys. Rev. Appl. 10, 034040 (2018).
    OpenUrl
  9. ↵
    1. R. Raussendorf,
    2. J. Harrington
    , Fault-tolerant quantum computation with high threshold in two dimensions. Phys. Rev. Lett. 98, 190504 (2007).
    OpenUrlCrossRefPubMed
  10. ↵
    1. A. G. Fowler,
    2. M. Mariantoni,
    3. J. M. Martinis,
    4. A. N. Cleland
    , Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012).
    OpenUrlCrossRef
  11. ↵
    1. H. Bombin,
    2. M. A. Martin-Delgado
    , Topological computation without braiding. Phys. Rev. Lett. 98, 160502 (2007).
    OpenUrlCrossRefPubMed
  12. ↵
    1. N. C. Brown,
    2. K. R. Brown
    , Comparing zeeman qubits to hyperfine qubits in the context of the surface code: 174Yb+ and 171Yb+. Phys. Rev. A 97, 052301 (2018).
    OpenUrl
  13. ↵
    1. R. W. Andrews,
    2. C. Jones,
    3. M. D. Reed,
    4. A. M. Jones,
    5. S. D. Ha,
    6. M. P. Jura,
    7. J. Kerckhoff,
    8. M. Levendorf,
    9. S. Meenehan,
    10. S. T. Merkel,
    11. A. Smith,
    12. B. Sun,
    13. A. J. Weinstein,
    14. M. T. Rakher,
    15. T. D. Ladd,
    16. M. G. Borselli
    , Quantifying error and leakage in an encoded Si/SiGe triple-dot qubit. Nat. Nanotechnol. 14, 747–750 (2019).
    OpenUrl
  14. ↵
    1. P. Aliferis,
    2. B. M. Terhal
    , Fault-tolerant quantum computation for local leakage faults. Quant. Info. Comp. 7, 139–156 (2007).
    OpenUrl
  15. ↵
    1. A. G. Fowler
    , Coping with qubit leakage in topological codes. Phys. Rev. A 88, 042308 (2013).
    OpenUrl
  16. ↵
    1. J. Ghosh,
    2. A. G. Fowler
    , Leakage-resilient approach to fault-tolerant quantum computing with superconducting elements. Phys. Rev. A 91, 020302 (2015).
    OpenUrl
  17. ↵
    1. M. Suchara,
    2. A. W. Cross,
    3. J. M. Gambetta
    , Leakage suppression in the toric code. Quant. Info. Comp. 15, 997–1016 (2015).
    OpenUrl
  18. ↵
    1. N. C. Brown,
    2. M. Newman,
    3. K. R. Brown
    , Handling leakage with subsystem codes. New. J. Phys. 21, 073055 (2019).
    OpenUrl
  19. ↵
    1. Z. Cai,
    2. M. A. Fogarty,
    3. S. Schaal,
    4. S. Patomaki,
    5. S. C. Benjamin,
    6. J. J. L. Morton
    , A silicon surface code architecture resilient against leakage errors. Quantum 3, 212 (2019).
    OpenUrl
  20. ↵
    1. D. Ristè,
    2. M. Dukalski,
    3. C. A. Watson,
    4. G. de Lange,
    5. M. J. Tiggelman,
    6. Y. M. Blanter,
    7. K. W. Lehnert,
    8. R. N. Schouten,
    9. L. DiCarlo
    , Deterministic entanglement of superconducting qubits by parity measurement and feedback. Nature 502, 350–354 (2013).
    OpenUrlCrossRefPubMed
  21. ↵
    1. Y. Liu,
    2. S. Shankar,
    3. N. Ofek,
    4. M. Hatridge,
    5. A. Narla,
    6. K. M. Sliwa,
    7. L. Frunzio,
    8. R. J. Schoelkopf,
    9. M. H. Devoret
    , Comparing and combining measurement-based and driven-dissipative entanglement stabilization. Phys. Rev. X 6, 011022 (2016).
    OpenUrl
    1. A. D. Córcoles,
    2. E. Magesan,
    3. S. J. Srinivasan,
    4. A. W. Cross,
    5. M. Steffen,
    6. J. M. Gambetta,
    7. J. M. Chow
    , Demonstration of a quantum error detection code using a square lattice of four superconducting qubits. Nat. Commun. 6, 6979 (2015).
    OpenUrlCrossRefPubMed
    1. D. Ristè,
    2. S. Poletto,
    3. M. Z. Huang,
    4. A. Bruno,
    5. V. Vesterinen,
    6. O. P. Saira,
    7. L. DiCarlo
    , Detecting bit-flip errors in a logical qubit using stabilizer measurements. Nat. Commun. 6, 6983 (2015).
    OpenUrlCrossRefPubMed
  24. ↵
    1. J. Kelly,
    2. R. Barends,
    3. A. Fowler,
    4. A. Megrant,
    5. E. Jeffrey,
    6. T. White,
    7. D. Sank,
    8. J. Y. Mutus,
    9. B. Campbell,
    10. Y. Chen,
    11. B. Chiaro,
    12. A. Dunsworth,
    13. I.-C. Hoi,
    14. C. Neill,
    15. P. J. J. O’Malley,
    16. C. Quintana,
    17. P. Roushan,
    18. A. Vainsencher,
    19. J. Wenner,
    20. A. N. Cleland,
    21. J. M. Martinis
    , State preservation by repetitive error detection in a superconducting quantum circuit. Nature 519, 66–69 (2015).
    OpenUrlCrossRefPubMed
    1. M. Takita,
    2. A. D. Córcoles,
    3. E. Magesan,
    4. B. Abdo,
    5. M. Brink,
    6. A. Cross,
    7. J. M. Chow,
    8. J. M. Gambetta
    , Demonstration of weight-four parity measurements in the surface code architecture. Phys. Rev. Lett. 117, 210505 (2016).
    OpenUrl
    1. M. Takita,
    2. A. W. Cross,
    3. A. D. Córcoles,
    4. J. M. Chow,
    5. J. M. Gambetta
    , Experimental demonstration of fault-tolerant state preparation with superconducting qubits. Phys. Rev. Lett. 119, 180501 (2017).
    OpenUrlCrossRefPubMed
    1. R. Harper,
    2. S. T. Flammia
    , Fault-tolerant logical gates in the ibm quantum experience. Phys. Rev. Lett. 122, 080504 (2019).
    OpenUrl
  28. ↵
    1. C. K. Andersen,
    2. A. Remm,
    3. S. Balasiu,
    4. S. Krinner,
    5. J. Heinsoo,
    6. J.-C. Besse,
    7. M. Gabureac,
    8. A. Wallraff,
    9. C. Eichler
    , Entanglement stabilization using parity detection and real-time feedback in superconducting circuits. npj Quantum Inf. 5, 69 (2019).
    OpenUrl
  29. ↵
    1. N. Ofek,
    2. A. Petrenko,
    3. R. Heeres,
    4. P. Reinhold,
    5. Z. Leghtas,
    6. B. Vlastakis,
    7. Y. Liu,
    8. L. Frunzio,
    9. S. M. Girvin,
    10. L. Jiang,
    11. M. Mirrahimi,
    12. M. H. Devoret,
    13. R. J. Schoelkopf
    , Extending the lifetime of a quantum bit with error correction in superconducting circuits. Nature 536, 441–445 (2016).
    OpenUrlCrossRefPubMed
  30. ↵
    1. L. Hu,
    2. Y. Ma,
    3. W. Cai,
    4. X. Mu,
    5. Y. Xu,
    6. W. Wang,
    7. Y. Wu,
    8. H. Wang,
    9. Y. P. Song,
    10. C.-L. Zou,
    11. S. M. Girvin,
    12. L.-M. Duan,
    13. L. Sun
    , Quantum error correction and universal gate set operation on a binomial bosonic logical qubit. Nat. Phys. 15, 503–508 (2019).
    OpenUrl
  31. ↵
    1. V. Negnevitsky,
    2. M. Marinelli,
    3. K. K. Mehta,
    4. H.-Y. Lo,
    5. C. Flühmann,
    6. J. P. Home
    , Repeated multi-qubit readout and feedback with a mixed-species trapped-ion register. Nature 563, 527–531 (2018).
    OpenUrl
  32. ↵
    1. E. Knill
    , Quantum computing with realistically noisy devices. Nature 434, 39–44 (2005).
    OpenUrlCrossRefPubMed
  33. ↵
    1. O.-P. Saira,
    2. J. P. Groen,
    3. J. Cramer,
    4. M. Meretska,
    5. G. de Lange,
    6. L. DiCarlo
    , Entanglement genesis by ancilla-based parity measurement in 2D circuit QED. Phys. Rev. Lett. 112, 070502 (2014).
    OpenUrl
  34. ↵
    1. D. T. McClure,
    2. H. Paik,
    3. L. S. Bishop,
    4. M. Steffen,
    5. J. M. Chow,
    6. J. M. Gambetta
    , Rapid driven reset of a qubit readout resonator. Phys. Rev. Appl. 5, 011001 (2016).
    OpenUrl
  35. ↵
    1. T. O’Brien,
    2. B. Tarasinski,
    3. L. DiCarlo
    , Density-matrix simulation of small surface codes under current and projected experimental noise. npj Quantum Inf. 3, 39 (2017).
    OpenUrl
  36. ↵
    1. L. Baum,
    2. T. Petrie
    , Statistical inference for probabilistic functions of finite state markov chains. Ann. Math. Stat. 37, 1554–1563 (1966).
    OpenUrl
  37. ↵
    1. H. Akaike
    , A new look at the statistical model identification. IEEE Trans. Autom. Control 19, 716–723 (1974).
    OpenUrlCrossRef
  38. ↵
    D. M. Green, J. A. Swets, Signal Detection Theory and Psychophysics (John Wiley & Sons, 1966).
  39. ↵
    1. P. Magnard,
    2. P. Kurpiers,
    3. B. Royer,
    4. T. Walter,
    5. J.-C. Besse,
    6. S. Gasparinetti,
    7. M. Pechal,
    8. J. Heinsoo,
    9. S. Storz,
    10. A. Blais,
    11. A. Wallraff
    , Fast and unconditional all-microwave reset of a superconducting qubit. Phys. Rev. Lett. 121, 060502 (2018).
    OpenUrlCrossRefPubMed
  40. ↵
    1. Y. Tomita,
    2. K. M. Svore
    , Low-distance surface codes under realistic quantum noise. Phys. Rev. A 90, 062320 (2014).
    OpenUrl
  41. ↵
    1. R. Versluis,
    2. S. Poletto,
    3. N. Khammassi,
    4. B. Tarasinski,
    5. N. Haider,
    6. D. J. Michalak,
    7. A. Bruno,
    8. K. Bertels,
    9. L. DiCarlo
    , Scalable quantum circuit and control for a superconducting surface code. Phys. Rev. Appl. 8, 034021 (2017).
    OpenUrl
  42. ↵
    1. L. DiCarlo,
    2. J. M. Chow,
    3. J. M. Gambetta,
    4. L. S. Bishop,
    5. B. R. Johnson,
    6. D. I. Schuster,
    7. J. Majer,
    8. A. Blais,
    9. L. Frunzio,
    10. S. M. Girvin,
    11. R. J. Schoelkopf
    , Demonstration of two-qubit algorithms with a superconducting quantum processor. Nature 460, 240–244 (2009).
    OpenUrlCrossRefPubMedWeb of Science
  43. ↵
    E. Jones, T. Oliphant, P. Peterson, SciPy: Open source scientific tools for Python (2001); www.scipy.org[Online; accessed 2016-06-14].
  44. ↵
    M. Newville, T. Stensitzki, D. B. Allen, A. Ingargiola, LMFIT: Non-Linear Least-Square Minimization and Curve-Fitting for Python (Astrophysics Source Code Library, 2014).
  45. ↵
    X. Fu, L. Riesebos, M. A. Rol, J. van Straten, J. van Someren, N. Khammassi, I. Ashraf, R. F. L. Vermeulen, V. Newsum, K. K. L. Loh, J. C. de Sterke, W. J. Vlothuizen, R. N. Schouten, C. G. Almudever, L. DiCarlo, K. Bertels, Proceedings of 25th IEEE International Symposium on High-Performance Computer Architecture (HPCA) (IEEE 2019), pp. 224–237.
    1. C. Macklin,
    2. K. O’Brien,
    3. D. Hover,
    4. M. E. Schwartz,
    5. V. Bolkhovsky,
    6. X. Zhang,
    7. W. D. Oliver,
    8. I. Siddiqi
    , A near–quantum-limited josephson traveling-wave parametric amplifier. Science 350, 307–310 (2015).
    OpenUrlAbstract/FREE Full Text
    1. C. C. Bultink,
    2. B. Tarasinski,
    3. N. Haandbaek,
    4. S. Poletto,
    5. N. Haider,
    6. D. J. Michalak,
    7. A. Bruno,
    8. L. DiCarlo
    , General method for extracting the quantum efficiency of dispersive qubit readout in circuit QED. Appl. Phys. Lett. 112, 092601 (2018).
    OpenUrl
    1. E. Magesan,
    2. J. M. Gambetta,
    3. B. R. Johnson,
    4. C. A. Ryan,
    5. J. M. Chow,
    6. S. T. Merkel,
    7. M. P. da Silva,
    8. G. A. Keefe,
    9. M. B. Rothwell,
    10. T. A. Ohki,
    11. M. B. Ketchen,
    12. M. Steffen
    , Efficient measurement of quantum gate error by interleaved randomized benchmarking. Phys. Rev. Lett. 109, 080505 (2012).
    OpenUrlCrossRefPubMed
    1. J. Ghosh,
    2. A. G. Fowler,
    3. J. M. Martinis,
    4. M. R. Geller
    , Understanding the effects of leakage in superconducting quantum-error-detection circuits. Phys. Rev. A 88, 062329 (2013).
    OpenUrl
    1. X. Waintal
    , What determines the ultimate precision of a quantum computer? Phys. Rev. A 99, 042318 (2019).
    OpenUrl
  51. ↵
    The quantumsim package can be found at https://quantumsim.gitlab.io/.
Acknowledgments: We thank W. Oliver and G. Calusine for providing the parametric amplifier; J. van Oven and J. de Sterke for experimental assistance; and F. Battistel, C. Beenakker, C. Eichler, F. Luthi, B. Terhal, and A. Wallraff for discussions. Funding: This research is supported by the Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA), via the U.S. Army Research Office Grant No. W911NF-16-1-0071, and by Intel Corporation. T.E.O. is funded by Shell Global Solutions BV. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the ODNI, IARPA, or the U.S. Government. X.F. was funded by China Scholarship Council (CSC). Author contributions: C.C.B. performed the experiment. R.V. and M.W.B. designed the device with input from C.C.B. and B.T. N.M. and A.B. fabricated the device. T.E.O. devised the HMMs with input from B.T., B.V., and V.O. X.F. and M.A.R. contributed to the experimental setup and tune-up. C.C.B., T.E.O., and L.D.C. co-wrote the manuscript with feedback from all authors. L.D.C. supervised the project. Competing interests: The authors declare that they have no competing interests. Data and materials availability: All data needed to evaluate the conclusions in the paper are present in the paper and/or the Supplementary Materials. Additional data related to this paper may be requested from the authors.
View this article with LENS

Article Tools

My saved folders

Stay Connected to Science Advances

Related Content

Similar Articles in:

Citing Articles in:

Navigate This Article