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

Physica B Condensed Matter

Leakage and fidelity of real qubits

Rosario Fazio, G. Massimo Palma, Emilio Sciacca, Jens Siewert

Published Jul 1, 2000• 0 citations
Publisher
DOI
10.1016/s0921-4526(99)03034-3

Related papers

Fast Quantum Gate Design with Deep Reinforcement Learning Using Real-Time Feedback on Readout Signals

Emily Wright, Rogério de Sousa

The design of high-fidelity quantum gates is difficult because it requires the optimization of two competing effects, namely maximizing gate speed and minimizing leakage out of the qubit subspace. We propose a deep reinforcement learning algorithm that uses two agents to address the speed and leakage challenges simultaneously. The first agent constructs the qubit in-phase control pulse using a policy learned from rewards that compensate short gate times. The rewards are obtained at intermediate time steps throughout the construction of a full-length pulse, allowing the agent to explore the landscape of shorter pulses. The second agent determines an out-of-phase pulse to target leakage. Both agents are trained on real-time data from noisy hardware, thus providing model-free gate design that adapts to unpredictable hardware noise. To reduce the effect of measurement classification errors, the agents are trained directly on the readout signal from probing the qubit. We present proof-of-concept experiments by designing X and square root of X gates of various durations on IBM hardware. After just 200 training iterations, our algorithm is able to construct novel control pulses up to two times faster than the default IBM gates, while matching their performance in terms of state fidelity and leakage rate. As the length of our custom control pulses increases, they begin to outperform the default gates. Improvements to the speed and fidelity of gate operations open the way for higher circuit depth in quantum simulation, quantum chemistry and other algorithms on near-term and future quantum devices.

arXiv:2305.01169•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•6 citations

Aspects of Qubit Dynamics in the Presence of Leakage

Jens Siewert, Rosario Fazio, G. Massimo Palma +1 more

Journal of Low Temperature Physics•Mar 1, 2000•37 citations

Average fidelity in n-qubit systems

Renán Cabrera, W. E. Baylis

arXiv:quant-ph/0701084•Physics Letters A•Apr 2, 2007•29 citations

Benchmarking the Readout of a Superconducting Qubit for Repeated Measurements

Sumeru Hazra, Wei Dai, Thomas Connolly +4 more

Readout of superconducting qubits faces a trade-off between measurement speed and unwanted backaction on the qubit caused by the readout drive, such as T_{1} degradation and leakage out of the computational subspace. The readout is typically benchmarked by integrating the readout signal and choosing a binary threshold to extract the "readout fidelity." We show that readout fidelity may significantly overlook readout-induced leakage errors. Such errors are detrimental for applications that rely on continuously repeated measurements, e.g., quantum error correction. We introduce a method to measure the readout-induced leakage rate by repeatedly executing a composite operation-a readout preceded by a randomized qubit flip. We apply this technique to characterize the readout of a superconducting qubit, optimized for fidelity across four different readout durations. Our technique highlights the importance of an independent leakage characterization by showing that the leakage rates vary from 0.12% to 7.76% across these readouts even though the fidelity exceeds 99.5% in all four cases.

arXiv:2407.10934•Physical Review Letters•Mar 13, 2025•38 citations

Valley leakage and gate timing errors in SWAP operations of Si-based spin qubits.

Nathan L. Foulk, Robert E. Throckmorton, S. Das Sarma

We investigate the fidelity of a sequence of SWAP gates on a Si-based quantum dot (QD) spin qubit chain. We particularly examine how valley leakage and gate timing error affect the gate fidelity compared to charge noise, which is always present. In our Hamiltonian, each qubit is coupled via Heisenberg exchange to every other qubit in the chain, with the strength of the exchange interaction decreasing exponentially with qubit distance. Valley leakage is modeled through a dissipation term $\gamma$ as appropriate for the experimentally observed intervalley tunneling effect. We show that randomness in the valley leakage parameter has little to no effect on the SWAP gate fidelity in the currently fabricated Si circuits. We introduce disorder in the forms of charge noise and gate timing error and average the fidelities of 10,000 calculations for each set of parameters. The fidelities are then plotted against $J_\text{SWAP}$, the strength of the exchange coupling corresponding to the SWAP gate. We find that valley leakage decreases the fidelity of the SWAP operation -- though the effect is small compared to that of the known charge noise -- and that gate timing error creates an effective optimal value of $J_\text{SWAP}$, beyond which infidelity begins to increase.

•Oct 21, 2021•0 citations

Leakage benchmarking with decohering subgroups in the presence of preparation and measurement errors

Shawn Geller, Tongyu Zhao, Alex Kwiatkowski +3 more

