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:2510.09508

Subspace Leakage Error Randomized Benchmarking of Mølmer-Sørensen Gates

R. T. Sutherland, A. C. Hughes, J. P. Marceaux, H. M. Knaack, Clemens Löschnauer, R. Srinivas

Published Oct 10, 2025• 3 citations
arXivHTMLPDF

Abstract

We demonstrate a new technique that adapts single-qubit randomized benchmarking to two-qubit Mølmer-Sørensen gates. We use the controllable gate phase to generate Cliffords that act on a two-state subspace, enabling benchmarking of two-qubit gates without single-qubit operations. In addition to quantifying the gate infidelity, the protocol provides valuable information about the type of error by distinguishing between those that conserve the two-state subspace and those that result in leakage out of it. We demonstrate the protocol for calibrating and validating all-electronic maximally entangling gates in a trapped-ion quantum computer, achieving a two-qubit gate error of $2.6 (2)\times10^{-4}$.

DOI
10.48550/arxiv.2510.09508

Related papers

Randomized Benchmarking of Multiqubit Gates

John Gaebler, Adam M. Meier, Ting Rei Tan +8 more

We describe an extension of single-qubit gate randomized benchmarking that measures the error of multiqubit gates in a quantum information processor. This platform-independent protocol evaluates the performance of Clifford unitaries, which form a basis of fault-tolerant quantum computing. We implemented the benchmarking protocol with trapped ions and found an error per random two-qubit Clifford unitary of 0.162±0.008, thus setting the first benchmark for such unitaries. By implementing a second set of sequences with an extra two-qubit phase gate inserted after each step, we extracted an error per phase gate of 0.069±0.017. We conducted these experiments with transported, sympathetically cooled ions in a multizone Paul trap-a system that can in principle be scaled to larger numbers of ions.

arXiv:1203.3733•Physical Review Letters•Jun 26, 2012•133 citations

Character Randomized Benchmarking for Non-Multiplicity-Free Groups With Applications to Subspace, Leakage, and Matchgate Randomized Benchmarking

Jahan Claes, Eleanor Gilbert Rieffel, Zhihui Wang

Randomized benchmarking (RB) is a powerful method for determining the error rate of experimental quantum gates.Traditional RB, however, is restricted to gatesets, such as the Clifford group, that form a unitary 2-design.The recently introduced character RB can benchmark more general gates using techniques from representation theory; up to now, however, this method has only been applied to "multiplicity-free" groups, a mathematical restriction on these groups.In this paper, we extend the original character RB derivation to explicitly treat non-multiplicity-free groups, and derive several applications.First, we derive a rigorous version of the recently introduced subspace RB, which seeks to characterize a set of one-and two-qubit gates that are symmetric under SWAP.Second, we develop a new leakage RB protocol that applies to more general groups of gates.Finally, we derive a scalable RB protocol for the matchgate group, a group that like the Clifford group is nonuniversal but becomes universal with the addition of one additional gate.This example provides one of the few examples of a scalable non-Clifford RB protocol.In all three cases, compared to existing theories, our method requires similar resources, but either provides a more accurate estimate of gate fidelity, or applies to a more general group of gates.In conclusion, we discuss the potential, and challenges, of using non-multiplicity-free character RB to develop new classes of scalable RB protocols and methods of characterizing specific gates.

arXiv:2011.00007•PRX Quantum•Mar 25, 2021•27 citations

Leakage Benchmarking for Universal Gate Sets

Bujiao Wu, Xiaoyang Wang, Xiao Yuan +2 more

