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

Randomized Benchmarking, Correlated Noise, and Ising Models

Bryan H. Fong, Seth Merkel

Published Mar 28, 2017• 23 citations
arXivHTMLPDF

Abstract

We compute the expected randomized benchmarking sequence fidelity for a system subject to Gaussian time-correlated noise. For single qubit benchmarking we show that the expected sequence fidelity is given by the partition function of a long-range coupled spin-one Ising model, with each site in the Ising model corresponding to a free evolution interval. For d-state systems, the expected sequence fidelity is given by an Ising-like model partition function whose site variables are given by the weights of the adjoint representation of SU(d). A high effective temperature expansion for the partition function in the single qubit case shows decay of sequence fidelity varying from exponential for uncorrelated noise to a power law for quasistatic noise. Fitting an exponential to the sequence fidelity decay under correlated noise gives unreliable estimates of the average gate error rate.

DOI
10.48550/arxiv.1703.09747

Related papers

Randomized benchmarking in the presence of time-correlated dephasing noise

Jiaan Qi, Hui Khoon Ng

Randomized benchmarking (RB) has emerged as a popular and easy-to-implement experimental technique for gauging the quality of gate operations in quantum computing devices. A typical randomized benchmarking procedure identifies the exponential decay in the fidelity as the benchmarking sequence of gates increases in length, and the decay rate is used to estimate the fidelity of the gate. Our current theory of RB, based on the assumption of time-independent or static noise in the gates, predicts an exponential decay in the fidelity. Observed deviations from the standard exponential decay are usually attributed to some amount of time correlations in the noise, though the precise mechanisms for deviation have yet to be fully explored. In this paper, we examine this question of randomized benchmarking for time-correlated noise---specifically for time-correlated dephasing noise for exact solvability---and elucidate the circumstances in which a deviation from exponential decay can be expected, as well as point out situations where exponential decay prevails despite the presence of time correlations.

arXiv:2010.11498•Physical Review A•Feb 15, 2021•9 citations

Blind spots of randomized benchmarking under temporal correlations

Varun Srivastava, Abhinash Kumar Roy, Soumik Mahanti +3 more

Randomized benchmarking (RB) is a widely adopted protocol for estimating the average gate fidelity in quantum hardware. However, its standard formulation relies on the assumption of temporally uncorrelated noise, an assumption often violated in current devices. In this work, we derive analytic expressions for the average sequence fidelity (ASF) in the presence of temporally correlated (non-Markovian) noise with classical memory, including cases where such correlations originate from interactions with a quantum environment. We show how the ASF can be interpreted to extract meaningful benchmarking parameters under such noise and identify classes of interaction Hamiltonians that render temporal correlations completely invisible to RB. We further provide operational criteria for witnessing temporal correlations due to quantum memory through RB experiments. Importantly, while classical correlations may remain undetectable in the ASF data, they can nonetheless significantly affect worst-case errors quantified by the diamond norm, a metric central to fault-tolerant quantum computing. In particular, we demonstrate that temporal correlations may suppress worst-case errors, highlighting that temporal correlations may not always have detrimental effects on gate performance.

arXiv:2510.13051•Physical Review Research•May 10, 2026•4 citations

From randomized benchmarking experiments to gate-set circuit fidelity: how to interpret randomized benchmarking decay parameters

Arnaud Carignan-Dugas, Kristine Boone, Joel J. Wallman +1 more

Randomized benchmarking (RB) protocols have become an essential tool for providing a meaningful partial characterization of experimental quantum operations. While the RB decay rate is known to enable estimates of the average fidelity of those operations under gate-independent Markovian noise, under gate-dependent noise this rate is more difficult to interpret rigorously. In this paper, we prove that single-qubit RB decay parameter p coincides with the decay parameter of the gate-set circuit fidelity , a novel figure of merit which characterizes the expected average fidelity over arbitrary circuits of operations from the gate-set. We also prove that, in the limit of high-fidelity single-qubit experiments, the possible alarming disconnect between the average gate fidelity and RB experimental results is simply explained by a basis mismatch between the gates and the state-preparation and measurement procedures, that is, to a unitary degree of freedom in labeling the Pauli matrices. Based on numerical evidence and physically motivated arguments, we conjecture that these results also hold for higher dimensions.

arXiv:1804.01122•New Journal of Physics•Aug 24, 2018•33 citations

Scalable and Robust Randomized Benchmarking of Quantum Processes

Easwar Magesan, Jay Gambetta, Joseph Emerson

