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

Creators: Helsen, Jonas; Nezami, Sepehr; Reagor, Matthew; Walter, Michael

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.

Additional Information

© 2022 The Author(s). This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Published: 2022-02-21. We would like to acknowledge Harold Nieuwboer, Sergii Strelchuk, Ingo Roth, and Emilio Onorati for useful conversations. MW acknowledges support by an NWO Veni Innovational Research Grant no. 680-47-459, NWO grant OCENW.KLEIN.267, and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy - EXC 2092 CASA - 390781972. This material is based upon work supported by the Defense Advanced Research Projects Agency (DARPA) under agreement No. HR00112090058. While preparing this manuscript, we became aware of [36], where a similar procedure for the standard matchgate group is proposed.

Attached Files

Published - q-2022-02-21-657.pdf

Files

q-2022-02-21-657.pdf

Files (1.4 MB)

Name	Size	Download all
q-2022-02-21-657.pdf md5:9177008f818d8879d8ff579bc7bb63e0	1.4 MB	Preview Download

Additional details

	All versions	This version
Views	0	0
Downloads	0	0
Data volume	0 Bytes	0 Bytes