Randomized Benchmarking Protocol Research Articles

Steane code analysis by randomized benchmarking

Quantum error correction codes (QECC) play a fundamental role in protecting the information processed in today’s noisy quantum computers. To build good error correction schemes, it is essential to understand how noise affects the behavior of these codes. In this research paper, we analyze Steane code, a 7-qubit QECC, using a randomized benchmarking (RB) protocol. With RB protocols, we can partially characterize the quality of implementation of a set of quantum gates. We show a scenario where Steane code with one logical qubit is advantageous compared to the situation with no quantum code. We obtained our results using a quantum simulator with custom noise models considering different numbers of noisy qubits.

A benchmarking procedure for quantum networks

We propose network benchmarking: a procedure to efficiently benchmark the quality of a quantum network link connecting quantum processors in a quantum network. This procedure is based on the standard randomized benchmarking protocol and provides an estimate for the fidelity of a quantum network link. We provide statistical analysis of the protocol as well as a simulated implementation inspired by nitrogen-vacancy center systems using Netsquid, a special purpose simulator for noisy quantum networks.

Enabling Multi-programming Mechanism for Quantum Computing in the NISQ Era

NISQ devices have several physical limitations and unavoidable noisy quantum operations, and only small circuits can be executed on a quantum machine to get reliable results. This leads to the quantum hardware under-utilization issue. Here, we address this problem and improve the quantum hardware throughput by proposing a Quantum Multi-programming Compiler (QuMC) to execute multiple quantum circuits on quantum hardware simultaneously. This approach can also reduce the total runtime of circuits. We first introduce a parallelism manager to select an appropriate number of circuits to be executed at the same time. Second, we present two different qubit partitioning algorithms to allocate reliable partitions to multiple circuits – a greedy and a heuristic. Third, we use the Simultaneous Randomized Benchmarking protocol to characterize the crosstalk properties and consider them in the qubit partition process to avoid the crosstalk effect during simultaneous executions. Finally, we enhance the mapping transition algorithm to make circuits executable on hardware using a decreased number of inserted gates. We demonstrate the performance of our QuMC approach by executing circuits of different sizes on IBM quantum hardware simultaneously. We also investigate this method on VQE algorithm to reduce its overhead.

Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise

The rapid progress in the development of quantum devices is in large part due to the availability of a wide range of characterization techniques allowing to probe, test and adjust them. Nevertheless, these methods often make use of approximations that hold in rather simplistic circumstances. In particular, assuming that error mechanisms stay constant in time and have no dependence in the past, is something that will be impossible to do as quantum processors continue scaling up in depth and size. We establish a theoretical framework for the Randomized Benchmarking protocol encompassing temporally-correlated, so-called non-Markovian noise, at the gate level, for any gate set belonging to a wide class of finite groups. We obtain a general expression for the Average Sequence Fidelity (ASF) and propose a way to obtain average gate fidelities of full non-Markovian noise processes. Moreover, we obtain conditions that are fulfilled when an ASF displays authentic non-Markovian deviations. Finally, we show that even though gate-dependence does not translate into a perturbative term within the ASF, as in the Markovian case, the non-Markovian sequence fidelity nevertheless remains stable under small gate-dependent perturbations.

6-qubit optimal Clifford circuits

Clifford group lies at the core of quantum computation—it underlies quantum error correction, its elements can be used to perform magic state distillation and they form randomized benchmarking protocols, Clifford group is used to study quantum entanglement, and more. The ability to utilize Clifford group elements in practice relies heavily on the efficiency of their circuit-level implementation. Finding short circuits is a hard problem; despite Clifford group being finite, its size grows quickly with the number of qubits n, limiting known optimal implementations to n = 4 qubits. For n = 6, the number of Clifford group elements is about 2.1 × 1023. In this paper, we report a set of algorithms, along with their C++ implementation, that implicitly synthesize optimal circuits for all 6-qubit Clifford group elements by storing a subset of the latter in a database of size 2.1TB (1kB = 1024B). We demonstrate how to extract arbitrary optimal 6-qubit Clifford circuit in 0.0009358 and 0.0006274 s using consumer- and enterprise-grade computers (hardware) respectively, while relying on this database. We use this implementation to establish a new example of quantum advantage by Clifford circuits over CNOT gate circuits and find optimal Clifford 2-designs for up to 4 qubits.