In this Letter we propose a fully scalable randomized benchmarking protocol for quantum information processors. We prove that the protocol provides an efficient and reliable estimate of the average error-rate for a set operations (gates) under a very general noise model that allows for both time and gate-dependent errors. In particular we obtain a sequence of fitting models for the observable fidelity decay as a function of a (convergent) perturbative expansion of the gate errors about the mean error. We illustrate the protocol through numerical examples.

arXiv:1009.3639•Physical Review Letters•May 6, 2011•803 citations

The Impact of Markovian Errors on Random Circuits

Anthony M. Polloreno, Timothy Proctor, Robin Blume-Kohout

Randomized benchmarking (RB) returns a single decay parameter or gate error rate, but when the noise is gate-dependent that parameter is notoriously difficult to interpret. We study RB and related random-circuit benchmarks under small gate-local Markovian noise by factorizing each noisy gate into its ideal action followed by the exponential of a small error generator and then perturbing the RB $\mathscr{L}$ matrix, which models the RB decay. For any low-error gate set that satisfies the requirements of RB (it is a sequence-asymptotic unitary 2-design), we show that Pauli-stochastic error rates contribute linearly to the RB decay parameter, while Hamiltonian error rates contribute through a gauge-invariant quadratic form. Pauli-correlation and active generators are absent from the linear term and enter only at higher order. For the single-qubit native gate set $\{X_{π/2},Y_{π/2}\}$ we derive this quadratic form explicitly in terms of three first-order gauge-invariant (FOGI) coordinates: the two intrinsic over-rotations and one relational axis-tilt error. The resulting formula explains the dependence of DRB on the sampling distribution and the compilation dependence of CRB. These results turn RB decay rates into interpretable functions of experimentally meaningful elementary error rates.

quant-pharXiv:2610.31500•Oct 23, 2026•0 citations

Multiqubit randomized benchmarking using few samples

Jonas Helsen, Joel J. Wallman, Steven T. Flammia +1 more

Randomized benchmarking (RB) is an efficient and robust method to characterize gate errors in quantum circuits. Averaging over random sequences of gates leads to estimates of gate errors in terms of the average fidelity. These estimates are isolated from the state preparation and measurement errors that plague other methods such as channel tomography and direct fidelity estimation. A decisive factor in the feasibility of randomized benchmarking is the number of sampled sequences required to obtain rigorous confidence intervals. Previous bounds were either prohibitively loose or required the number of sampled sequences to scale exponentially with the number of qubits in order to obtain a fixed confidence interval at a fixed error rate. Here, we show that, with a small adaptation to the randomized benchmarking procedure, the number of sampled sequences required for a fixed confidence interval is dramatically smaller than could previously be justified. In particular, we show that the number of sampled sequences required is essentially independent of the number of qubits and scales favorably with the average error rate of the system under investigation. We also investigate the fitting procedure inherent to randomized benchmarking in light of our results and find that standard methods such as ordinary least squares optimization can give misleading results. We therefore recommend moving to more sophisticated fitting methods such as iteratively reweighted least squares optimization. Our results bring rigorous randomized benchmarking on systems with many qubits into the realm of experimental feasibility.

