Randomized benchmarking for non-Markovian noise

• URL: http://arxiv.org/abs/2107.05403v2
• Date: Tue, 14 Dec 2021 00:47:30 GMT
• Title: Randomized benchmarking for non-Markovian noise
• Authors: Pedro Figueroa-Romero, Kavan Modi, Thomas M. Stace, Min-Hsiu Hsieh
• Abstract summary: 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.
• Score: 11.164202369517058
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Estimating the features of noise is the first step in a chain of protocols that will someday lead to fault tolerant quantum computers. The randomized benchmarking (RB) protocol is designed with this exact mindset, estimating the average strength of noise in a quantum processor with relative ease in practice. However, RB, along with most other benchmarking and characterization methods, is limited in scope because it assumes that the noise is temporally uncorrelated (Markovian), which is increasingly evident not to be the case. Here, we combine the RB protocol with a recent framework describing non-Markovian quantum phenomena to derive a general analytical expression of the average sequence fidelity (ASF) for non-Markovian RB with the Clifford group. We show that one can identify non-Markovian features of the noise directly from the ASF through its deviations from the Markovian case, proposing a set of methods to collectively estimate these deviations, non-Markovian memory time-scales, and diagnose (in)coherence of non-Markovian noise in an RB experiment. Finally, we demonstrate the efficacy of our proposal by means of several proof-of-principle examples. Our methods are directly implementable and pave the pathway to better understanding correlated noise in quantum processors.

Related papers

• Non-Markovian Noise Mitigation: Practical Implementation, Error Analysis, and the Role of Environment Spectral Properties [3.1003326924534482]
  We propose a non-Markovian Noise Mitigation(NMNM) method by extending the probabilistic error cancellation (PEC) method in the QEM framework to treat non-Markovian noise. We establish a direct connection between the overall approximation error and sampling overhead of QEM and the spectral property of the environment.
  arXiv  Detail & Related papers  (2025-01-09T07:22:06Z)
• Non-Markovian Noise Suppression Simplified through Channel Representation [0.8639941465436463]
  We introduce a channel representation for arbitrary non-Markovian quantum dynamics, termed the Choi channel. This representation translates the complex dynamics of non-Markovian noise into the familiar picture of noise channels acting on ideal states. We have devised new protocols using Pauli twirling, probabilistic error cancellation and virtual channel purification.
  arXiv  Detail & Related papers  (2024-12-15T15:26:07Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation. We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• SoftPatch: Unsupervised Anomaly Detection with Noisy Data [67.38948127630644]
  This paper considers label-level noise in image sensory anomaly detection for the first time. We propose a memory-based unsupervised AD method, SoftPatch, which efficiently denoises the data at the patch level. Compared with existing methods, SoftPatch maintains a strong modeling ability of normal data and alleviates the overconfidence problem in coreset.
  arXiv  Detail & Related papers  (2024-03-21T08:49:34Z)
• Compressed gate characterization for quantum devices with time-correlated noise [0.0]
  We present a general framework for quantum process tomography (QPT) in the presence of time-correlated noise. As an application of our method, we perform a comparative theoretical and experimental analysis of silicon spin qubits. We find good agreement between our theoretically predicted process fidelities and two qubit interleaved randomized benchmarking fidelities of 99.8% measured in recent experiments on silicon spin qubits.
  arXiv  Detail & Related papers  (2023-07-26T18:05:49Z)
• 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)
• Latent Class-Conditional Noise Model [54.56899309997246]
  We introduce a Latent Class-Conditional Noise model (LCCN) to parameterize the noise transition under a Bayesian framework. We then deduce a dynamic label regression method for LCCN, whose Gibbs sampler allows us efficiently infer the latent true labels. Our approach safeguards the stable update of the noise transition, which avoids previous arbitrarily tuning from a mini-batch of samples.
  arXiv  Detail & Related papers  (2023-02-19T15:24:37Z)
• Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise [12.547444644243544]
  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.
  arXiv  Detail & Related papers  (2022-02-23T07:51:03Z)
• Learning based signal detection for MIMO systems with unknown noise statistics [84.02122699723536]
  This paper aims to devise a generalized maximum likelihood (ML) estimator to robustly detect signals with unknown noise statistics. In practice, there is little or even no statistical knowledge on the system noise, which in many cases is non-Gaussian, impulsive and not analyzable. Our framework is driven by an unsupervised learning approach, where only the noise samples are required.
  arXiv  Detail & Related papers  (2021-01-21T04:48:15Z)
• A Second-Order Approach to Learning with Instance-Dependent Label Noise [58.555527517928596]
  The presence of label noise often misleads the training of deep neural networks. We show that the errors in human-annotated labels are more likely to be dependent on the difficulty levels of tasks.
  arXiv  Detail & Related papers  (2020-12-22T06:36:58Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)

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.