Quantification and Characterization of Leakage Errors

  1. Christopher J. Wood,
  2. and Jay M. Gambetta
We present a general framework for the quantification and characterization of leakage errors that result when a quantum system is encoded in the subspace of a larger system. To do this
we introduce new metrics for quantifying the coherent and incoherent properties of the resulting errors, and we illustrate this framework with several examples relevant to superconducting qubits. In particular, we propose two quantities: the leakage and seepage rates, which together with average gate fidelity allow for characterizing the average performance of quantum gates in the presence of leakage and show how the randomized benchmarking protocol can be modified to enable the robust estimation of all three quantities for a Clifford gate set.

Efficient Z-Gates for Quantum Computing

  1. David C. McKay,
  2. Christopher J. Wood,
  3. Sarah Sheldon,
  4. Jerry M. Chow,
  5. and Jay M. Gambetta
For superconducting qubits, microwave pulses drive rotations around the Bloch sphere. Here we show that the phase of these drives can be used to generate zero-duration arbitrary Z-gates
which, combined with two Xπ/2 gates, can generate any SU(2) gate. We perform randomized benchmarking using a Clifford set of Hadamard and Z-gates and show that the error per Clifford is reduced versus a set consisting of standard finite-duration X and Y gates. Z-gates can also correct unitary rotation errors for weakly anharmonic qubits as an alternative to pulse shaping techniques such as DRAG. We investigate leakage and show that a combination of DRAG pulse shaping to minimize leakage and Z-gates to correct rotation errors (DRAGZ) realizes a 13.3ns Xπ/2 gate characterized by low error (1.95[3]×10−4) and low leakage (3.1[6]×10−6). Ultimately leakage is limited by the finite temperature of the qubit, but this limit is two orders-of-magnitude smaller than pulse errors due to decoherence.

A universal gate for fixed-frequency qubits via a tunable bus

  1. David C. McKay,
  2. Stefan Filipp,
  3. Antonio Mezzacapo,
  4. Easwar Magesan,
  5. Jerry M. Chow,
  6. and Jay M. Gambetta
A challenge for constructing large circuits of superconducting qubits is to balance addressability, coherence and coupling strength. High coherence can be attained by building circuits
from fixed-frequency qubits, however, leading techniques cannot couple qubits that are far detuned. Here we introduce a method based on a tunable bus which allows for the coupling of two fixed-frequency qubits even at large detunings. By parametrically oscillating the bus at the qubit-qubit detuning we enable a resonant exchange (XX+YY) interaction. We use this interaction to implement a 183ns two-qubit iSWAP gate between qubits separated in frequency by 854MHz with a measured average fidelity of 0.9823(4) from interleaved randomized benchmarking. This gate may be an enabling technology for surface code circuits and for analog quantum simulation.

Procedure for systematically tuning up crosstalk in the cross resonance gate

  1. Sarah Sheldon,
  2. Easwar Magesan,
  3. Jerry M. Chow,
  4. and Jay M. Gambetta
We present improvements in both theoretical understanding and experimental implementation of the cross resonance (CR) gate that have led to shorter two-qubit gate times and interleaved
randomized benchmarking fidelities exceeding 99%. The CR gate is an all-microwave two-qubit gate offers that does not require tunability and is therefore well suited to quantum computing architectures based on 2D superconducting qubits. The performance of the gate has previously been hindered by long gate times and fidelities averaging 94-96%. We have developed a calibration procedure that accurately measures the full CR Hamiltonian. The resulting measurements agree with theoretical analysis of the gate and also elucidate the error terms that have previously limited the gate fidelity. The increase in fidelity that we have achieved was accomplished by introducing a second microwave drive tone on the target qubit to cancel unwanted components of the CR Hamiltonian.

Demonstration of quantum advantage in machine learning

  1. D. Ristè,
  2. Marcus P. da Silva,
  3. Colm A. Ryan,
  4. Andrew W. Cross,
  5. John A. Smolin,
  6. Jay M. Gambetta,
  7. Jerry M. Chow,
  8. and Blake R. Johnson
The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage
involve the repeated use of a black box, or oracle, whose structure encodes the solution. One measure of the algorithmic performance is the query complexity, i.e., the scaling of the number of oracle calls needed to find the solution with a given probability. Few-qubit demonstrations of quantum algorithms, such as Deutsch-Jozsa and Grover, have been implemented across diverse physical systems such as nuclear magnetic resonance, trapped ions, optical systems, and superconducting circuits. However, at the small scale, these problems can already be solved classically with a few oracle queries, and the attainable quantum advantage is modest. Here we solve an oracle-based problem, known as learning parity with noise, using a five-qubit superconducting processor. Running classical and quantum algorithms on the same oracle, we observe a large gap in query count in favor of quantum processing. We find that this gap grows by orders of magnitude as a function of the error rates and the problem size. This result demonstrates that, while complex fault-tolerant architectures will be required for universal quantum computing, a quantum advantage already emerges in existing noisy systems

