arXiv:2610.03586
Lifting Multiplicity in Randomized Benchmarking
Yale Fan, J. P. Marceaux
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.
AI Summary
Randomized benchmarking (RB) of a general gate group produces matrix-valued decays when its conjugation representation contains repeated irreducible representations. Character-based filtering isolates isotypic sectors but generally leaves multi-exponential signals. This paper proposes “lifted RB” to reconstruct the multiplicity-space dynamics while retaining robustness to state-preparation and measurement (SPAM) errors. The protocol embeds the benchmarking group $G$ in a larger group $F$, with each target isotypic sector contained in a multiplicity-free irrep of $F$. Representation-weighted post-processing synthesizes operators at both ends of random $G$ sequences, isolating entries of $M_\lambda^{m-1}M'_\lambda$, where $M_\lambda$ describes twirled benchmarking noise and $M'_\lambda$ describes boundary-gate noise. Matrix reconstruction, diagonalization, and decay fitting replace scalar multi-exponential fitting; consecutive-length matrix ratios also recover the spectrum when boundary noise differs. The construction follows from representation-theoretic completeness and twirling identities. The identity component requires separate treatment using trace preservation. Numerical demonstrations cover a two-qubit ZZ group with multiplicities $8,4,4$, lifted to the Clifford group, and a 96-element projective Mølmer–Sørensen group, lifted to $SU(4)$. Simulations use mixed coherent and Pauli-stochastic noise and depths up to 64; a ZZ test uses boundary-gate infidelity $0.03$. Efficiency depends on lifting-irrep dimensions, SPAM overlaps, and multiplicities; reconstruction has quadratic dependence on multiplicity. Choosing the full unitary group gives lifting dimension $4^n-1$ and is not scalable under the stated bounds. The analysis assumes gate-independent noise within each gate class. Systematic gate-dependent-noise guarantees, precision bounds, and the effect of substantially noisier lifting gates remain open.
Error found: The reconstruction guarantees assume gate-independent benchmarking and lifting noise, a qualification omitted from the abstract, while systematic gate-dependent-noise guarantees are left to future work. The experimental protocol fits matrices to c A^m even though distinct lifting noise produces c M^(m-1) B with a generally nonscalar matrix B, potentially biasing the prescribed estimator despite the valid alternative matrix-ratio reconstruction.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 38 pages, 5 figures