Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise

• URL: http://arxiv.org/abs/2202.11338v4
• Date: Thu, 17 Nov 2022 04:04:07 GMT
• Title: Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise
• Authors: Pedro Figueroa-Romero, Kavan Modi, Min-Hsiu Hsieh
• Abstract summary: We show that gate-dependence does not translate into a perturbative term within the Average Sequence Fidelity. We show that even though gate-dependence does not translate into a perturbative term within the ASF, the non-Markovian sequence fidelity nevertheless remains stable under small gate-dependent perturbations.
• Score: 12.547444644243544
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The rapid progress in the development of quantum devices is in large part due to the availability of a wide range of characterization techniques allowing to probe, test and adjust them. Nevertheless, these methods often make use of approximations that hold in rather simplistic circumstances. In particular, assuming that error mechanisms stay constant in time and have no dependence in the past, is something that will be impossible to do as quantum processors continue scaling up in depth and size. We establish a theoretical framework for the Randomized Benchmarking protocol encompassing temporally-correlated, so-called non-Markovian noise, at the gate level, for any gate set belonging to a wide class of finite groups. We obtain a general expression for the Average Sequence Fidelity (ASF) and propose a way to obtain average gate fidelities of full non-Markovian noise processes. Moreover, we obtain conditions that are fulfilled when an ASF displays authentic non-Markovian deviations. Finally, we show that even though gate-dependence does not translate into a perturbative term within the ASF, as in the Markovian case, the non-Markovian sequence fidelity nevertheless remains stable under small gate-dependent perturbations.

Related papers

• 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. For digital periodic control, we prove that, under mild conditions on the low-frequency behavior of the nonclassical noise spectrum, the gate fidelity saturates at a value that is strictly smaller than the one attainable in the absence of control history. 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 and a stable-in-time control performance is recovered.
  arXiv  Detail & Related papers  (2024-07-05T18:00:00Z)
• Operational Markovianization in Randomized Benchmarking [7.680510419135912]
  We analytically show that error suppression techniques such as Dynamical Decoupling (DD) and Randomized Compiling (RC) can operationally Markovianize Randomized Benchmarking (RB) Our results show that simple and efficient error suppression methods can simultaneously tame non-Markovian noise and allow for standard and reliable gate quality estimation.
  arXiv  Detail & Related papers  (2023-05-08T13:37:18Z)
• Robust Control for Dynamical Systems With Non-Gaussian Noise via Formal Abstractions [59.605246463200736]
  We present a novel controller synthesis method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous control system into a finite-state model that captures noise by probabilistic transitions between discrete states. We use state-of-the-art verification techniques to provide guarantees on the interval Markov decision process and compute a controller for which these guarantees carry over to the original control system.
  arXiv  Detail & Related papers  (2023-01-04T10:40:30Z)
• Probabilities Are Not Enough: Formal Controller Synthesis for Stochastic Dynamical Models with Epistemic Uncertainty [68.00748155945047]
  Capturing uncertainty in models of complex dynamical systems is crucial to designing safe controllers. Several approaches use formal abstractions to synthesize policies that satisfy temporal specifications related to safety and reachability. Our contribution is a novel abstraction-based controller method for continuous-state models with noise, uncertain parameters, and external disturbances.
  arXiv  Detail & Related papers  (2022-10-12T07:57:03Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• On Uncertainty, Tempering, and Data Augmentation in Bayesian Classification [47.13680267076843]
  We show that explicitly accounting for aleatoric uncertainty significantly improves the performance of Bayesian neural networks. We find that a cold posterior, tempered by a power greater than one, often more honestly reflects our beliefs about aleatoric uncertainty than no tempering.
  arXiv  Detail & Related papers  (2022-03-30T17:17:50Z)
• Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian Noise [59.47042225257565]
  We present a novel planning method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous system into a discrete-state model that captures noise by probabilistic transitions between states. We capture these bounds in the transition probability intervals of a so-called interval Markov decision process (iMDP)
  arXiv  Detail & Related papers  (2021-10-25T06:18:55Z)
• Randomized benchmarking for non-Markovian noise [11.164202369517058]
  We combine the randomized benchmarking protocol with a framework describing non-Markovian quantum phenomena. We show that one can identify non-Markovian features of the noise directly from the ASF through its deviations from the Markovian case. Our methods are directly implementable and pave the pathway to better understanding correlated noise in quantum processors.
  arXiv  Detail & Related papers  (2021-07-12T13:10:05Z)
• Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
  bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing. In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
  arXiv  Detail & Related papers  (2021-05-28T15:20:21Z)
• 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)
• Non-Markovian memory in a measurement-based quantum computer [0.0]
  We study the exact open system dynamics of single qubit gates during a measurement-based quantum computation. We show that the average fidelity is identical for the X-gate and Z-gate and that neither fast application of the projective measurements necessarily implies high gate fidelity.
  arXiv  Detail & Related papers  (2020-05-21T20:18:11Z)

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.