Effect of Correlated Errors on Quantum Memory

• URL: http://arxiv.org/abs/2408.08786v1
• Date: Fri, 16 Aug 2024 14:59:10 GMT
• Title: Effect of Correlated Errors on Quantum Memory
• Authors: Smita Bagewadi, Avhishek Chatterjee,
• Abstract summary: We introduce a classical correlation model based on hidden random fields for modeling i.i.d. errors with long-range correlations. We show that this proposed model can capture certain correlation patterns not captured by the joint (system and bath) Hamiltonian model with pairwise terms.
• Score: 1.3198143828338362
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent improvements in LDPC code based fault-tolerance for memory against i.i.d. errors naturally lead to the question of fault-tolerance against errors with long-range correlations. We introduce a classical correlation model based on hidden random fields for modeling such errors. We show that this proposed model can capture certain correlation patterns not captured by the joint (system and bath) Hamiltonian model with pairwise terms. Towards that, we derive a converse result for retention time in the presence of an error distribution, which is from the proposed class and exhibits quadratically small correlations. On the other hand, we show that for a broad subclass of error distributions within the proposed model, Tanner codes can ensure exponential retention time when the error rate is sufficiently low. The proposed model is analytically tractable due to the existence of a rich probability literature and thus, can offer insights complementary to the joint Hamiltonian model with pairwise terms.

Related papers

• Quantum non-Markovian noise in randomized benchmarking of spin-boson models [0.0]
  We study the effects of a quantum non-Markovian bath on qubit randomized benchmarking experiments. Allowing for non-Markovianity in the interactions leads to clear differences in the randomized benchmarking decay curves. These results inform efforts on incorporating quantum non-Markovian noise in the characterization and benchmarking of quantum devices.
  arXiv  Detail & Related papers  (2025-02-20T16:25:59Z)
• Towards Robust Text Classification: Mitigating Spurious Correlations with Causal Learning [2.7813683000222653]
  We propose the Causally Calibrated Robust ( CCR) to reduce models' reliance on spurious correlations. CCR integrates a causal feature selection method based on counterfactual reasoning, along with an inverse propensity weighting (IPW) loss function. We show that CCR state-of-the-art performance among methods without group labels, and in some cases, it can compete with the models that utilize group labels.
  arXiv  Detail & Related papers  (2024-11-01T21:29:07Z)
• Embedded Nonlocal Operator Regression (ENOR): Quantifying model error in learning nonlocal operators [8.585650361148558]
  We propose a new framework to learn a nonlocal homogenized surrogate model and its structural model error. This framework provides discrepancy-adaptive uncertainty quantification for homogenized material response predictions in long-term simulations.
  arXiv  Detail & Related papers  (2024-10-27T04:17:27Z)
• Non-Uniform Noise Rates and Griffiths Phases in Topological Quantum Error Correction [0.025206105035672277]
  We study effects non-uniform error rates in the representative examples of the 1D repetition code and the 2D toric code. Rare events may arise, for instance, from rare events (such as cosmic rays) that temporarily elevate error rates over the entire code patch.
  arXiv  Detail & Related papers  (2024-09-05T07:54:23Z)
• Multivariate Probabilistic Time Series Forecasting with Correlated Errors [17.212396544233307]
  We introduce a plug-and-play method that learns the covariance structure of errors over multiple steps for autoregressive models. We evaluate our method on probabilistic models built on RNNs and Transformer architectures.
  arXiv  Detail & Related papers  (2024-02-01T20:27:19Z)
• A PAC-Bayesian Perspective on the Interpolating Information Criterion [54.548058449535155]
  We show how a PAC-Bayes bound is obtained for a general class of models, characterizing factors which influence performance in the interpolating regime. We quantify how the test error for overparameterized models achieving effectively zero training error depends on the quality of the implicit regularization imposed by e.g. the combination of model, parameter-initialization scheme.
  arXiv  Detail & Related papers  (2023-11-13T01:48:08Z)
• Sample Complexity Bounds for Score-Matching: Causal Discovery and Generative Modeling [82.36856860383291]
  We demonstrate that accurate estimation of the score function is achievable by training a standard deep ReLU neural network. We establish bounds on the error rate of recovering causal relationships using the score-matching-based causal discovery method.
  arXiv  Detail & Related papers  (2023-10-27T13:09:56Z)
