One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing

Abstract

The design and architecture of a quantum instruction set are paramount to the performance of a quantum computer. This work introduces a gate scheme for qubits with $XX+YY$ coupling that directly and efficiently realizes any two-qubit gate up to single-qubit gates. First, this scheme enables high-fidelity execution of quantum operations and achieves minimum possible gate times. Second, since the scheme spans the entire $\text{SU}(4)$ group of two-qubit gates, we can use it to attain the optimal two-qubit gate count for algorithm implementation. These two advantages in synergy give rise to a quantum Complex yet Reduced Instruction Set Computer (CRISC). Though the gate scheme is compact, it supports a comprehensive array of quantum operations. This may seem paradoxical but is realizable due to the fundamental differences between quantum and classical computer architectures. Using our gate scheme, we observe marked improvements across various applications, including generic $n$-qubit gate synthesis, quantum volume, and qubit routing. Furthermore, the proposed scheme also realizes a gate locally equivalent to the commonly used CNOT gate with a gate time of $\frac{\pi }{2g}$, where $g$ is the two-qubit coupling. The AshN scheme is also completely impervious to $ZZ$ error, the main coherent error in transversely coupled systems, as the control parameters implementing the gates can be easily adjusted to take the $ZZ$ term into account.

39 pages, 9 figures, Python code for verifying decomposition of 3-qubit gate into 11 2-qubit gates, v2 and v3 corrects typos in v1 and published version

References in corpus (18)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• Simple pulses for elimination of leakage in weakly nonlinear qubits
• Information Scrambling in Computationally Complex Quantum Circuits
• Analytic control methods for high fidelity unitary operations in a weakly nonlinear oscillator
• Realization of high-fidelity CZ and ZZ-free iSWAP gates with a tunable coupler
• Fluxonium: an alternative qubit platform for high-fidelity operations
• High-Fidelity, Frequency-Flexible Two-Qubit Fluxonium Gates with a Transmon Coupler
• Tunable coupling scheme for flux qubits at the optimal point
• Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits
• Benchmarking Coherent Errors in Controlled-Phase Gates due to Spectator Qubits
• Quantum Instruction Set Design for Performance
• Approaching the theoretical limit in quantum gate decomposition
• Designing calibration and expressivity-efficient instruction sets for quantum computing
• Comparing Two-Qubit and Multi-Qubit Gates within the Toric Code
• Compiling Arbitrary Single-Qubit Gates Via the Phase-Shifts of Microwave Pulses
• Randomized Benchmarking Beyond Groups

Cited by in corpus (3)

• Native two-qubit gates in fixed-coupling, fixed-frequency transmons beyond cross-resonance interaction
• PHOENIX: Pauli-Based High-Level Optimization Engine for Instruction Execution on NISQ Devices
• Quantum circuit synthesis with SQiSW