Hybrid benchmarking of arbitrary quantum gates

TL;DR

This paper introduces a versatile benchmarking protocol for quantum gates that efficiently estimates their fidelity, including non-Clifford gates, by combining randomized benchmarking with Monte Carlo sampling, reducing experimental and computational costs.

Contribution

It develops a new interleaved randomized benchmarking method using Monte Carlo sampling applicable to arbitrary quantum gates, including non-Clifford, with improved efficiency.

Findings

Protocol applies to non-Clifford gates

Reduces experimental and classical computational costs exponentially

Maintains key advantages of randomized benchmarking

Abstract

We present a protocol for Interleaved Randomized Benchmarking of arbitrary quantum gates using Monte Carlo sampling of quantum states. It is generally applicable, including non-Clifford gates while preserving key advantages of Randomized Benchmarking such as error amplification as well as independence from state preparation and measurement errors. This property is crucial for implementations in many contemporary systems. Although the protocol scales exponentially in the number of qubits, it is superior to direct Monte Carlo sampling of the average gate fidelity in both the total number of experiments by orders of magnitude and savings in classical preprocessing, that are exponential.