Search

We develop a time-dependent Schrieffer-Wolff-Lindblad perturbation theory to study effective interactions for driven open quantum systems. The starting point of our analysis is a given Lindblad equation, based on which we obtain an effective (averaged) map that describes the renormalization of both the Hamiltonian and collapse operators due to the drive. As a case study, we apply this method to the dispersive readout of a transmon qubit and derive an effective disperive map that describes measurement-induced dephasing and Stark shift for the transmon. The effective map we derive is completely positive and trace-preserving under adiabatic resonator response. To benchmark our method, we demonstrate good agreement with a numerical computation of the effective rates via the Lindbladian spectrum. Our results are also in agreement with, and extend upon, an earlier derivation of such effects by Gambetta et al. (Phys. Rev. A 74, 042318 (2006)) using the positive P-representation for the resonator field., Comment: 19 pages, 7 figures, 1 table, 7 appendices

Off-resonant error for a driven quantum system refers to interactions due to the input drives having non-zero spectral overlap with unwanted system transitions. For the cross-resonance gate, this includes leakage as well as off-diagonal computational interactions that lead to bit-flip error on the control qubit. In this work, we quantify off-resonant error, with more focus on the less studied off-diagonal control interactions, for a direct CNOT gate implementation. Our results are based on numerical simulation of the dynamics, while we demonstrate the connection to time-dependent Schrieffer-Wolff and Magnus perturbation theories. We present two methods for suppressing such error terms. First, pulse parameters need to be optimized so that off-resonant transition frequencies coincide with the local minima due to the pulse spectrum sidebands. Second, we show the advantage of a $Y$-DRAG pulse on the control qubit in mitigating off-resonant error. Depending on qubit-qubit detuning, the proposed methods can improve the average off-resonant error from approximately $10^{-3}$ closer to the $10^{-4}$ level for a direct CNOT calibration., 20 pages, 8 figures, 1 table and 5 appendices

Improving two-qubit gate performance and suppressing crosstalk are major, but often competing, challenges to achieving scalable quantum computation. In particular, increasing the coupling to realize faster gates has been intrinsically linked to enhanced crosstalk due to unwanted two-qubit terms in the Hamiltonian. Here, we demonstrate a novel coupling architecture for transmon qubits that circumvents the standard relationship between desired and undesired interaction rates. Using two fixed frequency coupling elements to tune the dressed level spacings, we demonstrate an intrinsic suppression of the static $ZZ$, while maintaining large effective coupling rates. Our architecture reveals no observable degradation of qubit coherence ($T_1,T_2 > 100~��s$) and, over a factor of 6 improvement in the ratio of desired to undesired coupling. Using the cross-resonance interaction we demonstrate a 180~ns single-pulse CNOT gate, and measure a CNOT fidelity of 99.77(2)$\%$ from interleaved randomized benchmarking., 5 pages, 3 figures plus supplement (4 pages, 3 figures)

We present a comprehensive theoretical study of the cross-resonance gate operation covering estimates for gate parameters and gate error as well as analyzing spectator qubits and multi-qubit frequency collisions. We start by revisiting the derivation of effective Hamiltonian models following Magesan et al. (arXiv:1804.04073). Transmon qubits are commonly modeled as a weakly anharmonic Kerr oscillator. Kerr theory only accounts for qubit frequency renormalization, while adopting number states as the eigenstates of the bare qubit Hamiltonian. Starting from the Josephson nonlinearity and by accounting for the eigenstates renormalization, due to counter-rotating terms, we derive a new starting model for the cross-resonance gate with modified qubit-qubit interaction and drive matrix elements. Employing time-dependent Schrieffer-Wolff perturbation theory, we derive an effective Hamiltonian for the cross-resonance gate with estimates for the gate parameters calculated up to the fourth order in drive amplitude. The new model with renormalized eigenstates lead to 10-15 percent relative correction of the effective gate parameters compared to Kerr theory. We find that gate operation is strongly dependent on the ratio of qubit-qubit detuning and anharmonicity. In particular, we characterize five distinct regions of operation, and propose candidate parameter choices for achieving high gate speed and low coherent gate error when the cross-resonance tone is equipped with an echo pulse sequence. Furthermore, we generalize our method to include a third spectator qubit and characterize possible detrimental multi-qubit frequency collisions., 30 pages, 15 figures and 4 tables

