Qubit Metrology of Ultralow Phase Noise Using Randomized Benchmarking
P. J. J. O’Malley, J. Kelly, R. Barends, B. Campbell, Yanbin Chen, Z. Chen, B. Chiaro, A. Dunsworth, Austin G. Fowler, I.-C. Hoi, Evan R. Jeffrey, A. Megrant, J. Mutus, C. Neill, Chris Quintana, P. Roushan, D. Sank, A. Vainsencher, J. Wenner, T. C. White, Alexander N. Korotkov, Andrew N. Cleland, John M. Martinis
Further advances in the fidelity of quantum information systems will rely on precise measurements of ever smaller amounts of noise. The authors present a technique based on randomized benchmarking that is ideal for measuring noise at the small timescales and low error rates relevant to fault-tolerant error-correction schemes. Their SQUID-based test qubit is found to be limited not by $1/f$ flux noise, but rather by telegraph noise too small to be studied with standard methods.
Further advances in the fidelity of quantum information systems will rely on precise measurements of ever smaller amounts of noise. The authors present a technique based on randomized benchmarking that is ideal for measuring noise at the small timescales and low error rates relevant to fault-tolerant error-correction schemes. Their SQUID-based test qubit is found to be limited not by 1/f flux noise, but rather by telegraph noise too small to be studied with standard methods.
The characterization of noisy quantum circuits is an important step in the development of large-scale quantum computers. As experimental quantum architectures approach the threshold for fault-tolerant quantum computing, obtaining a benchmark of process fidelities is needed to verify the integrity of the system and ensure functionality. Additionally, the ability to successfully implement a quantum code of choice may depend on the type of noise that is present in the system. It is therefore necessary to characterize not only the fidelity of the process, but also the structure of the noise. \n \nRandomized benchmarking is a characterization protocol which extracts partial information from a noisy quantum process. This thesis gives a detailed review of the randomized benchmarking protocol, and presents the results of three collaborative projects which use techniques similar to randomized benchmarking to obtain previously hidden information. The first protocol is designed to obtain a benchmark on loss errors. This protocol also provides information on the detector efficiency and an additional constraint on estimated parameters from randomized benchmarking. The second protocol is an extension of the first, under the special case of coherent leakage errors, for which we obtain an estimate of the leakage rate. The third protocol provides a method of testing for spatial correlations in noisy processes. This test may be used to determine the correlation structure of errors, and the error correcting codes needed for successful experiments in a particular architecture. All protocols presented in this thesis are scalable, platform-independent and insensitive to state preparation and measurement errors. We also provide results of numerical tests of these protocols for simulated noise, which show their accuracy and robustness.
Robust qubit memory is essential for quantum computing, both for near-term devices operating without error correction, and for the long-term goal of a fault-tolerant processor. We directly measure the memory error ${\ensuremath{\epsilon}}_{m}$ for a 43Ca+ trapped-ion qubit in the small-error regime and find ${\ensuremath{\epsilon}}_{m}<{10}^{\ensuremath{-}4}$ for storage times $t\ensuremath{\lesssim}50\text{ }\text{ }\mathrm{ms}$. This exceeds gate or measurement times by three orders of magnitude. Using randomized benchmarking, at t=1ms we measure ${\ensuremath{\epsilon}}_{m}=1.2(7)\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}6}$, around ten times smaller than that extrapolated from the T2∗ time, and limited by instability of the atomic clock reference used to benchmark the qubit.
Quantum computers have the potential to solve problems which are classically intractable. Superconducting qubits present a promising path to building such a computer. Recent experiments with these qubits have demonstrated the principles of quantum error correction, quantum simulation, quantum annealing, and more. Current research with superconducting qubits is focused on two primary goals: creating a fully fault tolerant logical qubit out of many physical qubits using surface code error correction, and demonstrating an exponential speedup over any classical computer for a well-defined computational problem. To achieve either of these goals requires high precision control of three components: single qubit gates, two qubit gates, and qubit measurement. In this thesis, we use randomized benchmarking to characterize single qubit gates with 99.95\\% fidelity and two qubit gates wiht 99.5\\% fidelity in superconducting transmon qubits. In addition, we use standard decoherence measurements as well as newly developed extensions of randomized benchmarking to determine the limiting sources of error. Finally, we explore the surprisingly complicated dynamics of measuring the transmon state through a coupled resonator, and show that fully understanding this process requires breaking a few "standard" assumptions.
We show that nonexponential fidelity decays in randomized benchmarking experiments on quantum-dot qubits are consistent with numerical simulations that incorporate low-frequency noise and correspond to a control fidelity that varies slowly with time. By expanding standard randomized benchmarking analysis to this experimental regime, we find that such nonexponential decays are better modeled by multiple exponential decay rates, leading to an instantaneous control fidelity for isotopically purified silicon metal-oxide-semiconductor quantum-dot qubits which is 98.9% when the low-frequency noise causes large detuning but can be as high as 99.9% when the qubit is driven on resonance and system calibrations are favorable. These advances in qubit characterization and validation methods underpin the considerable prospects for silicon as a qubit platform for fault-tolerant quantum computation.
Abstract Mid-circuit measurements are a key component in many quantum information computing protocols, including quantum error correction, fault-tolerant logical operations, and measurement based quantum computing. As such, techniques to quickly and efficiently characterize or benchmark their performance are of great interest. Beyond the measured qubit, it is also relevant to determine what, if any, impact mid-circuit measurement has on adjacent, unmeasured, spectator qubits. Here, we present a mid-circuit measurement benchmarking suite developed from the ubiquitous paradigm of randomized benchmarking. We show how our benchmarking suite can be used to both detect as well as quantify errors on both measured and spectator qubits, including measurement-induced errors on spectator qubits and entangling errors between measured and spectator qubits. We demonstrate the scalability of our suite by simultaneously characterizing mid-circuit measurement on multiple qubits from an IBM Quantum Falcon device, and support our experimental results with numerical simulations. Further, using a mid-circuit measurement tomography protocol we establish the nature of the errors identified by our benchmarking suite.
Abstract Contemporary methods for benchmarking noisy quantum processors typically measure average error rates or process infidelities. However, thresholds for fault-tolerant quantum error correction are given in terms of worst-case error rates—defined via the diamond norm—which can differ from average error rates by orders of magnitude. One method for resolving this discrepancy is to randomize the physical implementation of quantum gates, using techniques like randomized compiling (RC). In this work, we use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor. We find that, under RC, gate errors are accurately described by a stochastic Pauli noise model without coherent errors, and that spatially correlated coherent errors and non-Markovian errors are strongly suppressed. We further show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set. Our results show that randomized benchmarks are a viable route to both verifying that a quantum processor’s error rates are below a fault-tolerance threshold, and to bounding the failure rates of near-term algorithms, if—and only if—gates are implemented via randomization methods which tailor noise.