Building logical qubits in a superconducting quantum computing system

  1. Jay M. Gambetta,
  2. Jerry M. Chow,
  3. and Matthias Steffen
The technological world is in the midst of a quantum computing and quantum information revolution. Since Richard Feynman’s famous „plenty of room at the bottom“ lecture,
hinting at the notion of novel devices employing quantum mechanics, the quantum information community has taken gigantic strides in understanding the potential applications of a quantum computer and laid the foundational requirements for building one. We believe that the next significant step will be to demonstrate a quantum memory, in which a system of interacting qubits stores an encoded logical qubit state longer than the incorporated parts. Here, we describe the important route towards a logical memory with superconducting qubits, employing a rotated version of the surface code. The current status of technology with regards to interconnected superconducting-qubit networks will be described and near-term areas of focus to improve devices will be identified. Overall, the progress in this exciting field has been astounding, but we are at an important turning point where it will be critical to incorporate engineering solutions with quantum architectural considerations, laying the foundation towards scalable fault-tolerant quantum computers in the near future.

Bulk and surface loss in superconducting transmon qubits

  1. Oliver Dial,
  2. Douglas T. McClure,
  3. Stefano Poletto,
  4. Jay M. Gambetta,
  5. David W. Abraham,
  6. Jerry M. Chow,
  7. and Matthias Steffen
Decoherence of superconducting transmon qubits is purported to be consistent with surface loss from two-level systems on the substrate surface. Here, we present a study of surface loss
in transmon devices, explicitly designed to have varying sensitivities to different surface loss contributors. Our experiments also encompass two particular different sapphire substrates, which reveal the onset of a yet unknown additional loss mechanism outside of surface loss for one of the substrates. Tests across different wafers and devices demonstrate substantial variation, and we emphasize the importance of testing large numbers of devices for disentangling di?erent sources of decoherence.

Characterizing a Four-Qubit Planar Lattice for Arbitrary Error Detection

  1. Jerry M. Chow,
  2. Srikanth J. Srinivasan,
  3. Easwar Magesan,
  4. A. D. Corcoles,
  5. David W. Abraham,
  6. Jay M. Gambetta,
  7. and Matthias Steffen
Quantum error correction will be a necessary component towards realizing scalable quantum computers with physical qubits. Theoretically, it is possible to perform arbitrarily long computations
if the error rate is below a threshold value. The two-dimensional surface code permits relatively high fault-tolerant thresholds at the ~1% level, and only requires a latticed network of qubits with nearest-neighbor interactions. Superconducting qubits have continued to steadily improve in coherence, gate, and readout fidelities, to become a leading candidate for implementation into larger quantum networks. Here we describe characterization experiments and calibration of a system of four superconducting qubits arranged in a planar lattice, amenable to the surface code. Insights into the particular qubit design and comparison between simulated parameters and experimentally determined parameters are given. Single- and two-qubit gate tune-up procedures are described and results for simultaneously benchmarking pairs of two-qubit gates are given. All controls are eventually used for an arbitrary error detection protocol described in separate work [Corcoles et al., Nature Communications, 6, 2015]

Broadband Filters for Abatement of Spontaneous Emission for Superconducting Qubits

  1. Nicholas T. Bronn,
  2. Yanbing Liu,
  3. Jared B. Hertzberg,
  4. Antonio D. Córcoles,
  5. Andrew A. Houck,
  6. Jay M. Gambetta,
  7. and Jerry M. Chow
The ability to perform fast, high-fidelity readout of quantum bits (qubits) is essential for the goal of building a quantum computer. However, the parameters of a superconducting qubit
device necessary to achieve this typically enhance qubit relaxation by spontaneous emission through the measurement channel. Here we design a broadband filter using impedance engineering to allow photons to leave the resonator at the cavity frequency but not at the qubit frequency. This broadband filter is implemented both in an on-chip and off-chip configuration.

Detector dependency of diffusive quantum monitorings

  1. Shakib Daryanoosh,
  2. Howard M. Wiseman,
  3. and Jay M. Gambetta
Continuous measurements play a pivotal role in the study of dynamical open quantum systems. `Dyne‘ detections are among the most widespread and efficient measurement schemes,
and give rise to quantum diffusion of the conditioned state. In this work we study under what conditions the detector dependency of the conditional state of a quantum system subject to diffusive monitoring can be demonstrated experimentally, in the sense of ruling our any detector-independent pure-state dynamical model for the system. We consider an arbitrary number L of environments to which the system is coupled, and an arbitrary number K of different types of dyne detections. We prove that non-trivial necessary conditions for such a demonstration can be determined efficiently by semi-definite programming. To determine sufficient conditions, different physical environmental couplings and Hamiltonians for a qubit, and different sets of diffusive monitorings are scrutinized. We compare the threshold efficiencies that are sufficient in the various cases, as well as cases previously considered in the literature, to suggest the most feasible experimental options.