Complete randomized benchmarking protocol accounting for leakage errors

Tobias Chasseur, Frank K. Wilhelm

Physical Review A · 2015 · 40 citations · 22 references

DOIFull text

Open access

Concepts

TL;DR

Randomized Benchmarking efficiently characterizes the average error of a unitary 2‑design such as the Clifford group, but assumes no non‑computational leakage levels, a condition relevant for superconducting transmon qubits. The study investigates leakage errors in Randomized Benchmarking caused by an extra level per qubit and proposes a modified protocol to reliably estimate gate error rates in their presence. The authors modify the standard protocol and analyze the variance of sequence fidelity to determine the number of random sequences required for accurate fidelity estimation. The protocol supports gate‑dependent error channels beyond perturbative regimes, is compatible with Interleaved Randomized Benchmarking, and extends to benchmarking arbitrary gates.

Abstract

Randomized Benchmarking allows to efficiently and scalably characterize the average error of an unitary 2-design such as the Clifford group $\mathcal{C}$ on a physical candidate for quantum computation, as long as there are no non-computational leakage levels in the system. We investigate the effect of leakage errors on Randomized Benchmarking induced from an additional level per physical qubit and provide a modified protocol that allows to derive reliable estimates for the error per gate in their presence. We assess the variance of the sequence fidelity corresponding to the number of random sequences needed for valid fidelity estimation. Our protocol allows for gate dependent error channels without being restricted to perturbations. We show that our protocol is compatible with Interleaved Randomized Benchmarking and expand to benchmarking of arbitrary gates. This setting is relevant for superconducting transmon qubits, among other systems.

References

22