A common problem with physical qubits is that the state can leak outside the computational subspace. To characterize the problem, it is desirable to measure both the leakage probability and the fidelity of gates inside the computational subspace. Randomized benchmarking is a readily accessible method for estimating average gate fidelities and can be modified to account for leakage. However, in the presence of state preparation and measurement errors (SPAM) there are parameter degeneracies, and fidelities and leakage become underdetermined. We study the example of qudits with any number of leakage levels under the assumption of gate-independent noise. We show that randomized benchmarking sequences with leakage level decoherence can be analyzed as a Markov process with noisy classical preparations and measurements. This result generalizes to randomized benchmarking with random gates from an arbitrary group that contains a phase-decohering subgroup. We characterize the parameter degeneracy in inferring the Markov process, preparations and measurements. Based on this characterization we develop a measurement and inference method taking advantage of known conservative bounds on SPAM to constrain fidelity, leakage and other parameters of the Markov process, state preparations and measurements. As part of our study, we experimentally implemented the measurement method for a qubit defined on the one-excitation subspace of two transmons, for which there are two leakage levels. We determined confidence intervals accounting for parameter degeneracy for a number of performance parameters of the system. For leakage and fidelity, we compare these intervals to those obtained for several conventional methods for leakage benchmarking.

quant-pharXiv:2610.19304•Oct 15, 2026•0 citations
The design of high-fidelity quantum gates is difficult because it requires the optimization of two competing effects, namely maximizing gate speed and minimizing leakage out of the qubit subspace. We propose a deep reinforcement learning algorithm that uses two agents to address the speed and leakage challenges simultaneously. The first agent constructs the qubit in-phase control pulse using a policy learned from rewards that compensate short gate times. The rewards are obtained at intermediate time steps throughout the construction of a full-length pulse, allowing the agent to explore the landscape of shorter pulses. The second agent determines an out-of-phase pulse to target leakage. Both agents are trained on real-time data from noisy hardware, thus providing model-free gate design that adapts to unpredictable hardware noise. To reduce the effect of measurement classification errors, the agents are trained directly on the readout signal from probing the qubit. We present proof-of-concept experiments by designing X and square root of X gates of various durations on IBM hardware. After just 200 training iterations, our algorithm is able to construct novel control pulses up to two times faster than the default IBM gates, while matching their performance in terms of state fidelity and leakage rate. As the length of our custom control pulses increases, they begin to outperform the default gates. Improvements to the speed and fidelity of gate operations open the way for higher circuit depth in quantum simulation, quantum chemistry and other algorithms on near-term and future quantum devices.
Readout of superconducting qubits faces a trade-off between measurement speed and unwanted backaction on the qubit caused by the readout drive, such as T_{1} degradation and leakage out of the computational subspace. The readout is typically benchmarked by integrating the readout signal and choosing a binary threshold to extract the "readout fidelity." We show that readout fidelity may significantly overlook readout-induced leakage errors. Such errors are detrimental for applications that rely on continuously repeated measurements, e.g., quantum error correction. We introduce a method to measure the readout-induced leakage rate by repeatedly executing a composite operation-a readout preceded by a randomized qubit flip. We apply this technique to characterize the readout of a superconducting qubit, optimized for fidelity across four different readout durations. Our technique highlights the importance of an independent leakage characterization by showing that the leakage rates vary from 0.12% to 7.76% across these readouts even though the fidelity exceeds 99.5% in all four cases.
We investigate the fidelity of a sequence of SWAP gates on a Si-based quantum dot (QD) spin qubit chain. We particularly examine how valley leakage and gate timing error affect the gate fidelity compared to charge noise, which is always present. In our Hamiltonian, each qubit is coupled via Heisenberg exchange to every other qubit in the chain, with the strength of the exchange interaction decreasing exponentially with qubit distance. Valley leakage is modeled through a dissipation term γ\gammaγ as appropriate for the experimentally observed intervalley tunneling effect. We show that randomness in the valley leakage parameter has little to no effect on the SWAP gate fidelity in the currently fabricated Si circuits. We introduce disorder in the forms of charge noise and gate timing error and average the fidelities of 10,000 calculations for each set of parameters. The fidelities are then plotted against JSWAPJ_\text{SWAP}JSWAP​, the strength of the exchange coupling corresponding to the SWAP gate. We find that valley leakage decreases the fidelity of the SWAP operation -- though the effect is small compared to that of the known charge noise -- and that gate timing error creates an effective optimal value of JSWAPJ_\text{SWAP}JSWAP​, beyond which infidelity begins to increase.
A common problem with physical qubits is that the state can leak outside the computational subspace. To characterize the problem, it is desirable to measure both the leakage probability and the fidelity of gates inside the computational subspace. Randomized benchmarking is a readily accessible method for estimating average gate fidelities and can be modified to account for leakage. However, in the presence of state preparation and measurement errors (SPAM) there are parameter degeneracies, and fidelities and leakage become underdetermined. We study the example of qudits with any number of leakage levels under the assumption of gate-independent noise. We show that randomized benchmarking sequences with leakage level decoherence can be analyzed as a Markov process with noisy classical preparations and measurements. This result generalizes to randomized benchmarking with random gates from an arbitrary group that contains a phase-decohering subgroup. We characterize the parameter degeneracy in inferring the Markov process, preparations and measurements. Based on this characterization we develop a measurement and inference method taking advantage of known conservative bounds on SPAM to constrain fidelity, leakage and other parameters of the Markov process, state preparations and measurements. As part of our study, we experimentally implemented the measurement method for a qubit defined on the one-excitation subspace of two transmons, for which there are two leakage levels. We determined confidence intervals accounting for parameter degeneracy for a number of performance parameters of the system. For leakage and fidelity, we compare these intervals to those obtained for several conventional methods for leakage benchmarking.