Scalable fast benchmarking for individual quantum gates with local twirling

Abstract

With the development of controllable quantum systems, fast and practical characterization for multi-qubit gates is essential for building high-fidelity quantum computing devices. The usual way to fulfill this requirement via randomized benchmarking asks for the complicated implementation of numerous multi-qubit twirling gates. How to efficiently and reliably estimate the fidelity of a quantum process remains an open problem. In this work, we propose a character-cycle benchmarking protocol and a character-average benchmarking protocol only using local twirling gates to estimate the process fidelity of an individual multi-qubit operation. Our protocols can characterize a large class of quantum gates including and beyond the Clifford group via the local gauge transformation, which forms a universal gate set for quantum computing. We numerically demonstrate our protocols for a non-Clifford gate -- controlled-$(TX)$ and a Clifford gate -- five-qubit quantum error-correcting encoding circuit. The numerical results show that our protocols can efficiently and reliably characterize the gate process fidelities. Compared with the cross-entropy benchmarking, the simulation results show that the character-average benchmarking achieves three orders of magnitude improvements in terms of sampling complexity.

arXiv comment30 pages, 7 figures

References in corpus (29)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Quantum Error Correction for Quantum Memories
• NMR Techniques for Quantum Control and Computation
• Quantum state tomography via compressed sensing
• Randomized Benchmarking of Quantum Gates
• Prescription for experimental determination of the dynamics of a quantum black box
• High-fidelity quantum logic gates using trapped-ion hyperfine qubits
• High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
• Robust randomized benchmarking of quantum processes
• Roads towards fault-tolerant universal quantum computation
• High-Fidelity Universal Gate Set for ${}^9$Be${}^{+}$ Ion Qubits
• Scalable Noise Estimation with Random Unitary Operators
• Direct Fidelity Estimation from Few Pauli Measurements
• Characterizing Quantum Gates via Randomized Benchmarking
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
• Symmetrised Characterisation of Noisy Quantum Processes
• Randomized benchmarking and process tomography for gate errors in a solid-state qubit
• Characterizing large-scale quantum computers via cycle benchmarking
• Benchmarking Gate Fidelities in a Si/SiGe Two-Qubit Device
• Randomized Benchmarking of Multi-Qubit Gates
• Efficient estimation of Pauli channels
• Randomized benchmarking with gate-dependent noise
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Experimental Estimation of Average Fidelity of a Clifford Gate on a 7-qubit Quantum Processor
• Practical experimental certification of computational quantum gates via twirling
• Fast Estimation of Sparse Quantum Noise

Cited by in corpus (5)

• Swap Test-based Characterization of Quantum Processes in Universal Quantum Computers
• Linear Cross Entropy Benchmarking with Clifford Circuits
• Group twirling and noise tailoring for multi-qubit controlled phase gates
• Calibrating quantum gates up to 52 qubits in a superconducting processor
• Benchmarking non-Clifford gates using only Pauli twirling group