As superconducting quantum circuits scale to larger sizes, the problem of frequency crowding proves a formidable task. Here we present a solution for this problem in fixed-frequency qubit architectures. By systematically adjusting qubit frequencies post-fabrication, we show a nearly ten-fold improvement in the precision of setting qubit frequencies. To assess scalability, we identify the types of 'frequency collisions' that will impair a transmon qubit and cross-resonance gate architecture. Using statistical modeling, we compute the probability of evading all such conditions, as a function of qubit frequency precision. We find that without post-fabrication tuning, the probability of finding a workable lattice quickly approaches 0. However with the demonstrated precisions it is possible to find collision-free lattices with favorable yield. These techniques and models are currently employed in available quantum systems and will be indispensable as systems continue to scale to larger sizes., Comment: 9 pages, 6 figures, Supplementary Information. Update to correct typo in author name and in text. Updated acknowledgements and corrected typo in acknowledgements

The outstanding progress in experimental quantum computing with superconducting Josephson-junction based qubits over the past few decades has pushed coherence times many orders of magnitude above that of the first measured. We are also in the midst of scaling towards complex architectures of multi-qubit processors where maintaining very low gate error rates at the limits supported by coherence times is extremely important. Here we will review some of the critical materials and device challenges for superconducting qubits from the perspective of improved coherence and improved error rates. In particular we will focus on the problem of frequency allocations in order to target multi-qubit lattices for fixed-frequency microwave-based gates.

Effective Hamiltonian methods are utilized to model the two-qubit cross-resonance gate for both the ideal two-qubit case and when higher levels are included. Analytic expressions are obtained in the qubit case and the higher-level model is solved both perturbatively and numerically, with the solutions agreeing well in the weak-drive limit. The methods are applied to parameters from recent experiments and, accounting for classical cross-talk effects, results in good agreement between theory and experimental results.

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., Fixed minor errors, added references and improved figure readability. 10 pages, 6 figures

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., Comment: 6 pages, 5 figures

We present parity measurements on a five-qubit lattice with connectivity amenable to the surface code quantum error correction architecture. Using all-microwave controls of superconducting qubits coupled via resonators, we encode the parities of four data qubit states in either the $X$- or the $Z$-basis. Given the connectivity of the lattice, we perform full characterization of the static $Z$-interactions within the set of five qubits, as well as dynamical $Z$-interactions brought along by single- and two-qubit microwave drives. The parity measurements are significantly improved by modifying the microwave two-qubit gates to dynamically remove non-ideal $Z$ errors., Comment: 8 pages, 4 figures

Quantum computing holds the promise of a novel form of information processing in which data resides in quantum states. By exploiting superpositions and entanglement among these states, quantum logic operations are expected to far surpass conventional digital logic in certain classes of problems. To realize this prospect, we employ superconducting circuits at millikelvin temperatures. The nonlinearity of a Josephson tunnel junction enables a two-level quantum system, or qubit, with excitation energy in the microwave regime. Key recent advances in such devices are the demonstration of robust and simple multi-qubit gates, the integration of superconducting qubits into arrays of four or more, and gate fidelities reaching 99%. [1,2,3]

Randomized benchmarking is a widely used experimental technique to characterize the average error of quantum operations. Benchmarking procedures that scale to enable characterization of $n$-qubit circuits rely on efficient procedures for manipulating those circuits and, as such, have been limited to subgroups of the Clifford group. However, universal quantum computers require additional, non-Clifford gates to approximate arbitrary unitary transformations. We define a scalable randomized benchmarking procedure over $n$-qubit unitary matrices that correspond to protected non-Clifford gates for a class of stabilizer codes. We present efficient methods for representing and composing group elements, sampling them uniformly, and synthesizing corresponding $\mathrm{poly}(n)$-sized circuits. The procedure provides experimental access to two independent parameters that together characterize the average gate fidelity of a group element., 5+4 pages, 1 figure

The ability to detect and deal with errors when manipulating quantum systems is a fundamental requirement for fault-tolerant quantum computing. Unlike classical bits that are subject to only digital bit-flip errors, quantum bits are susceptible to a much larger spectrum of errors, for which any complete quantum error-correcting code must account. Whilst classical bit-flip detection can be realized via a linear array of qubits, a general fault-tolerant quantum error-correcting code requires extending into a higher-dimensional lattice. Here we present a quantum error detection protocol on a two-by-two planar lattice of superconducting qubits. The protocol detects an arbitrary quantum error on an encoded two-qubit entangled state via quantum non-demolition parity measurements on another pair of error syndrome qubits. This result represents a building block towards larger lattices amenable to fault-tolerant quantum error correction architectures such as the surface code., The physical realization of a quantum computer requires built-in error-correcting codes that compensate the disruption of quantum information arising from noise. Here, the authors demonstrate a quantum error detection scheme for arbitrary single-qubit errors on a four superconducting qubit lattice.

