Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0811.4387 · Physical Review Letters

Randomized Benchmarking and Process Tomography for Gate Errors in a Solid-State Qubit

Jerry M. Chow, Jay Gambetta, Lars Tornberg, Jens Koch, Lev S. Bishop, Andrew Houck, Blake Johnson, Luigi Frunzio, S. M. Girvin, R. J. Schoelkopf

Published Mar 5, 2009• 246 citations
arXivHTMLPDF

Abstract

We present measurements of single-qubit gate errors for a superconducting qubit. Results from quantum process tomography and randomized benchmarking are compared with gate errors obtained from a double pi pulse experiment. Randomized benchmarking reveals a minimum average gate error of 1.1+/-0.3% and a simple exponential dependence of fidelity on the number of gates. It shows that the limits on gate fidelity are primarily imposed by qubit decoherence, in agreement with theory.

DOI
10.1103/physrevlett.102.090502

Related papers

Error per single-qubit gate below 10−4 in a superconducting qubit

Zhiyuan Li, Pei Liu, Peng Zhao +10 more

Abstract Implementing arbitrary single-qubit gates with near perfect fidelity is among the most fundamental requirements in gate-based quantum information processing. In this work, we fabricate a transmon qubit with long coherence times and demonstrate single-qubit gates with the average gate error below 10 −4 , i.e. (7.42 ± 0.04) × 10 −5 by randomized benchmarking (RB). To understand the error sources, we experimentally obtain an error budget, consisting of the decoherence errors lower bounded by (4.62 ± 0.04) × 10 −5 and the leakage rate per gate of (1.16 ± 0.04) × 10 −5 . Moreover, we reconstruct the process matrices for the single-qubit gates by the gate set tomography (GST), with which we simulate RB sequences and obtain single-qubit fidelities consistent with experimental results. We also observe non-Markovian behavior in the experiment of long-sequence GST, which may provide guidance for further calibration. The demonstration extends the upper limit that the average fidelity of single-qubit gates can reach in a transmon-qubit system, and thus can be an essential step towards practical and reliable quantum computation in the near future.

arXiv:2302.08690•npj Quantum Information•Nov 3, 2023•77 citations

Process verification of two-qubit quantum gates by randomized benchmarking

Antonio D. Corcoles, Jay Gambetta, Jerry M. Chow +5 more

We implement a complete randomized benchmarking protocol on a system of two superconducting qubits. The protocol consists of randomizing over gates in the Clifford group, which experimentally are generated via an improved two-qubit cross-resonance gate implementation and single-qubit unitaries. From this we extract an optimal average error per Clifford operation of $0.0936$. We also perform an interleaved experiment, alternating our optimal two-qubit gate with random two-qubit Clifford gates, to obtain a two-qubit gate error of $0.0653$. We compare these values with a two-qubit gate error of $\ensuremath{\sim}0.12$ obtained from quantum process tomography, which is likely limited by state preparation and measurement errors.

arXiv:1210.7011•Physical Review A•Mar 19, 2013•218 citations

Efficient Measurement of Quantum Gate Error by Interleaved Randomized Benchmarking

Easwar Magesan, Jay Gambetta, Blake Johnson +9 more

We describe a scalable experimental protocol for estimating the average error of individual quantum computational gates. This protocol consists of interleaving random Clifford gates between the gate of interest and provides an estimate as well as theoretical bounds for the average error of the gate under test, so long as the average noise variation over all Clifford gates is small. This technique takes into account both state preparation and measurement errors and is scalable in the number of qubits. We apply this protocol to a superconducting qubit system and find a bounded average error of 0.003 [0,0.016] for the single-qubit gates X(π/2) and Y(π/2). These bounded values provide better estimates of the average error than those extracted via quantum process tomography.

arXiv:1203.4550•Physical Review Letters•Aug 24, 2012•458 citations

Randomized benchmarking of quantum gates

Emanuel H. Knill, Dietrich G. Leibfried, R. Reichle +7 more

A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography. However, standard process tomography is limited by errors in state preparation, measurement and one-qubit gates. It suffers from inefficient scaling with number of qubits and does not detect adverse error-compounding when gates are composed in long sequences. An additional problem is due to the fact that desirable error probabilities for scalable quantum computing are of the order of 0.0001 or lower. Experimentally proving such low errors is challenging. We describe a randomized benchmarking method that yields estimates of the computationally relevant errors without relying on accurate state preparation and measurement. Since it involves long sequences of randomly chosen gates, it also verifies that error behavior is stable when used in long computations. We implemented randomized benchmarking on trapped atomic ion qubits, establishing a one-qubit error probability per randomized $\ensuremath{\pi}/2$ pulse of 0.00482(17) in a particular experiment. We expect this error probability to be readily improved with straightforward technical modifications.

arXiv:0707.0963•Physical Review A•Jan 8, 2008•1,095 citations

Demonstration of robust quantum gate tomography via randomized benchmarking

Blake R Johnson, Marcus Palmer Da Silva, Colm A. Ryan +3 more

Typical quantum gate tomography protocols struggle with a self-consistency problem: the gate operation cannot be reconstructed without knowledge of the initial state and final measurement, but such knowledge cannot be obtained without well-characterized gates. A recently proposed technique, known as randomized benchmarking tomography (RBT), sidesteps this self-consistency problem by designing experiments to be insensitive to preparation and measurement imperfections. We implement this proposal in a superconducting qubit system, using a number of experimental improvements including implementing each of the elements of the Clifford group in single 'atomic' pulses and custom control hardware to enable large overhead protocols. We show a robust reconstruction of several single-qubit quantum gates, including a unitary outside the Clifford group. We demonstrate that RBT yields physical gate reconstructions that are consistent with fidelities obtained by RB.

