Recent work has demonstrated that high-threshold quantum error correction is possible for biasednoise qubits, provided that one can implement a controlled-sc not (CX) gate that preserves the bias.Bias-preserving CX gates have been proposed for several biased-noise qubit platforms, most notably Kerr cats.However, experimentally measuring the noise bias is challenging, as it requires accurately estimating certain low-probability Pauli errors in the presence of much larger state-preparation-and-measurement (SPAM) errors.In this paper, we introduce bias-randomized benchmarking (BRB) as a technique for measuring bias in quantum gates.BRB, like all RB protocols, is highly accurate and immune to SPAM errors.Our first protocol, CX-dihedral BRB, is a straightforward method to measure the bias of the entire CX-dihedral group.Our second protocol, interleaved-bias randomized benchmarking (IBRB), is a generalization of interleaved RB tailored to the experimental constraints of biased-noise qubits; this is a more involved procedure that directly targets the bias of the CX gate alone.Our BRB procedures occupy a middle ground between classic RB protocols that only estimate the average fidelity and tomographic RB protocols that provide more detailed characterization of noise but require more measurements as well as experimental capabilities that are not necessarily available in biased-noise qubits.
Recent work has demonstrated that high-threshold quantum error correction is possible for biasednoise qubits, provided that one can implement a controlled-sc not (CX) gate that preserves the bias.Bias-preserving CX gates have been proposed for several biased-noise qubit platforms, most notably Kerr cats.However, experimentally measuring the noise bias is challenging, as it requires accurately estimating certain low-probability Pauli errors in the presence of much larger state-preparation-and-measurement (SPAM) errors.In this paper, we introduce bias-randomized benchmarking (BRB) as a technique for measuring bias in quantum gates.BRB, like all RB protocols, is highly accurate and immune to SPAM errors.Our first protocol, CX-dihedral BRB, is a straightforward method to measure the bias of the entire CX-dihedral group.Our second protocol, interleaved-bias randomized benchmarking (IBRB), is a generalization of interleaved RB tailored to the experimental constraints of biased-noise qubits; this is a more involved procedure that directly targets the bias of the CX gate alone.Our BRB procedures occupy a middle ground between classic RB protocols that only estimate the average fidelity and tomographic RB protocols that provide more detailed characterization of noise but require more measurements as well as experimental capabilities that are not necessarily available in biased-noise qubits.
Accurate benchmarking of quantum gates is crucial for understanding and enhancing the performance of quantum hardware. A standard method for this is interleaved benchmarking, a technique which estimates the error on an interleaved target gate by comparing cumulative error rates of randomized sequences implemented with the interleaved gate and without it. In this work, we show both numerically and experimentally that the standard approach of interleaved randomized benchmarking (IRB), which uses the multi-qubit Clifford group for randomization, can produce highly inaccurate and even physically impossible estimates for the error on the interleaved gate in the presence of coherent errors. Fortunately we also show that interleaved benchmarking performed with cycle benchmarking, which randomizes with single qubit Pauli gates, provides dramatically reduced systematic uncertainty relative to standard IRB, and further provides as host of additional benefits including data reusability. We support our conclusions with a theoretical framework for bounding systematic errors, extensive numerical results comparing a range of interleaved protocols under fixed resource costs, and experimental demonstrations on three quantum computing platforms.
Ubiquitous noise sources in quantum systems remain a key obstacle to building quantum computers, necessitating the use of quantum error correction codes. Recently, error-correcting codes tailored for noise-biased systems have been shown to offer high fault-tolerance thresholds and reduced hardware overhead, positioning noise-biased qubits as promising candidates for building universal quantum computers. However, quantum operations on these platforms remain challenging, and their noise structures have not yet been rigorously benchmarked to the same extent as those of conventional quantum hardware. In this work, we develop a comprehensive quantum control toolbox for a scalable noise-biased qubit, detuned Kerr-cat qubit, including initialization, universal single-qubit gates, and quantum nondemolition readout. We systematically characterize the noise structure of these operations using gate set tomography and dihedral randomized benchmarking, achieving high local gate fidelities, with [Formula: see text] and [Formula: see text]. Notably, the noise bias of the detuned Kerr-cat qubit approaches 250 with a phase-flip time of [Formula: see text], which outperforms its resonant-Kerr-cat qubit counterparts as reported previously, representing a state-of-the-art performance benchmark for Kerr-cat qubits. Moreover, our results reveal a critical overestimation of operational noise bias inferred from bit-flip and phase-flip times alone, highlighting the necessity of a precise and direct benchmarking for noise-biased qubit operations. Our work thus establishes a framework for systematically characterizing and validating the performance of quantum operations in structured-noise architectures, which lays the groundwork for implementing efficient quantum error correction in next-generation architectures.
Qubits with strongly biased noise, in which phase-flip errors are orders of magnitude more frequent than bit-flips, arise both naturally, as in electron and nuclear spins, and by engineering, as in stabilized cat qubits. This noise structure holds the promise of reducing the daunting hardware overhead of fault-tolerant quantum computing, but exploiting it requires physical operations that do not convert frequent phase-flips into rare bit-flips. In this review, we analyze the most prominent fault-tolerant protocols for biased-noise qubits, organized according to the available set of such bias-preserving operations. When this set is restricted to the CZ gate together with preparation and measurement in the X basis, we show that the complexity of the required syndrome extraction gadgets essentially cancels the benefit of the noise bias: at experimentally relevant error rates, one may as well ignore the bias and rely on standard error correction designed for depolarizing noise. The situation changes drastically when a bias-preserving CX gate is available: the hierarchy of errors can then be reflected in the structure of the code, with frequent phase-flips corrected by a dedicated high-threshold code and rare bit-flips by concatenation with a high-rate code. The same hierarchy also enables hardware-efficient preparation of magic states. Finally, as a bias-preserving CX is forbidden in naturally biased platforms and challenging in engineered ones, we present a measurement-based architecture in which a high-fidelity quantum non-demolition readout of multi-qubit Pauli Z operators takes its place, extending these overhead reductions to a much broader range of physical platforms.
The code capacity threshold for error correction using biased-noise qubits is known to be higher than with qubits without such structured noise. However, realistic circuit-level noise severely restricts these improvements. This is because gate operations, such as a controlled-NOT (CX) gate, which do not commute with the dominant error, unbias the noise channel. Here, we overcome the challenge of implementing a bias-preserving CX gate using biased-noise stabilized cat qubits in driven nonlinear oscillators. This continuous-variable gate relies on nontrivial phase space topology of the cat states. Furthermore, by following a scheme for concatenated error correction, we show that the availability of bias-preserving CX gates with moderately sized cats improves a rigorous lower bound on the fault-tolerant threshold by a factor of two and decreases the overhead in logical Clifford operations by a factor of five. Our results open a path toward high-threshold, low-overhead, fault-tolerant codes tailored to biased-noise cat qubits.
Characterization of experimental systems is an essential step in developing and improving quantum hardware. A collection of protocols known as Randomized Benchmarking (RB) was developed in the past decade, which provides an efficient way to measure error rates in quantum systems. In a recent paper (arxiv:2010.07974), a general framework for RB was proposed, which encompassed most of the known RB protocols and overcame the limitation on error models in previous works. However, even this general framework has a restriction: it can only be applied to a finite group of gates. This does not meet the need posed by experiments, in particular the demand for benchmarking non-Clifford gates and continuous gate sets on quantum devices. In this work we generalize the RB framework to continuous groups of gates and show that as long as the noise level is reasonably small, the output can be approximated as a linear combination of matrix exponential decays. As an application, we numerically study the fully randomized benchmarking protocol (i.e. RB with the entire unitary group as the gate set) enabled by our proof. This provides a unified way to estimate the gate fidelity for any quantum gate in an experiment.
Errors are common issues in quantum computing platforms, among which leakage is one of the most-challenging to address. This is because leakage, i.e., the loss of information stored in the computational subspace to undesired subspaces in a larger Hilbert space, is more difficult to detect and correct than errors that preserve the computational subspace. As a result, leakage presents a significant obstacle to the development of fault-tolerant quantum computation. In this paper, we propose an efficient and accurate benchmarking framework called leakage randomized benchmarking (LRB), for measuring leakage rates on multi-qubit quantum systems. Our approach is more insensitive to state preparation and measurement (SPAM) noise than existing leakage benchmarking protocols, requires fewer assumptions about the gate set itself, and can be used to benchmark multi-qubit leakages, which has not been achieved previously. We also extended the LRB protocol to an interleaved variant called interleaved LRB (iLRB), which can benchmark the average leakage rate of generic n-site quantum gates with reasonable noise assumptions. We demonstrate the iLRB protocol on benchmarking generic two-qubit gates realized using flux tuning and analyzed the behavior of iLRB under corresponding leakage models. Our numerical experiments showed good agreement with the theoretical estimations, indicating the feasibility of both the LRB and iLRB protocols.