Errors are common issues in quantum computing platforms, among which leakage is one of the most-challenging to address. This is because leakage, i.e., the loss of information stored in the computational subspace to undesired subspaces in a larger Hilbert space, is more difficult to detect and correct than errors that preserve the computational subspace. As a result, leakage presents a significant obstacle to the development of fault-tolerant quantum computation. In this paper, we propose an efficient and accurate benchmarking framework called leakage randomized benchmarking (LRB), for measuring leakage rates on multi-qubit quantum systems. Our approach is more insensitive to state preparation and measurement (SPAM) noise than existing leakage benchmarking protocols, requires fewer assumptions about the gate set itself, and can be used to benchmark multi-qubit leakages, which has not been achieved previously. We also extended the LRB protocol to an interleaved variant called interleaved LRB (iLRB), which can benchmark the average leakage rate of generic n-site quantum gates with reasonable noise assumptions. We demonstrate the iLRB protocol on benchmarking generic two-qubit gates realized using flux tuning and analyzed the behavior of iLRB under corresponding leakage models. Our numerical experiments showed good agreement with the theoretical estimations, indicating the feasibility of both the LRB and iLRB protocols.

arXiv:2304.07884•Entropy•Jan 13, 2024•3 citations

Quantification and characterization of leakage errors

Christopher J. Wood, Jay 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 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.

arXiv:1704.03081•Physical Review A•Mar 8, 2018•187 citations

Complete randomized benchmarking protocol accounting for leakage errors

Tobias Chasseur, Frank K. Wilhelm

Randomized benchmarking allows one to efficiently and scalably characterize the average error of a unitary 2-design such as the Clifford group $\mathcal{C}$ on a physical candidate for quantum computation, as long as there are no noncomputational leakage levels in the system. We investigate the effect of leakage errors on randomized benchmarking induced from an additional level per physical qubit and provide a modified protocol that allows us to derive reliable estimates for the error per gate in their presence. We assess the variance of the sequence fidelity corresponding to the number of random sequences needed for valid fidelity estimation. Our protocol allows for gate-dependent error channels without being restricted to perturbations. We show that our protocol is compatible with interleaved randomized benchmarking and expand to benchmarking of arbitrary gates. This setting is relevant for superconducting transmon qubits, among other systems.

arXiv:1505.00580•Physical Review A•Oct 30, 2015•41 citations

Mitigating qubit leakage errors in quantum circuits with gadgets and post-selection

Karl Mayer