General Framework for Randomized Benchmarking

Randomized benchmarking refers to a collection of protocols that in the past decade have become central methods for characterizing quantum gates. These protocols aim at efficiently estimating the quality of a set of quantum gates in a way that is resistant to state preparation and measurement errors. Over the years many versions have been developed, however a comprehensive theoretical treatment of randomized benchmarking has been missing. In this work, we develop a rigorous framework of randomized benchmarking general enough to encompass virtually all known protocols as well as novel, more flexible extensions. Overcoming previous limitations on error models and gate sets, this framework allows us, for the first time, to formulate realistic conditions under which we can rigorously guarantee that the output of any randomized benchmarking experiment is well described by a linear combination of matrix exponential decays. We complement this with a detailed analysis of the fitting problem associated with randomized benchmarking data. We introduce modern signal processing techniques to randomized benchmarking, prove analytical sample complexity bounds, and numerically evaluate performance and limitations. In order to reduce the resource demands of this fitting problem, we introduce novel, scalable postprocessing techniques to isolate exponential decays, significantly improving the practical feasibility of a large set of randomized benchmarking protocols. These postprocessing techniques overcome shortcomings in efficiency of several previously proposed methods such as character benchmarking and linear-cross entropy benchmarking. Finally, we discuss, in full generality, how and when randomized benchmarking decay rates can be used to infer quality measures like the average fidelity. On the technical side, our work substantially extends the recently developed Fourier-theoretic perspective on randomized benchmarking by making use of the perturbation theory of invariant subspaces, as well as ideas from signal processing.2 MoreReceived 8 December 2020Revised 23 December 2021Accepted 4 March 2022DOI:https://doi.org/10.1103/PRXQuantum.3.020357Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.Published by the American Physical SocietyPhysics Subject Headings (PhySH)Research AreasQuantum benchmarkingQuantum computationQuantum gatesQuantum Information

Estimation of correlations and nonseparability in quantum channels via unitarity benchmarking

The ability to transfer coherent quantum information between systems is a fundamental component of quantum technologies and leads to coherent correlations within the global quantum process. However correlation structures in quantum channels are less studied than those in quantum states. Motivated by recent techniques in randomized benchmarking, we develop a range of results for efficient estimation of correlations within a bipartite quantum channel. We introduce sub-unitarity measures that are invariant under local changes of basis, generalize the unitarity of a channel, and allow for the analysis of coherent information exchange within channels. Using these, we show that unitarity is monogamous, and provide a novel information-disturbance relation. We then define a notion of correlated unitarity that quantifies the correlations within a given channel. Crucially, we show that this measure is strictly bounded on the set of separable channels and therefore provides a witness of non-separability. Finally, we describe how such measures for effective noise channels can be efficiently estimated within different randomized benchmarking protocols. We find that the correlated unitarity can be estimated in a SPAM-robust manner for any separable quantum channel, and show that a benchmarking/tomography protocol with mid-circuit resets can reliably witness non-separability for sufficiently small reset errors. The tools we develop provide information beyond that obtained via simultaneous randomized benchmarking and so could find application in the analysis of cross-talk and coherent errors in quantum devices.

Randomized Benchmarking for Non-Markovian Noise

Estimating the features of noise is the first step in a chain of protocols that will someday lead to fault tolerant quantum computers. The randomized benchmarking (RB) protocol is designed with this exact mindset, estimating the average strength of noise in a quantum processor with relative ease in practice. However, RB, along with most other benchmarking and characterization methods, is limited in scope because it assumes that the noise is temporally uncorrelated (Markovian), which is increasingly evident not to be the case. Here, we combine the RB protocol with a recent framework describing non-Markovian quantum phenomena to derive a general analytical expression of the average sequence fidelity (ASF) for non-Markovian RB with the Clifford group. We show that one can identify non-Markovian features of the noise directly from the ASF through its deviations from the Markovian case, proposing a set of methods to collectively estimate these deviations, non-Markovian memory time-scales, and diagnose (in)coherence of non-Markovian noise in an RB experiment. Finally, we demonstrate the efficacy of our proposal by means of several proof-of-principle examples. Our methods are directly implementable and pave the pathway to better understanding correlated noise in quantum processors.

Clifford Circuit Optimization with Templates and Symbolic Pauli Gates

