Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance

• URL: http://arxiv.org/abs/2607.27153v1
• Date: Wed, 29 Jul 2026 17:32:21 GMT
• Title: Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance
• Abstract summary: We develop a novel family of Metropolis-Hastings algorithms, referred to as subregion MCMC.<n>We argue that typical failure patterns include a large number of easily correctable errors that coexist alongside a malignant core.<n>We show that a judicious choice of this parameter results in far faster convergence than prior work.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: One of the central challenges in quantum error correction is determining the performance of a code in the low-error regimes needed to implement utility-scale computations. While performance at these error rates is not amenable to direct Monte Carlo simulation, it can be extrapolated from simulations at higher logical error rates, assuming the logical error rate scales predictably with increasing distance or decreasing physical error rate. However, the expected scaling depends sensitively on the minimum weight of uncorrectable error patterns. In many cases, the minimum weight is unknown since it depends not only on the theoretical code distance, but also on details of the implementation. Markov chain Monte Carlo (MCMC) methods, as adapted to quantum error correction by Bravyi and Vargo, provide a way to estimate logical failure rates in these low-error regimes via simulation. While offering significant gains over Monte Carlo, the described Metropolis algorithm makes small changes to the current logical failure patterns which results in slow convergence. In this paper, we argue that typical failure patterns include a large number of easily correctable errors that coexist alongside a malignant core. This observation motivates two new approaches to better evaluate code performance. First, we describe a pruning algorithm designed to obviate these correctable errors and focus on the problematic low-weight core. Second, we develop a novel family of Metropolis-Hastings algorithms, referred to as subregion MCMC. This technique is parameterized by the fraction of the error pattern that is resampled at each step, effectively interpolating between Monte Carlo and single step MCMC. We show that a judicious choice of this parameter results in far faster convergence than prior work.

Related papers

• How LLMs Fail and Generalize in RTL Coding for Hardware Design? [56.361436215029045]
  We introduce a new error taxonomy grounded in problem solvability, inspired by cognitive theory.<n>Our taxonomy categorizes failures into syntactic, semantic, solvable functional, and unsolvable functional types.
  arXiv  Detail & Related papers  (2026-04-26T14:34:49Z)
• Simulating Quantum Error Correction beyond Pauli Stochastic Errors [0.9772267314090435]
  We show how to accurately and efficiently model the effects of coherent and non-Pauli errors on quantum computing.<n>Our analysis suggests that coherent error can shift fault-tolerance thresholds, increase the space-time cost of magic state cultivation, and can increase logical error rates by an order of magnitude compared to Markov errors.
  arXiv  Detail & Related papers  (2026-03-19T03:39:43Z)
• Model-Preserving Adaptive Rounding [27.155444001204632]
  Yet Another Quantization Algorithm (YAQA) is an adaptive rounding algorithm that directly considers the error at the network's output.<n>We show that YAQA is provably better than GPTQ/LDLQ and empirically reduces the error by $approx 30%$ over these methods.
  arXiv  Detail & Related papers  (2025-05-29T01:53:00Z)
• Fast Controlled Generation from Language Models with Adaptive Weighted Rejection Sampling [90.86991492288487]
  evaluating constraint on every token can be prohibitively expensive.<n> LCD can distort the global distribution over strings, sampling tokens based only on local information.<n>We show that our approach is superior to state-of-the-art baselines.
  arXiv  Detail & Related papers  (2025-04-07T18:30:18Z)
• Demonstrating dynamic surface codes [118.67046728951689]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.<n>Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Bounding the systematic error in quantum error mitigation due to model violation [0.0]
  We develop a methodology to efficiently compute upper bounds on the impact of error-model inaccuracy in error mitigation. Our protocols require no additional experiments, and instead rely on comparisons between the error model and the error-learning data. We show that our estimated upper bounds are typically close to the worst observed performance of error mitigation on random circuits.
  arXiv  Detail & Related papers  (2024-08-20T16:27:00Z)
• Using Detector Likelihood for Benchmarking Quantum Error Correction [0.0]
  The behavior of real quantum hardware differs strongly from the simple error models typically used when simulating quantum error correction. We show that this can be done by means of the average detector likelihood, which quantifies the rate at which error detection events occur. This is then used to define an effective error rate at which simulations for a simple uniform noise model result in the same average detector likelihood, as well as a good prediction of the logical error rate.
  arXiv  Detail & Related papers  (2024-08-04T16:34:38Z)
• Fast and Accurate Error Simulation for CNNs against Soft Errors [64.54260986994163]
  We present a framework for the reliability analysis of Conal Neural Networks (CNNs) via an error simulation engine. These error models are defined based on the corruption patterns of the output of the CNN operators induced by faults. We show that our methodology achieves about 99% accuracy of the fault effects w.r.t. SASSIFI, and a speedup ranging from 44x up to 63x w.r.t.FI, that only implements a limited set of error models.
  arXiv  Detail & Related papers  (2022-06-04T19:45:02Z)
• Stochastic Gradient Methods with Preconditioned Updates [47.23741709751474]
  There are several algorithms for such problems, but existing methods often work poorly when badly scaled and/or ill-conditioned. Here we include preconditionimater based on Hutchinson's approach to approxing the diagonal Hessian. We prove convergence both when smoothness and the PL condition are assumed.
  arXiv  Detail & Related papers  (2022-06-01T07:38:08Z)
• The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation Using Monte Carlo-Based Channel Inversion [84.66087478797475]
  Quantum error mitigation (QEM) is a class of promising techniques for reducing the computational error of variational quantum algorithms. We consider a practical channel inversion strategy based on Monte Carlo sampling, which introduces additional computational error. We show that when the computational error is small compared to the dynamic range of the error-free results, it scales with the square root of the number of gates.
  arXiv  Detail & Related papers  (2022-01-20T00:05:01Z)
• Efficient diagnostics for quantum error correction [0.0]
  We present a scalable experimental approach based on Pauli error reconstruction to predict the performance of codes. Numerical evidence demonstrates that our method significantly outperforms predictions based on standard error metrics for various error models.
  arXiv  Detail & Related papers  (2021-08-24T16:28:29Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)

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.