Exact learning of quantum noise with tensor networks

• URL: http://arxiv.org/abs/2609.00169v1
• Date: Mon, 31 Aug 2026 18:01:16 GMT
• Title: Exact learning of quantum noise with tensor networks
• Abstract summary: We present a variational framework that learns the noise model directly from quantum-error-correction syndrome and logical-observable data.<n>We prove that this objective is principled rather than ad hoc: a sufficiently expressive noise ansatz attains the information-theoretic minimum logical error rate.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Accurate noise models are essential for high-performance quantum error correction, yet characterizing the noise of a quantum device typically requires dedicated experiments. We present a variational framework that learns the noise model directly from quantum-error-correction syndrome and logical-observable data collected during error-corrected memory experiments. The fault-event probabilities are treated as variational parameters and optimized via gradient descent to minimize the binary cross-entropy between the decoder's predictions and experimental logical-observable outcomes. We prove that this objective is principled rather than ad hoc: a sufficiently expressive noise ansatz attains the information-theoretic minimum logical error rate. We instantiate this framework using a tensor-network decoder, which provides exact maximum-likelihood decoding and analytically differentiable gradients with respect to all noise parameters. Using circuit-level data from Google's Sycamore processor, and starting from an uninformed prior, the optimization recovers noise models whose logical error rates agree to within $2\%$ with those of Google's independently characterized detector error model. The mean squared error between the learned and reference noise parameters shows a clear overall decrease throughout training, confirming that the method recovers physically meaningful noise structure, not merely parameters that happen to decode well. We further demonstrate that the optimization can track device drifts in real time via warm-started updates, maintaining near-optimal decoding performance under synthetically evolving noise without the need for re-characterization. The approach is decoder-agnostic in its formulation and naturally extends to correlated noise models.

Related papers

• Variational Rectification Inference for Learning with Noisy Labels [74.85528327499662]
  We propose variational rectification inference (VRI) to formulate the adaptive rectification for loss functions.<n>VRI is constructed as a hierarchical Bayes by treating the rectifying vector as a latent variable.<n>By introducing the variational term in VRI, the conditional posterior is estimated accurately and avoids collapsing to a Dirac delta function.
  arXiv  Detail & Related papers  (2026-03-18T01:25:08Z)
• Differentiable Maximum Likelihood Noise Estimation for Quantum Error Correction [3.1257175823346905]
  We introduce a differentiable Likelihood Estimation framework that enables exact, efficient, and fully differentiable Maximum of syndrome log-likelihoods.<n>Our approach yields provably optimal, decoder-independent error priors by directly maximizing the syndrome likelihood.
  arXiv  Detail & Related papers  (2026-02-23T11:20:23Z)
• Adaptive Estimation of Drifting Noise in Quantum Error Correction [1.1998722332188005]
  We present a framework to capture time-dependent Pauli noise, by exploiting the syndrome statistics of quantum error correction experiments.<n>We prove the noise-filtering behavior of sliding windows, linking window size to spectral cutoff frequencies, and provide an iterative algorithm that captures multiple drift frequencies.<n>Our window-based estimation methods and adaptive decoding offer new insights into noise spectroscopy and decoder optimization under drift.
  arXiv  Detail & Related papers  (2025-11-12T17:03:56Z)
• Data-Efficient Quantum Noise Modeling via Machine Learning [0.3279176777295314]
  We introduce a data-efficient, machine learning-based framework to construct accurate, parameterized noise models for superconducting quantum processors.<n>We show that a model trained exclusively on small-scale circuits accurately predicts the behavior of larger validation circuits.
  arXiv  Detail & Related papers  (2025-09-16T10:30:28Z)
• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• Modeling error correction with Lindblad dynamics and approximate channels [0.0]
  We study how different approximations of the noise capture the success rate of a code.<n>A Pauli approximation going beyond a single-qubit channel is sensitive to the details of the noise, state, and decoder.
  arXiv  Detail & Related papers  (2024-02-26T16:48:34Z)
• Learning correlated noise in a 39-qubit quantum processor [0.38073142980732994]
  Building error-corrected quantum computers relies crucially on measuring and modeling noise on candidate devices. Here we propose a method of extracting detailed information of the noise in a device running syndrome extraction circuits. We show how to extract from the 20 data qubits the information needed to build noise models of various sophistication.
  arXiv  Detail & Related papers  (2023-03-01T19:07:35Z)
• 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)
• Improve Noise Tolerance of Robust Loss via Noise-Awareness [60.34670515595074]
  We propose a meta-learning method which is capable of adaptively learning a hyper parameter prediction function, called Noise-Aware-Robust-Loss-Adjuster (NARL-Adjuster for brevity) Four SOTA robust loss functions are attempted to be integrated with our algorithm, and comprehensive experiments substantiate the general availability and effectiveness of the proposed method in both its noise tolerance and performance.
  arXiv  Detail & Related papers  (2023-01-18T04:54:58Z)
• Shape Matters: Understanding the Implicit Bias of the Noise Covariance [76.54300276636982]
  Noise in gradient descent provides a crucial implicit regularization effect for training over parameterized models. We show that parameter-dependent noise -- induced by mini-batches or label perturbation -- is far more effective than Gaussian noise. Our analysis reveals that parameter-dependent noise introduces a bias towards local minima with smaller noise variance, whereas spherical Gaussian noise does not.
  arXiv  Detail & Related papers  (2020-06-15T18:31:02Z)
• Consistency Regularization for Certified Robustness of Smoothed Classifiers [89.72878906950208]
  A recent technique of randomized smoothing has shown that the worst-case $ell$-robustness can be transformed into the average-case robustness. We found that the trade-off between accuracy and certified robustness of smoothed classifiers can be greatly controlled by simply regularizing the prediction consistency over noise.
  arXiv  Detail & Related papers  (2020-06-07T06:57:43Z)

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.