Calibrating quantum gates up to 52 qubits in a superconducting processor
arXiv:2505.22390 · doi:10.1038/s41534-025-00983-5
Abstract
Benchmarking large-scale quantum gates, typically involving multiple native two-qubit and singlequbit gates, is crucial in quantum computing. Global fidelity, encompassing information about intergate correlations, offers a comprehensive metric for evaluating and optimizing gate performance, unlike the fidelities of individual local native gates. In this work, utilizing the character-average benchmarking protocol implementable in a shallow circuit, we successfully benchmark gate fidelities up to 52 qubits. Notably, we achieved a fidelity of 63.090.23% for a 44-qubit parallel CZ gate. Utilizing the global fidelity of the parallel CZ gate, we explore the correlations among local CZ gates by introducing an inter-gate correlation metric, enabling one to simultaneously quantify crosstalk error when benchmarking gate fidelity. Finally, we apply our methods in gate optimization. By leveraging global fidelity for optimization, we enhance the fidelity of a 6-qubit parallel CZ gate from 87.65% to 92.04% and decrease the gate correlation from 3.53% to 3.22%, compared to local gate fidelitybased optimization. The experimental results align well with our established composite noise model, incorporating depolarizing and ZZ-coupling noises, and provide valuable insight into further study and mitigation of correlated noise.
25 pages, 10 figures
References in corpus (30)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Variational Quantum Algorithms
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Measurement-based quantum computation with cluster states
- Strong quantum computational advantage using a superconducting quantum processor
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- Multi-party entanglement in graph states
- Randomized Benchmarking of Quantum Gates
- Robust randomized benchmarking of quantum processes
- Scalable Noise Estimation with Random Unitary Operators
- Direct Fidelity Estimation from Few Pauli Measurements
- Characterizing Quantum Gates via Randomized Benchmarking
- High-threshold and low-overhead fault-tolerant quantum memory
- Efficient measurement of quantum gate error by interleaved randomized benchmarking
- Realization of an Error-Correcting Surface Code with Superconducting Qubits
- Demonstration of fault-tolerant universal quantum gate operations
- Symmetrised Characterisation of Noisy Quantum Processes
- Characterizing large-scale quantum computers via cycle benchmarking
- Three Qubit Randomized Benchmarking
- Diabatic gates for frequency-tunable superconducting qubits
- Direct randomized benchmarking for multi-qubit devices
- Phase transition in Random Circuit Sampling
- Exploring Large-Scale Entanglement in Quantum Simulation
- Restless Tuneup of High-Fidelity Qubit Gates
- A polynomial-time classical algorithm for noisy random circuit sampling
- Experimental exploration of five-qubit quantum error correcting code with superconducting qubits
- Relative Entropy Convergence for Depolarizing Channels
- Realisation of adiabatic and diabatic CZ gates in superconducting qubits coupled with a tunable coupler
- Scalable fast benchmarking for individual quantum gates with local twirling