• On how to avoid exacerbating spurious correlations when models are overparameterized [33.315813572333745]
  We show that VS-loss learns a model that is fair towards minorities even when spurious features are strong. Compared to previous works, our bounds hold for more general models, they are non-asymptotic, and, they apply even at scenarios of extreme imbalance.
  arXiv  Detail & Related papers  (2022-06-25T21:53:44Z)
• Dynamical approximations for composite quantum systems: Assessment of error estimates for a separable ansatz [0.0]
  We consider a representative two-dimensional tunneling system where a double well and a harmonic coordinate are cubically coupled. The impact of the coupling and the resulting correlations are quantitatively assessed in terms of a time-dependent reaction probability. We show that the numerical error is correctly predicted on moderate time scales by a theoretically derived error estimate.
  arXiv  Detail & Related papers  (2021-12-10T13:27:57Z)
• Estimation of Bivariate Structural Causal Models by Variational Gaussian Process Regression Under Likelihoods Parametrised by Normalising Flows [74.85071867225533]
  Causal mechanisms can be described by structural causal models. One major drawback of state-of-the-art artificial intelligence is its lack of explainability.
  arXiv  Detail & Related papers  (2021-09-06T14:52:58Z)
• Efficient Causal Inference from Combined Observational and Interventional Data through Causal Reductions [68.6505592770171]
  Unobserved confounding is one of the main challenges when estimating causal effects. We propose a novel causal reduction method that replaces an arbitrary number of possibly high-dimensional latent confounders. We propose a learning algorithm to estimate the parameterized reduced model jointly from observational and interventional data.
  arXiv  Detail & Related papers  (2021-03-08T14:29:07Z)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)
• 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)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• Autoregressive Score Matching [113.4502004812927]
  We propose autoregressive conditional score models (AR-CSM) where we parameterize the joint distribution in terms of the derivatives of univariable log-conditionals (scores) For AR-CSM models, this divergence between data and model distributions can be computed and optimized efficiently, requiring no expensive sampling or adversarial training. We show with extensive experimental results that it can be applied to density estimation on synthetic data, image generation, image denoising, and training latent variable models with implicit encoders.
  arXiv  Detail & Related papers  (2020-10-24T07:01:24Z)
• Error Autocorrelation Objective Function for Improved System Modeling [1.2760453906939444]
  We introduce a "whitening" cost function, the Ljung-Box statistic, which not only minimizes the error but also minimizes the correlations between errors. The results show significant improvement in generalization for recurrent neural networks (RNNs) and image autoencoders (2d)
  arXiv  Detail & Related papers  (2020-08-08T19:20:32Z)
• Accounting for Unobserved Confounding in Domain Generalization [107.0464488046289]
  This paper investigates the problem of learning robust, generalizable prediction models from a combination of datasets. Part of the challenge of learning robust models lies in the influence of unobserved confounders. We demonstrate the empirical performance of our approach on healthcare data from different modalities.
  arXiv  Detail & Related papers  (2020-07-21T08:18:06Z)
• On Disentangled Representations Learned From Correlated Data [59.41587388303554]
  We bridge the gap to real-world scenarios by analyzing the behavior of the most prominent disentanglement approaches on correlated data. We show that systematically induced correlations in the dataset are being learned and reflected in the latent representations. We also demonstrate how to resolve these latent correlations, either using weak supervision during training or by post-hoc correcting a pre-trained model with a small number of labels.
  arXiv  Detail & Related papers  (2020-06-14T12:47:34Z)
• Quantum causal correlations and non-Markovianity of quantum evolution [0.0]
  A non-Markovianity measure for quantum channels is introduced based on causality measure. Breakdown of monotonicity of the causality measure is associated with the revival of temporal correlations.
  arXiv  Detail & Related papers  (2020-05-08T16:10:55Z)
• Deep Weakly-supervised Anomaly Detection [118.55172352231381]
  Pairwise Relation prediction Network (PReNet) learns pairwise relation features and anomaly scores. PReNet can detect any seen/unseen abnormalities that fit the learned pairwise abnormal patterns. Empirical results on 12 real-world datasets show that PReNet significantly outperforms nine competing methods in detecting seen and unseen anomalies.
  arXiv  Detail & Related papers  (2019-10-30T00:40:25Z)

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.