With improved gate calibrations reducing unitary errors, we achieve a benchmarked single-qubit gate fidelity of 99.95% with superconducting qubits in a circuit quantum electrodynamics system. We present a method for distinguishing between unitary and non-unitary errors in quantum gates by interleaving repetitions of a target gate within a randomized benchmarking sequence. The benchmarking fidelity decays quadratically with the number of interleaved gates for unitary errors but linearly for non-unitary, allowing us to separate systematic coherent errors from decoherent effects. With this protocol we show that the fidelity of the gates is not limited by unitary errors, but by another drive-activated source of decoherence such as amplitude fluctuations., 5 pages, 4 figures

Physical implementations of qubits can be extremely sensitive to environmental coupling, which can result in decoherence. While efforts are made for protection, coupling to the environment is necessary to measure and manipulate the state of the qubit. As such, the goal of having long qubit energy relaxation times is in competition with that of achieving high-fidelity qubit control and measurement. Here we propose a method that integrates filtering techniques for preserving superconducting qubit lifetimes together with the dispersive coupling of the qubit to a microwave resonator for control and measurement. The result is a compact circuit that protects qubits from spontaneous loss to the environment, while also retaining the ability to perform fast, high-fidelity readout. Importantly, we show the device operates in a regime that is attainable with current experimental parameters and provide a specific example for superconducting qubits in circuit quantum electrodynamics., 9 pages, 6 figures, 1 table

High-fidelity measurements are important for the physical implementation of quantum information protocols. Current methods for classifying measurement trajectories in superconducting qubit systems produce fidelities that are systematically lower than those predicted by experimental parameters. Here, we place current classification methods within the framework of machine learning algorithms and improve on them by investigating more sophisticated ML approaches. We find that non-linear algorithms and clustering methods produce significantly higher assignment fidelities that help close the gap to the fidelity achievable under ideal noise conditions. Clustering methods group trajectories into natural subsets within the data, which allows for the diagnosis of specific systematic errors. We find large clusters in the data associated with relaxation processes and show these are the main source of discrepancy between our experimental and achievable fidelities. These error diagnosis techniques help provide a concrete path forward to improve qubit measurements., Comment: 8 pages, 6 figures, submitted version

In previous work, we proposed a method for leveraging efficient classical simulation algorithms to aid in the analysis of large-scale fault tolerant circuits implemented on hypothetical quantum information processors. Here, we extend those results by numerically studying the efficacy of this proposal as a tool for understanding the performance of an error-correction gadget implemented with fault models derived from physical simulations. Our approach is to approximate the arbitrary error maps that arise from realistic physical models with errors that are amenable to a particular classical simulation algorithm in an "honest" way; that is, such that we do not underestimate the faults introduced by our physical models. In all cases, our approximations provide an "honest representation" of the performance of the circuit composed of the original errors. This numerical evidence supports the use of our method as a way to understand the feasibility of an implementation of quantum information processing given a characterization of the underlying physical processes in experimentally accessible examples., 34 pages, 9 tables, 4 figures

Quantum systems have shown great promise for precision metrology thanks to advances in their control. This has allowed not only the sensitive estimation of external parameters but also the reconstruction of their temporal profile. In particular, quantum control techniques and orthogonal function theory have been applied to the reconstruction of the complete profiles of time-varying magnetic fields. Here, we provide a detailed theoretical analysis of the reconstruction method based on the Walsh functions, highlighting the relationship between the orthonormal Walsh basis, sensitivity of field reconstructions, data compression techniques, and dynamical decoupling theory. Specifically, we show how properties of the Walsh basis and a detailed sensitivity analysis of the reconstruction protocol provide a method to characterize the error between the reconstructed and true fields. In addition, we prove various results about the negligibility function on binary sequences which lead to data compression techniques in the Walsh basis and a more resource-efficient reconstruction protocol. The negligibility proves a fruitful concept to unify the information content of Walsh functions and their dynamical decoupling power, which makes the reconstruction method robust against noise., Comment: 19 pages, 10 figures

Efficient methods for characterizing the performance of quantum measurements are important in the experimental quantum sciences. Ideally, one requires both a physically relevant distinguishability measure between measurement operations and a well-defined experimental procedure for estimating the distinguishability measure. Here, we propose the average measurement fidelity and error between quantum measurements as distinguishability measures. We present protocols for obtaining bounds on these quantities that are both estimable using experimentally accessible quantities and scalable in the size of the quantum system. We explain why the bounds should be valid in large generality and illustrate the method via numerical examples., Comment: 20 pages, 1 figure. Expanded details and typos corrected. Accepted version

In this paper, we analyze the performance of randomized benchmarking protocols on gate sets under a variety of realistic error models that include systematic rotations, amplitude damping, leakage to higher levels, and 1/f noise. We find that, in almost all cases, benchmarking provides better than a factor-of-two estimate of average error rate, suggesting that randomized benchmarking protocols are a valuable tool for verification and validation of quantum operations. In addition, we derive new models for fidelity decay curves under certain types of non-Markovian noise models such as 1/f and leakage errors. We also show that, provided the standard error of the fidelity measurements is small, only a small number of trials are required for high confidence estimation of gate errors., 13 pages, 11 figures

