Blind-spots of Randomized Benchmarking Under Temporal Correlations

• URL: http://arxiv.org/abs/2510.13051v1
• Date: Wed, 15 Oct 2025 00:15:02 GMT
• Title: Blind-spots of Randomized Benchmarking Under Temporal Correlations
• Authors: Varun Srivastava, Abhinash Kumar Roy, Soumik Mahanti, Jasleen Kaur, Salini Karuvade, Alexei Gilchrist,
• Abstract summary: We derive analytic expressions for the average sequence fidelity (ASF) in the presence of temporally correlated (non-Markovian) noise.<n>We show how the ASF can be interpreted to extract meaningful benchmarking parameters under such noise.<n>We demonstrate that temporal correlations may suppress worst-case errors highlighting that temporal correlations may not always have detrimental effects on gate performance.
• Score: 2.0524609401792397
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Flow-Based Non-stationary Temporal Regime Causal Structure Learning [49.77103348208835]
  We introduce FANTOM, a unified framework for causal discovery.<n>It handles non stationary processes along with non Gaussian and heteroscedastic noises.<n>It simultaneously infers the number of regimes and their corresponding indices and learns each regime's Directed Acyclic Graph.
  arXiv  Detail & Related papers  (2025-06-20T15:12:43Z)
• Impact of Temporally Correlated Dephasing Noise on the Fidelity of the 2-Qubit Deutsch-Jozsa Algorithm [0.76146285961466]
  Noise in quantum systems often exhibits temporal correlations, leading to non-Markovian dynamics.<n>This paper investigates the impact of temporally correlated noise on the fidelity of the 2-qubit Deutsch-Jozsa algorithm.
  arXiv  Detail & Related papers  (2025-06-05T18:48:50Z)
• Enforcing Fundamental Relations via Adversarial Attacks on Input Parameter Correlations [76.2226569692207]
  Correlations between input parameters play a crucial role in many scientific classification tasks.<n>We present a new adversarial attack algorithm called Random Distribution Shuffle Attack (RDSA)<n>We demonstrate the RDSA effectiveness on six classification tasks.
  arXiv  Detail & Related papers  (2025-01-09T21:45:09Z)
• Detrimental non-Markovian errors for surface code memory [0.5490714603843316]
  We study the structure of non-Markovian correlated errors and their impact on surface code memory performance.<n>Our analysis shows that while not all temporally correlated structures are detrimental, certain structures, particularly multi-time "streaky" correlations, can severely degrade logical error rate scaling.
  arXiv  Detail & Related papers  (2024-10-31T09:52:21Z)
• Risk and cross validation in ridge regression with correlated samples [72.59731158970894]
  We provide training examples for the in- and out-of-sample risks of ridge regression when the data points have arbitrary correlations.<n>We demonstrate that in this setting, the generalized cross validation estimator (GCV) fails to correctly predict the out-of-sample risk.<n>We further extend our analysis to the case where the test point has nontrivial correlations with the training set, a setting often encountered in time series forecasting.
  arXiv  Detail & Related papers  (2024-08-08T17:27:29Z)
• Limitations to Dynamical Error Suppression and Gate-Error Virtualization from Temporally Correlated Nonclassical Noise [0.0]
  We study a minimal exactly solvable single-qubit model under Gaussian quantum dephasing noise.<n>For digital periodic control, we prove that the gate fidelity saturates at a value that is strictly smaller than the one attainable in the absence of control history.<n>We find that only if decoupling can keep the qubit highly pure over a timescale larger than the correlation time of the noise, the bath approximately converges to its original statistics.
  arXiv  Detail & Related papers  (2024-07-05T18:00:00Z)
• Score Matching-based Pseudolikelihood Estimation of Neural Marked Spatio-Temporal Point Process with Uncertainty Quantification [59.81904428056924]
  We introduce SMASH: a Score MAtching estimator for learning markedPs with uncertainty quantification. Specifically, our framework adopts a normalization-free objective by estimating the pseudolikelihood of markedPs through score-matching. The superior performance of our proposed framework is demonstrated through extensive experiments in both event prediction and uncertainty quantification.
  arXiv  Detail & Related papers  (2023-10-25T02:37:51Z)
• Ability of error correlations to improve the performance of variational quantum algorithms [0.0]
  We introduce a model for both spatially and temporally (non-Markovian) correlated errors based on classical environmental fluctuators. We find evidence that the performance of QAOA improves as the correlation time or correlation length of the noise is increased at fixed local error probabilities.
  arXiv  Detail & Related papers  (2022-07-21T17:30:33Z)
• Characterizing low-frequency qubit noise [55.41644538483948]
  Fluctuations of the qubit frequencies are one of the major problems to overcome on the way to scalable quantum computers. The statistics of the fluctuations can be characterized by measuring the correlators of the outcomes of periodically repeated Ramsey measurements. This work suggests a method that allows describing qubit dynamics during repeated measurements in the presence of evolving noise.
  arXiv  Detail & Related papers  (2022-07-04T22:48:43Z)
• Partial Identification with Noisy Covariates: A Robust Optimization Approach [94.10051154390237]
  Causal inference from observational datasets often relies on measuring and adjusting for covariates. We show that this robust optimization approach can extend a wide range of causal adjustment methods to perform partial identification. Across synthetic and real datasets, we find that this approach provides ATE bounds with a higher coverage probability than existing methods.
  arXiv  Detail & Related papers  (2022-02-22T04:24:26Z)
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions [62.997667081978825]
  We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams. This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits. We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
  arXiv  Detail & Related papers  (2020-12-21T14:20:40Z)
• Randomized benchmarking in the presence of time-correlated dephasing noise [0.0]
  A typical randomized benchmarking procedure identifies the exponential decay in the fidelity as the benchmarking sequence of gates increases in length. The fidelity decays exponentially, however, relies on the assumption of time-independent or static noise in the gates. The precise mechanisms for deviation have yet to be fully explored.
  arXiv  Detail & Related papers  (2020-10-22T07:33:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.