arXiv:1505.06686•New Journal of Physics•Nov 6, 2015•50 citations

Characterizing errors on qubit operations via iterative randomized benchmarking

Sarah Sheldon, Lev S. Bishop, Easwar Magesan +3 more

With improved gate calibrations reducing unitary errors, we achieve a benchmarked single-qubit gate fidelity of $0.9995\ifmmode\pm\else\textpm\fi{}0.0002$ with superconducting qubits in a circuit quantum electrodynamics system. We present a method for distinguishing between unitary and nonunitary 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 nonunitary errors, 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.

arXiv:1504.06597•Physical Review A•Jan 4, 2016•162 citations
We present measurements of single-qubit gate errors for a superconducting qubit. Results from quantum process tomography and randomized benchmarking are compared with gate errors obtained from a double pi pulse experiment. Randomized benchmarking reveals a minimum average gate error of 1.1+/-0.3% and a simple exponential dependence of fidelity on the number of gates. It shows that the limits on gate fidelity are primarily imposed by qubit decoherence, in agreement with theory.
Abstract Implementing arbitrary single-qubit gates with near perfect fidelity is among the most fundamental requirements in gate-based quantum information processing. In this work, we fabricate a transmon qubit with long coherence times and demonstrate single-qubit gates with the average gate error below 10 −4 , i.e. (7.42 ± 0.04) × 10 −5 by randomized benchmarking (RB). To understand the error sources, we experimentally obtain an error budget, consisting of the decoherence errors lower bounded by (4.62 ± 0.04) × 10 −5 and the leakage rate per gate of (1.16 ± 0.04) × 10 −5 . Moreover, we reconstruct the process matrices for the single-qubit gates by the gate set tomography (GST), with which we simulate RB sequences and obtain single-qubit fidelities consistent with experimental results. We also observe non-Markovian behavior in the experiment of long-sequence GST, which may provide guidance for further calibration. The demonstration extends the upper limit that the average fidelity of single-qubit gates can reach in a transmon-qubit system, and thus can be an essential step towards practical and reliable quantum computation in the near future.
We implement a complete randomized benchmarking protocol on a system of two superconducting qubits. The protocol consists of randomizing over gates in the Clifford group, which experimentally are generated via an improved two-qubit cross-resonance gate implementation and single-qubit unitaries. From this we extract an optimal average error per Clifford operation of 0.09360.09360.0936. We also perform an interleaved experiment, alternating our optimal two-qubit gate with random two-qubit Clifford gates, to obtain a two-qubit gate error of 0.06530.06530.0653. We compare these values with a two-qubit gate error of $\ensuremath{\sim}0.12$ obtained from quantum process tomography, which is likely limited by state preparation and measurement errors.
We describe a scalable experimental protocol for estimating the average error of individual quantum computational gates. This protocol consists of interleaving random Clifford gates between the gate of interest and provides an estimate as well as theoretical bounds for the average error of the gate under test, so long as the average noise variation over all Clifford gates is small. This technique takes into account both state preparation and measurement errors and is scalable in the number of qubits. We apply this protocol to a superconducting qubit system and find a bounded average error of 0.003 [0,0.016] for the single-qubit gates X(π/2) and Y(π/2). These bounded values provide better estimates of the average error than those extracted via quantum process tomography.
A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography. However, standard process tomography is limited by errors in state preparation, measurement and one-qubit gates. It suffers from inefficient scaling with number of qubits and does not detect adverse error-compounding when gates are composed in long sequences. An additional problem is due to the fact that desirable error probabilities for scalable quantum computing are of the order of 0.0001 or lower. Experimentally proving such low errors is challenging. We describe a randomized benchmarking method that yields estimates of the computationally relevant errors without relying on accurate state preparation and measurement. Since it involves long sequences of randomly chosen gates, it also verifies that error behavior is stable when used in long computations. We implemented randomized benchmarking on trapped atomic ion qubits, establishing a one-qubit error probability per randomized $\ensuremath{\pi}/2$ pulse of 0.00482(17) in a particular experiment. We expect this error probability to be readily improved with straightforward technical modifications.
Typical quantum gate tomography protocols struggle with a self-consistency problem: the gate operation cannot be reconstructed without knowledge of the initial state and final measurement, but such knowledge cannot be obtained without well-characterized gates. A recently proposed technique, known as randomized benchmarking tomography (RBT), sidesteps this self-consistency problem by designing experiments to be insensitive to preparation and measurement imperfections. We implement this proposal in a superconducting qubit system, using a number of experimental improvements including implementing each of the elements of the Clifford group in single 'atomic' pulses and custom control hardware to enable large overhead protocols. We show a robust reconstruction of several single-qubit quantum gates, including a unitary outside the Clifford group. We demonstrate that RBT yields physical gate reconstructions that are consistent with fidelities obtained by RB.
With improved gate calibrations reducing unitary errors, we achieve a benchmarked single-qubit gate fidelity of $0.9995\ifmmode\pm\else\textpm\fi{}0.0002$ with superconducting qubits in a circuit quantum electrodynamics system. We present a method for distinguishing between unitary and nonunitary 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 nonunitary errors, 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.