A new class of efficient randomized benchmarking protocols

TL;DR

This paper introduces a novel, efficient randomized benchmarking protocol based on representation theory, applicable to various quantum gatesets, including those with the T-gate, reducing experimental overhead and improving fidelity estimation.

Contribution

It presents a new representation theory-based benchmarking method that broadens applicability and simplifies fidelity estimation for complex quantum gatesets.

Findings

Applicable to a broad class of gatesets including T-gate

Reduces experimental overhead in benchmarking protocols

Successfully estimates fidelity of 2-qubit Clifford gates

Abstract

Randomized benchmarking is a technique for estimating the average fidelity of a set of quantum gates. For general gatesets, however, it is difficult to draw robust conclusions from the resulting data. Here we propose a new method based on representation theory that has little experimental overhead and applies to a broad class of benchmarking problems. As an example, we apply our method to a gateset that includes the $T$-gate, and analyze a new interleaved benchmarking protocol that extracts the average fidelity of a 2-qubit Clifford gate using only single-qubit Clifford gates as reference.