Fermionic Averaged Circuit Eigenvalue Sampling

Abstract

Fermionic averaged circuit eigenvalue sampling (FACES) is a protocol to simultaneously learn the averaged error rates of many fermionic linear optical (FLO) gates simultaneously and self-consistently from a suitable collection of FLO circuits. It is highly flexible, allowing for the in situ characterization of FLO-averaged gate-dependent noise under natural assumptions on a family of continuously parameterized one- and two-qubit gates. We rigorously show that our protocol has an efficient sampling complexity, owing in-part to useful properties of the Kravchuk transformations that feature in our analysis. We support our conclusions with numerical results. As FLO circuits become universal with access to certain resource states, we expect our results to inform noise characterization and error mitigation techniques on universal quantum computing architectures which naturally admit a fermionic description.

29 pages, 2 figures, accepted into Quantum

References in corpus (29)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational chemistry
• Quantum Computing with Very Noisy Devices
• Semiconductor Spin Qubits
• Noise tailoring for scalable quantum computation via randomized compiling
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Self-Consistent Quantum Process Tomography
• Matchgates and classical simulation of quantum circuits
• Gate Set Tomography
• Quantum algorithms to simulate many-body physics of correlated fermions
• Microwave-driven coherent operations of a semiconductor quantum dot charge qubit
• Efficient estimation of Pauli channels
• Robust, self-consistent, closed-form tomography of quantum logic gates on a trapped ion qubit
• Matchgate Shadows for Fermionic Quantum Simulation
• Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
• The learnability of Pauli noise
• Efficient Simulation of Random Quantum States and Operators
• Approximate Randomized Benchmarking for Finite Groups
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Error mitigation by training with fermionic linear optics
• Scalable noise characterization of syndrome-extraction circuits with averaged circuit eigenvalue sampling
• Approximate Unitary $k$-Designs from Shallow, Low-Communication Circuits
• Group twirling and noise tailoring for multi-qubit controlled phase gates
• Efficient self-consistent learning of gate set Pauli noise
• Random unitaries in extremely low depth
• Benchmarking bosonic and fermionic dynamics
• Unified Framework for Matchgate Classical Shadows
• Learning Gaussian Operations and the Matchgate Hierarchy
• A Lightweight Protocol for Matchgate Fidelity Estimation