arXiv:1701.04299•Physical Review A•Sep 3, 2019•61 citations
We compute the expected randomized benchmarking sequence fidelity for a system subject to Gaussian time-correlated noise. For single qubit benchmarking we show that the expected sequence fidelity is given by the partition function of a long-range coupled spin-one Ising model, with each site in the Ising model corresponding to a free evolution interval. For d-state systems, the expected sequence fidelity is given by an Ising-like model partition function whose site variables are given by the weights of the adjoint representation of SU(d). A high effective temperature expansion for the partition function in the single qubit case shows decay of sequence fidelity varying from exponential for uncorrelated noise to a power law for quasistatic noise. Fitting an exponential to the sequence fidelity decay under correlated noise gives unreliable estimates of the average gate error rate.
Randomized benchmarking (RB) has emerged as a popular and easy-to-implement experimental technique for gauging the quality of gate operations in quantum computing devices. A typical randomized benchmarking procedure identifies the exponential decay in the fidelity as the benchmarking sequence of gates increases in length, and the decay rate is used to estimate the fidelity of the gate. Our current theory of RB, based on the assumption of time-independent or static noise in the gates, predicts an exponential decay in the fidelity. Observed deviations from the standard exponential decay are usually attributed to some amount of time correlations in the noise, though the precise mechanisms for deviation have yet to be fully explored. In this paper, we examine this question of randomized benchmarking for time-correlated noise---specifically for time-correlated dephasing noise for exact solvability---and elucidate the circumstances in which a deviation from exponential decay can be expected, as well as point out situations where exponential decay prevails despite the presence of time correlations.
Randomized benchmarking (RB) is a widely adopted protocol for estimating the average gate fidelity in quantum hardware. However, its standard formulation relies on the assumption of temporally uncorrelated noise, an assumption often violated in current devices. In this work, we derive analytic expressions for the average sequence fidelity (ASF) in the presence of temporally correlated (non-Markovian) noise with classical memory, including cases where such correlations originate from interactions with a quantum environment. We show how the ASF can be interpreted to extract meaningful benchmarking parameters under such noise and identify classes of interaction Hamiltonians that render temporal correlations completely invisible to RB. We further provide operational criteria for witnessing temporal correlations due to quantum memory through RB experiments. Importantly, while classical correlations may remain undetectable in the ASF data, they can nonetheless significantly affect worst-case errors quantified by the diamond norm, a metric central to fault-tolerant quantum computing. In particular, we demonstrate that temporal correlations may suppress worst-case errors, highlighting that temporal correlations may not always have detrimental effects on gate performance.
Randomized benchmarking (RB) protocols have become an essential tool for providing a meaningful partial characterization of experimental quantum operations. While the RB decay rate is known to enable estimates of the average fidelity of those operations under gate-independent Markovian noise, under gate-dependent noise this rate is more difficult to interpret rigorously. In this paper, we prove that single-qubit RB decay parameter p coincides with the decay parameter of the gate-set circuit fidelity , a novel figure of merit which characterizes the expected average fidelity over arbitrary circuits of operations from the gate-set. We also prove that, in the limit of high-fidelity single-qubit experiments, the possible alarming disconnect between the average gate fidelity and RB experimental results is simply explained by a basis mismatch between the gates and the state-preparation and measurement procedures, that is, to a unitary degree of freedom in labeling the Pauli matrices. Based on numerical evidence and physically motivated arguments, we conjecture that these results also hold for higher dimensions.
In this Letter we propose a fully scalable randomized benchmarking protocol for quantum information processors. We prove that the protocol provides an efficient and reliable estimate of the average error-rate for a set operations (gates) under a very general noise model that allows for both time and gate-dependent errors. In particular we obtain a sequence of fitting models for the observable fidelity decay as a function of a (convergent) perturbative expansion of the gate errors about the mean error. We illustrate the protocol through numerical examples.
Randomized benchmarking (RB) returns a single decay parameter or gate error rate, but when the noise is gate-dependent that parameter is notoriously difficult to interpret. We study RB and related random-circuit benchmarks under small gate-local Markovian noise by factorizing each noisy gate into its ideal action followed by the exponential of a small error generator and then perturbing the RB L\mathscr{L}L matrix, which models the RB decay. For any low-error gate set that satisfies the requirements of RB (it is a sequence-asymptotic unitary 2-design), we show that Pauli-stochastic error rates contribute linearly to the RB decay parameter, while Hamiltonian error rates contribute through a gauge-invariant quadratic form. Pauli-correlation and active generators are absent from the linear term and enter only at higher order. For the single-qubit native gate set {Xπ/2,Yπ/2}\{X_{π/2},Y_{π/2}\}{Xπ/2​,Yπ/2​} we derive this quadratic form explicitly in terms of three first-order gauge-invariant (FOGI) coordinates: the two intrinsic over-rotations and one relational axis-tilt error. The resulting formula explains the dependence of DRB on the sampling distribution and the compilation dependence of CRB. These results turn RB decay rates into interpretable functions of experimentally meaningful elementary error rates.
Randomized benchmarking (RB) is an efficient and robust method to characterize gate errors in quantum circuits. Averaging over random sequences of gates leads to estimates of gate errors in terms of the average fidelity. These estimates are isolated from the state preparation and measurement errors that plague other methods such as channel tomography and direct fidelity estimation. A decisive factor in the feasibility of randomized benchmarking is the number of sampled sequences required to obtain rigorous confidence intervals. Previous bounds were either prohibitively loose or required the number of sampled sequences to scale exponentially with the number of qubits in order to obtain a fixed confidence interval at a fixed error rate. Here, we show that, with a small adaptation to the randomized benchmarking procedure, the number of sampled sequences required for a fixed confidence interval is dramatically smaller than could previously be justified. In particular, we show that the number of sampled sequences required is essentially independent of the number of qubits and scales favorably with the average error rate of the system under investigation. We also investigate the fitting procedure inherent to randomized benchmarking in light of our results and find that standard methods such as ordinary least squares optimization can give misleading results. We therefore recommend moving to more sophisticated fitting methods such as iteratively reweighted least squares optimization. Our results bring rigorous randomized benchmarking on systems with many qubits into the realm of experimental feasibility.