The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. This group plays a prominent role in quantum error correction, randomized benchmarking protocols, and the study of entanglement. Here we consider the problem of finding a short quantum circuit implementing a given Clifford group element. Our methods aim to minimize the entangling gate count assuming all-to-all qubit connectivity. First, we consider circuit optimization based on template matching and design Clifford-specific templates that leverage the ability to factor out Pauli and SWAP gates. Second, we introduce a symbolic peephole optimization method. It works by projecting the full circuit onto a small subset of qubits and optimally recompiling the projected subcircuit via dynamic programming. CNOT gates coupling the chosen subset of qubits with the remaining qubits are expressed using symbolic Pauli gates. Software implementation of these methods finds circuits that are only 0.2% away from optimal for 6 qubits and reduces the two-qubit gate count in circuits with up to 64 qubits by 64.7% on average, compared with the Aaronson-Gottesman canonical form.

Qutrit Randomized Benchmarking.

Ternary quantum processors offer significant potential computational advantages over conventional qubit technologies, leveraging the encoding and processing of quantum information in qutrits (three-level systems). To evaluate and compare the performance of such emerging quantum hardware it is essential to have robust benchmarking methods suitable for a higher-dimensional Hilbert space. We demonstrate extensions of industry standard randomized benchmarking (RB) protocols, developed and used extensively for qubits, suitable for ternary quantum logic. Using a superconducting five-qutrit processor, we find an average single-qutrit process infidelity of 3.8×10^{-3}. Through interleaved RB, we characterize a few relevant gates, and employ simultaneous RB to fully characterize crosstalk errors. Finally, we apply cycle benchmarking to a two-qutrit CSUM gate and obtain a two-qutrit process fidelity of 0.85. Our results present and demonstrate RB-based tools to characterize the performance of a qutrit processor, and a general approach to diagnose control errors in future qudit hardware.

Character Randomized Benchmarking for Non-Multiplicity-Free Groups With Applications to Subspace, Leakage, and Matchgate Randomized Benchmarking

Randomized benchmarking (RB) is a powerful method for determining the error rate of experimental quantum gates. Traditional RB, however, is restricted to gatesets, such as the Clifford group, that form a unitary 2-design. The recently introduced character RB can benchmark more general gates using techniques from representation theory; up to now, however, this method has only been applied to "multiplicity-free" groups, a mathematical restriction on these groups. In this paper, we extend the original character RB derivation to explicitly treat non-multiplicity-free groups, and derive several applications. First, we derive a rigorous version of the recently introduced subspace RB, which seeks to characterize a set of one- and two-qubit gates that are symmetric under SWAP. Second, we develop a new leakage RB protocol that applies to more general groups of gates. Finally, we derive a scalable RB protocol for the matchgate group, a group that like the Clifford group is non-universal but becomes universal with the addition of one additional gate. This example provides one of the few examples of a scalable non-Clifford RB protocol. In all three cases, compared to existing theories, our method requires similar resources, but either provides a more accurate estimate of gate fidelity, or applies to a more general group of gates. In conclusion, we discuss the potential, and challenges, of using non-multiplicity-free character RB to develop new classes of scalable RB protocols and methods of characterizing specific gates.

On the robustness of the hybrid qubit computational gates through simulated randomized benchmarking protocols

One of the main challenges in building a quantum processor is to characterize the environmental noise. Noise characterization can be achieved by exploiting different techniques, such as randomization where several sequences of random quantum gates are applied to the qubit under test to derive statistical characteristics about the affecting noises. A scalable and robust algorithm able to benchmark the full set of Clifford gates using randomization techniques is called randomized benchmarking. In this study, we simulated randomized benchmarking protocols in a semiconducting all-electrical three-electron double-quantum dot qubit, i.e. hybrid qubit, under different error models, that include quasi-static Gaussian and the more realistic 1/f noise model, for the input controls. The average error of specific quantum computational gates is extracted through interleaved randomized benchmarking obtained including Clifford gates between the gate of interest. It provides an estimate of the fidelity as well as theoretical bounds for the average error of the gate under test.

Benchmarking the noise sensitivity of different parametric two-qubit gates in a single superconducting quantum computing platform

