A universal quantum gate set for transmon qubits with strong ZZ interactions

Abstract

High-fidelity single- and two-qubit gates are essential building blocks for a fault-tolerant quantum computer. While there has been much progress in suppressing single-qubit gate errors in superconducting qubit systems, two-qubit gates still suffer from error rates that are orders of magnitude higher. One limiting factor is the residual ZZ-interaction, which originates from a coupling between computational states and higher-energy states. While this interaction is usually viewed as a nuisance, here we experimentally demonstrate that it can be exploited to produce a universal set of fast single- and two-qubit entangling gates in a coupled transmon qubit system. To implement arbitrary single-qubit rotations, we design a new protocol called the two-axis gate that is based on a three-part composite pulse. It rotates a single qubit independently of the state of the other qubit despite the strong ZZ-coupling. We achieve single-qubit gate fidelities as high as 99.1% from randomized benchmarking measurements. We then demonstrate both a CZ gate and a CNOT gate. Because the system has a strong ZZ-interaction, a CZ gate can be achieved by letting the system freely evolve for a gate time $t_g=53.8$ ns. To design the CNOT gate, we utilize an analytical microwave pulse shape based on the SWIPHT protocol for realizing fast, low-leakage gates. We obtain fidelities of 94.6% and 97.8% for the CNOT and CZ gates respectively from quantum progress tomography.

References in corpus (20)

• Charge insensitive qubit design derived from the Cooper pair box
• A Quantum Engineer's Guide to Superconducting Qubits
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Randomized Benchmarking of Quantum Gates
• Simple pulses for elimination of leakage in weakly nonlinear qubits
• Validating quantum computers using randomized model circuits
• Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
• Optimal quantum control using randomized benchmarking
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• High-fidelity, high-scalability two-qubit gate scheme for superconducting qubits
• Analytically solvable driven time-dependent two-level quantum systems
• Three Qubit Randomized Benchmarking
• Characterizing errors on qubit operations via iterative randomized benchmarking
• Characterization of a two-transmon processor with individual single-shot qubit readout
• Suppression of Unwanted $ZZ$ Interactions in a Hybrid Two-Qubit System
• Demonstration of a Parametrically-Activated Entangling Gate Protected from Flux Noise
• Analytical approach to swift nonleaky entangling gates in superconducting qubits
• Overlap junctions for high coherence superconducting qubits
• Implementation of a generalized CNOT gate between fixed-frequency transmons
• Microwave-based Arbitrary CPHASE Gates for Transmon Qubits

Cited by in corpus (6)

• Path toward manufacturable superconducting qubits with relaxation times exceeding 0.1 ms
• Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
• Exploring ab initio machine synthesis of quantum circuits
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking
• Estimating Coherent Contributions to the Error Profile Using Cycle Error Reconstruction
• Robustness of a universal gate set implementation in transmon systems via Chopped Random Basis optimal control