Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
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.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Feb 21, 2022
- Source ID
- 10.22331/q-2022-02-21-657
Entities
People
- Jonas Helsen
- Matthew Reagor
- Michael G Walter
- Sepehr Nezami
Organizations
- California Institute of Technology
- Centrum Wiskunde & Informatica
- Defense Advanced Research Projects Agency
- Dutch Research Council
- German Research Foundation
- Rigetti Computing
- Ruhr University Bochum
- University of Amsterdam