Leakage is a quantum error process in which a qubit ends up in a state outside of the computational subspace. In trapped-ion hyperfine qubits, leakage can occur as a result of spontaneous emission from an excited state during a two-qubit gate. This error can be detected by a circuit gadget that couples a data qubit to an ancilla qubit, followed by a measurement of the ancilla. The effects of leakage errors on the circuit can then be removed by post-selecting shots in which leakage was not detected. We first experimentally demonstrate improved two-qubit gate fidelity as measured by randomized benchmarking and cycle benchmarking. We then benchmark the use of leakage detection on system-level mirror benchmarking circuits. Finally, we present a protocol to measure the failure rate of the leakage detection gadget, defined as the probability that the gadget produces an error on the data qubit while not heralding the ancilla.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•0 citations
We demonstrate a new technique that adapts single-qubit randomized benchmarking to two-qubit Mølmer-Sørensen gates. We use the controllable gate phase to generate Cliffords that act on a two-state subspace, enabling benchmarking of two-qubit gates without single-qubit operations. In addition to quantifying the gate infidelity, the protocol provides valuable information about the type of error by distinguishing between those that conserve the two-state subspace and those that result in leakage out of it. We demonstrate the protocol for calibrating and validating all-electronic maximally entangling gates in a trapped-ion quantum computer, achieving a two-qubit gate error of 2.6(2)×10−42.6 (2)\times10^{-4}2.6(2)×10−4.
We describe an extension of single-qubit gate randomized benchmarking that measures the error of multiqubit gates in a quantum information processor. This platform-independent protocol evaluates the performance of Clifford unitaries, which form a basis of fault-tolerant quantum computing. We implemented the benchmarking protocol with trapped ions and found an error per random two-qubit Clifford unitary of 0.162±0.008, thus setting the first benchmark for such unitaries. By implementing a second set of sequences with an extra two-qubit phase gate inserted after each step, we extracted an error per phase gate of 0.069±0.017. We conducted these experiments with transported, sympathetically cooled ions in a multizone Paul trap-a system that can in principle be scaled to larger numbers of ions.
Randomized benchmarking (RB) is a powerful method for determining the error rate of experimental quantum gates.Traditional RB, however, is restricted to gatesets, such as the Clifford group, that form a unitary 2-design.The recently introduced character RB can benchmark more general gates using techniques from representation theory; up to now, however, this method has only been applied to "multiplicity-free" groups, a mathematical restriction on these groups.In this paper, we extend the original character RB derivation to explicitly treat non-multiplicity-free groups, and derive several applications.First, we derive a rigorous version of the recently introduced subspace RB, which seeks to characterize a set of one-and two-qubit gates that are symmetric under SWAP.Second, we develop a new leakage RB protocol that applies to more general groups of gates.Finally, we derive a scalable RB protocol for the matchgate group, a group that like the Clifford group is nonuniversal but becomes universal with the addition of one additional gate.This example provides one of the few examples of a scalable non-Clifford RB protocol.In all three cases, compared to existing theories, our method requires similar resources, but either provides a more accurate estimate of gate fidelity, or applies to a more general group of gates.In conclusion, we discuss the potential, and challenges, of using non-multiplicity-free character RB to develop new classes of scalable RB protocols and methods of characterizing specific gates.
Errors are common issues in quantum computing platforms, among which leakage is one of the most-challenging to address. This is because leakage, i.e., the loss of information stored in the computational subspace to undesired subspaces in a larger Hilbert space, is more difficult to detect and correct than errors that preserve the computational subspace. As a result, leakage presents a significant obstacle to the development of fault-tolerant quantum computation. In this paper, we propose an efficient and accurate benchmarking framework called leakage randomized benchmarking (LRB), for measuring leakage rates on multi-qubit quantum systems. Our approach is more insensitive to state preparation and measurement (SPAM) noise than existing leakage benchmarking protocols, requires fewer assumptions about the gate set itself, and can be used to benchmark multi-qubit leakages, which has not been achieved previously. We also extended the LRB protocol to an interleaved variant called interleaved LRB (iLRB), which can benchmark the average leakage rate of generic n-site quantum gates with reasonable noise assumptions. We demonstrate the iLRB protocol on benchmarking generic two-qubit gates realized using flux tuning and analyzed the behavior of iLRB under corresponding leakage models. Our numerical experiments showed good agreement with the theoretical estimations, indicating the feasibility of both the LRB and iLRB protocols.
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 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.
Randomized benchmarking allows one to efficiently and scalably characterize the average error of a unitary 2-design such as the Clifford group C\mathcal{C}C on a physical candidate for quantum computation, as long as there are no noncomputational leakage levels in the system. We investigate the effect of leakage errors on randomized benchmarking induced from an additional level per physical qubit and provide a modified protocol that allows us to derive reliable estimates for the error per gate in their presence. We assess the variance of the sequence fidelity corresponding to the number of random sequences needed for valid fidelity estimation. Our protocol allows for gate-dependent error channels without being restricted to perturbations. We show that our protocol is compatible with interleaved randomized benchmarking and expand to benchmarking of arbitrary gates. This setting is relevant for superconducting transmon qubits, among other systems.
Leakage is a quantum error process in which a qubit ends up in a state outside of the computational subspace. In trapped-ion hyperfine qubits, leakage can occur as a result of spontaneous emission from an excited state during a two-qubit gate. This error can be detected by a circuit gadget that couples a data qubit to an ancilla qubit, followed by a measurement of the ancilla. The effects of leakage errors on the circuit can then be removed by post-selecting shots in which leakage was not detected. We first experimentally demonstrate improved two-qubit gate fidelity as measured by randomized benchmarking and cycle benchmarking. We then benchmark the use of leakage detection on system-level mirror benchmarking circuits. Finally, we present a protocol to measure the failure rate of the leakage detection gadget, defined as the probability that the gadget produces an error on the data qubit while not heralding the ancilla.