The possibility to utilize different types of two-qubit gates on a single quantum computing platform adds flexibility in the decomposition of quantum algorithms. A larger hardware-native gate set may decrease the number of required gates, provided that all gates are realized with high fidelity. Here, we benchmark both controlled-Z (CZ) and exchange-type (iSWAP) gates using a parametrically driven tunable coupler that mediates the interaction between two superconducting qubits. Using randomized benchmarking protocols we estimate an error per gate of $0.9\pm0.03\%$ and $1.3\pm0.4\%$ fidelity for the CZ and the iSWAP gate, respectively. We argue that spurious $ZZ$-type couplings are the dominant error source for the iSWAP gate, and that phase stability of all microwave drives is of utmost importance. Such differences in the achievable fidelities for different two-qubit gates have to be taken into account when mapping quantum algorithms to real hardware.

Randomized benchmarking in the analogue setting

Current development in programmable analogue quantum simulators (AQS), whose physical implementation can be realised in the near-term compared to those of large-scale digital quantum computers, highlights the need for robust testing techniques in analogue platforms. Methods to properly certify or benchmark AQS should be efficiently scalable, and also provide a way to deal with errors from state preparation and measurement (SPAM). Up to now, attempts to address this combination of requirements have generally relied on model-specific properties. We put forward a new approach, applying a well-known digital noise characterisation technique called randomized benchmarking (RB) to the analogue setting. RB is a scalable experimental technique that provides a measure of the average error-rate of a gate-set on a quantum hardware, incorporating SPAM errors. We present the original form of digital RB, the necessary alterations to translate it to the analogue setting and introduce the analogue randomized benchmarking protocol (ARB). In ARB we measure the average error-rate per time evolution of a family of Hamiltonians and we illustrate this protocol with two case-studies of analogue models; classically simulating the system by incorporating several physically motivated noise scenarios. We find that for the noise models tested, the data fit with the theoretical predictions and we gain values for the average error rate for differing unitary sets. We compare our protocol with other relevant RB methods, where both advantages (physically motivated unitaries) and disadvantages (difficulty in reversing the time-evolution) are discussed.

Direct Randomized Benchmarking for Multiqubit Devices.

Benchmarking methods that can be adapted to multiqubit systems are essential for assessing the overall or "holistic" performance of nascent quantum processors. The current industry standard is Clifford randomized benchmarking (RB), which measures a single error rate that quantifies overall performance. But, scaling Clifford RB to many qubits is surprisingly hard. It has only been performed on one, two, and three qubits as of this writing. This reflects a fundamental inefficiency in Clifford RB: the n-qubit Clifford gates at its core have to be compiled into large circuits over the one- and two-qubit gates native to a device. As n grows, the quality of these Clifford gates quickly degrades, making Clifford RB impractical at relatively low n. In this Letter, we propose a direct RB protocol that mostly avoids compiling. Instead, it uses random circuits over the native gates in a device, which are seeded by an initial layer of Clifford-like randomization. We demonstrate this protocol experimentally on two to five qubits using the publicly available ibmqx5. We believe this to be the greatest number of qubits holistically benchmarked, and this was achieved on a freely available device without any special tuning up. Our protocol retains the simplicity and convenient properties of Clifford RB: it estimates an error rate from an exponential decay. But, it can be extended to processors with more qubits-we present simulations on 10+ qubits-and it reports a more directly informative and flexible error rate than the one reported by Clifford RB. We show how to use this flexibility to measure separate error rates for distinct sets of gates, and we use this method to estimate the average error rate of a set of cnot gates.

Quantifying error and leakage in an encoded Si/SiGe triple-dot qubit.

Quantum computation requires qubits that satisfy often-conflicting criteria, which include long-lasting coherence and scalable control1. One approach to creating a suitable qubit is to operate in an encoded subspace of several physical qubits. Although such encoded qubits may be particularly susceptible to leakage out of their computational subspace, they can be insensitive to certain noise processes2,3 and can also allow logical control with a single type of entangling interaction4 while maintaining favourable features of the underlying physical system. Here we demonstrate high-fidelity operation of an exchange-only qubit encoded in a subsystem of three coupled electron spins5 confined in gated, isotopically enhanced silicon quantum dots6. This encoding requires neither high-frequency electric nor magnetic fields for control, and instead relies exclusively on the exchange interaction4,5, which is highly local and can be modulated with a large on-off ratio using only fast voltage pulses. It is also compatible with very low and gradient-free magnetic field environments, which simplifies integration with superconducting materials. We developed and employed a modified blind randomized benchmarking protocol that determines both computational and leakage errors7,8, and found that unitary operations have an average total error of 0.35%, with half of that, 0.17%, coming from leakage driven by interactions with substrate nuclear spins. The combination of this proven performance with complete control via gate voltages makes the exchange-only qubit especially attractive for use in many-qubit systems.