We present methods that can provide an exponential savings in the resources required to perform dynamic parameter estimation using quantum systems. The key idea is to merge classical compressive sensing techniques with quantum control methods to efficiently estimate time-dependent parameters in the system Hamiltonian. We show that incoherent measurement bases and, more generally, suitable random measurement matrices can be created by performing simple control sequences on the quantum system. Since random measurement matrices satisfying the restricted isometry property can be used to reconstruct any sparse signal in an efficient manner, and many physical processes are approximately sparse in some basis, these methods can potentially be useful in a variety of applications such as quantum sensing and magnetometry. We illustrate the theoretical results throughout the presentation with various practically relevant numerical examples., 15 pages, 4 figures

Quantum error correction (QEC) is an essential step towards realising scalable quantum computers. Theoretically, it is possible to achieve arbitrarily long protection of quantum information from corruption due to decoherence or imperfect controls, so long as the error rate is below a threshold value. The two-dimensional surface code (SC) is a fault-tolerant error correction protocol} that has garnered considerable attention for actual physical implementations, due to relatively high error thresholds ~1%, and restriction to planar lattices with nearest-neighbour interactions. Here we show a necessary element for SC error correction: high-fidelity parity detection of two code qubits via measurement of a third syndrome qubit. The experiment is performed on a sub-section of the SC lattice with three superconducting transmon qubits, in which two independent outer code qubits are joined to a central syndrome qubit via two linking bus resonators. With all-microwave high-fidelity single- and two-qubit nearest-neighbour entangling gates, we demonstrate entanglement distributed across the entire sub-section by generating a three-qubit Greenberger-Horne-Zeilinger (GHZ) state with fidelity ~94%. Then, via high-fidelity measurement of the syndrome qubit, we deterministically entangle the otherwise un-coupled outer code qubits, in either an even or odd parity Bell state, conditioned on the syndrome state. Finally, to fully characterize this parity readout, we develop a new measurement tomography protocol to obtain a fidelity metric (90% and 91%). Our results reveal a straightforward path for expanding superconducting circuits towards larger networks for the SC and eventually a primitive logical qubit implementation., Comment: 9 pages, 4 main figures, 3 extended data figures

Understanding fault-tolerant properties of quantum circuits is important for the design of large-scale quantum information processors. In particular, simulating properties of encoded circuits is a crucial tool for investigating the relationships between the noise model, encoding scheme, and threshold value. For general circuits and noise models, these simulations quickly become intractable in the size of the encoded circuit. We introduce methods for approximating a noise process by one which allows for efficient Monte Carlo simulation of properties of encoded circuits. The approximations are as close to the original process as possible without overestimating their ability to preserve quantum information, a key property for obtaining more honest estimates of threshold values. We numerically illustrate the method with various physically relevant noise models., 6 pages, 1 figure

In this Letter we propose a fully scalable randomized benchmarking protocol for quantum information processors. We prove that the protocol provides an efficient and reliable estimate of the average error-rate for a set operations (gates) under a very general noise model that allows for both time and gate-dependent errors. In particular we obtain a sequence of fitting models for the observable fidelity decay as a function of a (convergent) perturbative expansion of the gate errors about the mean error. We illustrate the protocol through numerical examples.

We describe and expand upon the scalable randomized benchmarking protocol proposed in Phys. Rev. Lett. 106, 180504 (2011) which provides a method for benchmarking quantum gates and estimating the gate-dependence of the noise. The protocol allows the noise to have weak time and gate-dependence, and we provide a sufficient condition for the applicability of the protocol in terms of the average variation of the noise. We discuss how state preparation and measurement errors are taken into account and provide a complete proof of the scalability of the protocol. We establish a connection in special cases between the error rate provided by this protocol and the error strength measured using the diamond norm distance., Comment: 19 pages, no figures, published version

The task of finding a correctable encoding that protects against some physical quantum process is in general hard. Two main obstacles are that an exponential number of experiments are needed to gain complete information about the quantum process, and known algorithmic methods for finding correctable encodings involve operations on exponentially large matrices. However, we show that in some cases it is possible to find such encodings with only partial information about the quantum process. Such useful partial information can be systematically extracted by averaging the channel under the action of a set of unitaries in a process known as twirling. In this paper we prove that correctable encodings for a twirled channel are also correctable for the original channel. We investigate the particular case of twirling over the set of Pauli operators and qubit permutations, and show that the resulting quantum operation can be characterized experimentally in a scalable manner. We also provide a postprocessing scheme for finding unitarily correctable codes for these twirled channels which does not involve exponentially large matrices, and which is robust against uncertainties in the experimental estimates.