A new class of efficient randomized benchmarking protocols
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 -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.
Cite
@article{arxiv.1806.02048,
title = {A new class of efficient randomized benchmarking protocols},
author = {Jonas Helsen and Xiao Xue and Lieven M. K. Vandersypen and Stephanie Wehner},
journal= {arXiv preprint arXiv:1806.02048},
year = {2019}
}
Comments
v1: 6 + 8 Pages, no figures ; v2: 13+14 pages, one figure, added proof of robustness against gate dependent errors, added justification of interleaved character randomized benchmarking, many minor changes for clarity, added longer more detailed appendix. Close to accepted version