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.

7+13 pages, 1 figure, accepted into Quantum

References in corpus (12)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A Quantum Approximate Optimization Algorithm
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• Randomized Benchmarking of Quantum Gates
• Characterization of addressability by simultaneous randomized benchmarking
• Matchgates and classical simulation of quantum circuits
• Fermionic Linear Optics Revisited
• Rolling quantum dice with a superconducting qubit
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• A universal quantum gate set for transmon qubits with strong ZZ interactions
• Efficient classical simulation and benchmarking of quantum processes in the Weyl basis
• A framework for randomized benchmarking over compact groups

Cited by in corpus (30)

• A general framework for randomized benchmarking
• Matchgate Shadows for Fermionic Quantum Simulation
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Computational power of one- and two-dimensional dual-unitary quantum circuits
• Quantum Instruction Set Design for Performance
• Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Estimating gate-set properties from random sequences
• Error-mitigated fermionic classical shadows on noisy quantum devices
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Demonstrating scalable randomized benchmarking of universal gate sets
• Group-theoretic error mitigation enabled by classical shadows and symmetries
• Lie-algebraic classical simulations for quantum computing
• Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows
• Error mitigation by training with fermionic linear optics
• Robustly learning the Hamiltonian dynamics of a superconducting quantum processor
• Improved simulation of quantum circuits dominated by free fermionic operations
• Fully scalable randomized benchmarking without motion reversal
• Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors
• Entanglement phase diagrams from partial transpose moments
• Linear Cross Entropy Benchmarking with Clifford Circuits
• Group twirling and noise tailoring for multi-qubit controlled phase gates
• Realizing a Continuous Set of Two-Qubit Gates Parameterized by an Idle Time
• Hands-on Introduction to Randomized Benchmarking
• Estimating the bias of CX gates via character randomized benchmarking
• A Theory of Direct Randomized Benchmarking
• Analyzing the free states of one quantum resource theory as resource states of another
• How to engineer a quantum wavefunction
• Scalable Full-Stack Benchmarks for Quantum Computers
• Fermionic Averaged Circuit Eigenvalue Sampling