Comparing the randomized benchmarking figure with the average infidelity of a quantum gate-set

Randomized benchmarking (RB) is a popular procedure used to gauge the performance of a set of gates useful for quantum information processing (QIP). Recently, Proctor et al. [Phys. Rev. Lett. 119 (2017) 130502] demonstrated a practically relevant example where the RB measurements give a number [Formula: see text], very different from the actual average gate-set infidelity [Formula: see text], despite past theoretical assurances that the two should be equal. Here, we derive formulas for [Formula: see text], and for [Formula: see text] from the RB protocol, in a manner permitting easy comparison of the two. We show in general that, indeed, [Formula: see text], i.e. RB does not measure average infidelity, and, in fact, neither one bounds the other. We give several examples, all plausible in real experiments, to illustrate the differences in [Formula: see text] and [Formula: see text]. Many recent papers on experimental implementations of QIP have claimed the ability to perform high-fidelity gates because they demonstrated small [Formula: see text] values using RB. Our analysis shows that such a statement from RB alone has to be interpreted with caution.

Randomized benchmarking under different gate sets

We provide a comprehensive analysis of the differences between two important standards for randomized benchmarking (RB): the Clifford-group RB protocol proposed originally in Emerson et al. [J. Opt. B 7, S347 (2005)] and Dankert et al. [Phys. Rev. A 80, 012304 (2009)], and a variant of that RB protocol proposed by the NIST group in Knill et al. [Phys. Rev. A 77, 012307 (2008)]. While these two protocols are frequently conflated or presumed equivalent, we prove that they produce distinct exponential fidelity decays leading to differences of up to a factor of 3 in the estimated error rates under experimentally realistic conditions. These differences arise because the NIST RB protocol does not satisfy the unitary two-design condition for the twirl in the Clifford-group protocol and thus the decay rate depends on noninvariant features of the error model. Our analysis provides an important first step toward developing definitive standards for benchmarking quantum gates and a more rigorous theoretical underpinning for the NIST protocol and other RB protocols lacking a group-structure. We conclude by discussing the potential impact of these differences for estimating fault-tolerant overheads.

Fault-Tolerant Logical Gates in the IBM Quantum Experience.

Quantum computers will require encoding of quantum information to protect them from noise. Fault-tolerant quantum computing architectures illustrate how this might be done but have not yet shown a conclusive practical advantage. Here we demonstrate that a small but useful error detecting code improves the fidelity of the fault-tolerant gates implemented in the code space as compared to the fidelity of physically equivalent gates implemented on physical qubits. By running a randomized benchmarking protocol in the logical code space of the [4,2,2] code, we observe an order of magnitude improvement in the infidelity of the gates, with the two-qubit infidelity dropping from 5.8(2)% to 0.60(3)%. Our results are consistent with fault-tolerance theory and conclusively demonstrate the benefit of carrying out computation in a code space that can detect errors. Although the fault-tolerant gates offer an impressive improvement in fidelity, the computation as a whole is not below the fault-tolerance threshold because of noise associated with state preparation and measurement on this device.

Randomized benchmarking with restricted gate sets

Standard randomized benchmarking protocols entail sampling from a unitary 2 design, which is not always practical. In this article we examine randomized benchmarking protocols based on subgroups of the Clifford group that are not unitary 2 designs. We introduce a general method for analyzing such protocols and subsequently apply it to two subgroups, the group generated by controlled-NOT, Hadamard, and Pauli gates and that generated by only controlled-NOT and Pauli gates. In both cases the error probability can be estimated to within a factor of two or less where the factor can be arranged to be conservative and to decay exponentially in the number of qubits. For randomized benchmarking of logical qubits even better accuracy will typically be obtained. Thus, we show that sampling a distribution which is close to a unitary 2 design, although sufficient, is not necessary for randomized benchmarking to high accuracy.