skip to main content


Title: A universal quantum gate set for transmon qubits with strong ZZ interactions
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 tg=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.  more » « less
Award ID(s):
1839232
NSF-PAR ID:
10297299
Author(s) / Creator(s):
Date Published:
Journal Name:
ArXivorg
ISSN:
2331-8422
Page Range / eLocation ID:
2103.12305
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. High-fidelity gate operations are essential to the realization of a fault-tolerant quantum computer. In addition, the physical resources required to implement gates must scale efficiently with system size. A longstanding goal of the superconducting qubit community is the tight integration of a superconducting quantum circuit with a proximal classical cryogenic control system. Here we implement coherent control of a superconducting transmon qubit using a Single Flux Quantum (SFQ) pulse driver cofabricated on the qubit chip. The pulse driver delivers trains of quantized flux pulses to the qubit through a weak capacitive coupling; coherent rotations of the qubit state are realized when the pulse-to-pulse timing is matched to a multiple of the qubit oscillation period. We measure the fidelity of SFQ-based gates to be ~95% using interleaved randomized benchmarking. Gate fidelities are limited by quasiparticle generation in the dissipative SFQ driver. We characterize the dissipative and dispersive contributions of the quasiparticle admittance and discuss mitigation strategies to suppress quasiparticle poisoning. These results open the door to integration of large-scale superconducting qubit arrays with SFQ control elements for low-latency feedback and stabilization. 
    more » « less
  2. Molecular qubits are an emerging platform in quantum information science (QIS) due to the unmatched structural control that chemical design and synthesis provide compared to other leading qubit technologies. This theoretical study investigates pulse sequence protocols for spin-correlated radical pairs (SCRPs), which are important molecular spin qubit pair (SQP) candidates. Here, we introduce improved microwave pulse protocols for enhancing the execution times of quantum logic gates based on SQPs. Signi ficantly, this study demonstrates that the proposed pulse sequences selectively remove certain contributions from nuclear spin effects on spin dynamics, which are a common source of decoherence. Additionally, we have analyzed the factors that control the fidelity of the SQP spin state following application of the CNOT gate. It was found that higher magnetic fi elds introduce a high frequency oscillation in the fidelity. Thereupon, it is suggested that further research should be geared towards executing quantum gates at lower magnetic field values. In addition, an absolute bound of the fidelity outcome due to decoherence is determined, which clearly identifies the important factors that control gate execution. Finally, examples of the application of these pulse sequences to SQPs are described. 
    more » « less
  3. We propose a novel deterministic method for preparing arbitrary quantum states. When our protocol is compiled into CNOT and arbitrary single-qubit gates, it prepares anN-dimensional state in depthO(log(N))andspacetime allocation(a metric that accounts for the fact that oftentimes some ancilla qubits need not be active for the entire circuit)O(N), which are both optimal. When compiled into the{H,S,T,CNOT}gate set, we show that it requires asymptotically fewer quantum resources than previous methods. Specifically, it prepares an arbitrary state up to errorϵwith optimal depth ofO(log(N)+log(1/ϵ))and spacetime allocationO(Nlog(log(N)/ϵ)), improving overO(log(N)log(log(N)/ϵ))andO(Nlog(N/ϵ)), respectively. We illustrate how the reduced spacetime allocation of our protocol enables rapid preparation of many disjoint states with only constant-factor ancilla overhead –O(N)ancilla qubits are reused efficiently to prepare a product state ofwN-dimensional states in depthO(w+log(N))rather thanO(wlog(N)), achieving effectively constant depth per state. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations. We provide quantum circuit descriptions of our protocol, detailed pseudocode, and gate-level implementation examples using Braket.

     
    more » « less
  4. Quantum noise is the key challenge in Noisy Intermediate-Scale Quantum (NISQ) computers. Previous work for mitigating noise has primarily focused on gate-level or pulse-level noise-adaptive compilation. However, limited research has explored a higher level of optimization by making the quantum circuits themselves resilient to noise.In this paper, we propose QuantumNAS, a comprehensive framework for noise-adaptive co-search of the variational circuit and qubit mapping. Variational quantum circuits are a promising approach for constructing quantum neural networks for machine learning and variational ansatzes for quantum simulation. However, finding the best variational circuit and its optimal parameters is challenging due to the large design space and parameter training cost. We propose to decouple the circuit search from parameter training by introducing a novel SuperCircuit. The SuperCircuit is constructed with multiple layers of pre-defined parameterized gates (e.g., U3 and CU3) and trained by iteratively sampling and updating the parameter subsets (SubCircuits) of it. It provides an accurate estimation of SubCircuits performance trained from scratch. Then we perform an evolutionary co-search of SubCircuit and its qubit mapping. The SubCircuit performance is estimated with parameters inherited from SuperCircuit and simulated with real device noise models. Finally, we perform iterative gate pruning and finetuning to remove redundant gates in a fine-grained manner.Extensively evaluated with 12 quantum machine learning (QML) and variational quantum eigensolver (VQE) benchmarks on 14 quantum computers, QuantumNAS significantly outperforms noise-unaware search, human, random, and existing noise-adaptive qubit mapping baselines. For QML tasks, QuantumNAS is the first to demonstrate over 95% 2-class, 85% 4-class, and 32% 10-class classification accuracy on real quantum computers. It also achieves the lowest eigenvalue for VQE tasks on H 2 , H 2 O, LiH, CH 4 , BeH 2 compared with UCCSD baselines. We also open-source the TorchQuantum library for fast training of parameterized quantum circuits to facilitate future research. 
    more » « less
  5. null (Ed.)
    Current, near-term quantum devices have shown great progress in the last several years culminating recently with a demonstration of quantum supremacy. In the medium-term, however, quantum machines will need to transition to greater reliability through error correction, likely through promising techniques like surface codes which are well suited for near-term devices with limited qubit connectivity. We discover quantum memory, particularly resonant cavities with transmon qubits arranged in a 2.5D architecture, can efficiently implement surface codes with substantial hardware savings and performance/fidelity gains. Specifically, we virtualize logical qubits by storing them in layers of qubit memories connected to each transmon. Surprisingly, distributing each logical qubit across many memories has a minimal impact on fault tolerance and results in substantially more efficient operations. Our design permits fast transversal application of CNOT operations between logical qubits sharing the same physical address (same set of cavities) which are 6x faster than standard lattice surgery CNOTs. We develop a novel embedding which saves approximately 10x in transmons with another 2x savings from an additional optimization for compactness. Although qubit virtualization pays a 10x penalty in serialization, advantages in the transversal CNOT and in area efficiency result in fault-tolerance and performance comparable to conventional 2D transmon-only architectures. Our simulations show our system can achieve fault tolerance comparable to conventional two-dimensional grids while saving substantial hardware. Furthermore, our architecture can produce magic states at 1.22x the baseline rate given a fixed number of transmon qubits. This is a critical benchmark for future fault-tolerant quantum computers as magic states are essential and machines will spend the majority of their resources continuously producing them. This architecture substantially reduces the hardware requirements for fault-tolerant quantum computing and puts within reach a proof-of-concept experimental demonstration of around 10 logical qubits, requiring only 11 transmons and 9 attached cavities in total. 
    more » « less