Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates

TL;DR

This paper introduces matchgate benchmarking, a scalable method for accurately measuring the fidelity of many-qubit quantum circuits composed of parametrized matchgates, using randomized benchmarking techniques and representation theory insights.

Contribution

It presents a novel, scalable benchmarking protocol specifically designed for matchgate circuits, enabling reliable fidelity estimation of complex many-qubit quantum operations.

Findings

Successfully estimates fidelity of matchgate circuits on quantum hardware

Demonstrates formal correctness and scalability of the benchmarking protocol

Applies method to circuits generated by XY spin interactions

Abstract

We propose a method to reliably and efficiently extract the fidelity of many-qubit quantum circuits composed of continuously parametrized two-qubit gates called matchgates. This method, which we call matchgate benchmarking, relies on advanced techniques from randomized benchmarking as well as insights from the representation theory of matchgate circuits. We argue the formal correctness and scalability of the protocol, and moreover deploy it to estimate the performance of matchgate circuits generated by two-qubit XY spin interactions on a quantum processor.