Lifting Multiplicity in Randomized Benchmarking
Abstract
Randomized benchmarking comprises a suite of standard techniques for assessing the operational fidelity of quantum processors. These techniques can be reliably applied to groups with process matrix representations that are free of multiplicity. However, many groups that are naturally formed from native gates do have multiplicity, and it is difficult to draw robust conclusions from the resulting data. In this work, we present a new and intrinsic solution to the problem of multiplicity that completely eliminates the need to fit multi-exponential decays while still remaining robust to errors in state preparation and measurement. Our procedure, which we call lifted randomized benchmarking, generalizes key elements of both character and synthetic randomized benchmarking to benchmark a target group of quantum gates with respect to an enlarged group. We illustrate in numerical examples that our method can efficiently and reliably estimate the fidelity of two-qubit gates relevant to experimental trapped-ion systems. These techniques may find applications beyond randomized benchmarking to quantum tomography and learning, as well as the characterization of error-correcting codes.
Related
- Benchmarking a randomized quantum algorithm for estimating expectation values of molecular observables
- Phase-Altered Interleaved Randomized Benchmarking for Compiled Non-Clifford Gates
- Lifting the mixed to the pure: quantum phases of matter from canonical purification
- Lifting the maximally-entangledness assumption in robust self-testing for synchronous games
- Lifting an [n,k,d] Binary Linear Code to an $[[n,k,d]]$ Quantum Stabilizer Code
BibTeX
@misc{fan2026lifting,
title = {{Lifting Multiplicity in Randomized Benchmarking}},
author = {Yale Fan and J. P. Marceaux},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.03586},
eprint = {2610.03586},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.03586},
}
RIS
TY - UNPB
TI - Lifting Multiplicity in Randomized Benchmarking
AU - Yale Fan
AU - J. P. Marceaux
PY - 2026
DA - 2026/10/02
PB - arXiv
DO - 10.48550/arxiv.2610.03586
UR - https://arxiv.org/abs/2610.03586
AB - Randomized benchmarking comprises a suite of standard techniques for assessing the operational fidelity of quantum processors. These techniques can be reliably applied to groups with process matrix representations that are free of multiplicity. However, many groups that are naturally formed from native gates do have multiplicity, and it is difficult to draw robust conclusions from the resulting data. In this work, we present a new and intrinsic solution to the problem of multiplicity that completely eliminates the need to fit multi-exponential decays while still remaining robust to errors in state preparation and measurement. Our procedure, which we call lifted randomized benchmarking, generalizes key elements of both character and synthetic randomized benchmarking to benchmark a target group of quantum gates with respect to an enlarged group. We illustrate in numerical examples that our method can efficiently and reliably estimate the fidelity of two-qubit gates relevant to experimental trapped-ion systems. These techniques may find applications beyond randomized benchmarking to quantum tomography and learning, as well as the characterization of error-correcting codes.
ER -