Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review E

Effect of quantum fluctuation in error-correcting codes

Yosuke Otsubo, Jun‐ichi Inoue, Kenji Nagata, Masato Okada

Published Nov 30, 2012• 13 citations
Publisher

Abstract

We discuss the decoding performance of error-correcting codes based on a model in which quantum fluctuations are introduced by means of a transverse field. The essential issue in this paper is whether quantum fluctuations improve the decoding quality compared with the conventional estimation based on thermal fluctuations, which is called finite-temperature decoding. We found that an estimation incorporating quantum fluctuations approaches the optimal performance of finite-temperature decoding. The results are illustrated by numerically solving saddle-point equations and performing a Monte Carlo simulation. We also evaluated the upper bound of the overlap between the original sequence and the decoded sequence derived from the equations of state for the order parameters, which is a measure of the decoding performance.

DOI
10.1103/physreve.86.051138

Related papers

Statistical mechanics of error-correcting codes

Yoshiyuki Kabashima, David Saad

We investigate the performance of error-correcting codes, where the code word comprises products of K bits selected from the original message and decoding is carried out utilizing a connectivity tensor with C connections per index. Shannon's bound for the channel capacity is recovered for large K and zero temperature when the code rate K / C is finite. Close to optimal error-correcting capability is obtained for finite K and C . We examine the finite-temperature case to assess the use of simulated annealing for decoding and extend the analysis to accommodate other types of noisy channels.

Europhysics Letters (EPL)•Jan 1, 1999•152 citations

Quantum mean-field decoding algorithm for error-correcting codes

Jun‐ichi Inoue, Yôhei Saika, Masato Okada

We numerically examine a quantum version of TAP (Thouless-Anderson-Palmer)-like mean-field algorithm for the problem of error-correcting codes. For a class of the so-called Sourlas error-correcting codes, we check the usefulness to retrieve the original bit-sequence (message) with a finite length. The decoding dynamics is derived explicitly and we evaluate the average-case performance through the bit-error rate (BER).

Journal of Physics Conference Series•Jan 7, 2009•4 citations

Finite temperature error-correcting codes

Pál Ruján

The correspondence between error-correcting convolution codes and gauge invariant spin-glass models is used to show that the optimal way to recover the original message is by decoding at a finite temperature ${\mathit{T}}_{\mathit{N}}$(p)>0, where p is the strength of the channel noise and ${\mathit{T}}_{\mathit{N}}$(p) the Nishimori temperature. This improves upon the retrieval performance of the T=0 maximal likelihood Viterbi decoding algorithm without increasing its computational complexity. Numerical simulations support the theory.

Physical Review Letters•May 10, 1993•123 citations

Efficient Estimation of Logical Sensitivities Through Fault-Counting

Winston Fu, J. Wilson Staples, Jeff D. Thompson

Quantum error-correcting circuits are affected by multiple physical noise mechanisms, whose contributions to logical failure must be understood to evaluate code performance and guide improvements in hardware. The individual error budget contributions for an error type $i$ can be characterized by its logical sensitivity $ν_i = \frac{\partial p_L}{\partial p_i}$, which measures the response of the logical error rate $p_L$ to each physical noise parameter $p_i$. Normally, $ν_i$ is measured using linear fits such as finite differences, where $p_L$ is measured at two or more values of $p_i$ to calculate partial derivatives. In this paper, we develop a differentiable estimator to obtain all components of $\nabla_{\mathbf p}p_L$ simultaneously from a single Monte Carlo data set at one noise configuration, using information about the underlying fault configurations. In surface code simulations with circuit-level noise, the estimator agrees with conventional finite differences while requiring one to two orders of magnitude fewer shots to achieve the same variance. We apply this technique to quantify error budgets, resolve sensitivities at the individual qubit level, and infer effective code distance. Finally, we incorporate the sensitivities into Newton root finding to locate and trace threshold contours in multidimensional noise models. These results provide an efficient method for extracting and applying logical sensitivity information from standard quantum error correction simulations.

quant-pharXiv:2610.10531•Oct 8, 2026•0 citations

Quantum Noise Degradation and Error-Correcting Code Optimization in Quantum Computing

Jincheng Zhang

Quantum computing holds immense promise for revolutionizing various fields, but its inherent susceptibility to noise poses a significant challenge to achieving reliable computations. This work investigates the degradation of quantum information due to noise and proposes an optimized approach to error-correcting codes specifically tailored for quantum systems. We establish a precise noise degradation model, incorporating various noise types and their statistical properties, represented as (σi). This model allows for a more realistic simulation of quantum noise compared to traditional approaches. Subsequently, we employ an optimization algorithm, based on the principle of minimizing bit-flip error rates, to design error-correcting codes. The core of our design strategy leverages information theory concepts, particularly channel capacity and mutual information, represented as (Cch, Imn), to determine the optimal code parameters. The optimization process aims to find the most efficient code that can effectively protect quantum information from noise, ultimately enhancing the reliability of quantum computations. The final optimized code is characterized by its encoding rate (R), decoding rate (D), and the minimum distance (dmin) of the code, represented as (R, D, dmin). The results demonstrate the effectiveness of our approach in mitigating noise degradation and improving the performance of quantum error correction.

•Sep 7, 2026•0 citations

Quantum annealing in the transverse Ising model

Tadashi Kadowaki, Hidetoshi Nishimori

We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between states and thus play the same role as thermal fluctuations in the conventional approach. The idea is tested by the transverse Ising model, in which the transverse field is a function of time similar to the temperature in the conventional method. The goal is to find the ground state of the diagonal part of the Hamiltonian with high accuracy as quickly as possible. We have solved the time-dependent Schr\"odinger equation numerically for small size systems with various exchange interactions. Comparison with the results of the corresponding classical (thermal) method reveals that the quantum annealing leads to the ground state with much larger probability in almost all cases if we use the same annealing schedule.

arXiv:cond-mat/9804280•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Nov 1, 1998•2,516 citations
We discuss the decoding performance of error-correcting codes based on a model in which quantum fluctuations are introduced by means of a transverse field. The essential issue in this paper is whether quantum fluctuations improve the decoding quality compared with the conventional estimation based on thermal fluctuations, which is called finite-temperature decoding. We found that an estimation incorporating quantum fluctuations approaches the optimal performance of finite-temperature decoding. The results are illustrated by numerically solving saddle-point equations and performing a Monte Carlo simulation. We also evaluated the upper bound of the overlap between the original sequence and the decoded sequence derived from the equations of state for the order parameters, which is a measure of the decoding performance.
We investigate the performance of error-correcting codes, where the code word comprises products of K bits selected from the original message and decoding is carried out utilizing a connectivity tensor with C connections per index. Shannon's bound for the channel capacity is recovered for large K and zero temperature when the code rate K / C is finite. Close to optimal error-correcting capability is obtained for finite K and C . We examine the finite-temperature case to assess the use of simulated annealing for decoding and extend the analysis to accommodate other types of noisy channels.
The correspondence between error-correcting convolution codes and gauge invariant spin-glass models is used to show that the optimal way to recover the original message is by decoding at a finite temperature TN{\mathit{T}}_{\mathit{N}}TN​(p)>0, where p is the strength of the channel noise and TN{\mathit{T}}_{\mathit{N}}TN​(p) the Nishimori temperature. This improves upon the retrieval performance of the T=0 maximal likelihood Viterbi decoding algorithm without increasing its computational complexity. Numerical simulations support the theory.
Quantum error-correcting circuits are affected by multiple physical noise mechanisms, whose contributions to logical failure must be understood to evaluate code performance and guide improvements in hardware. The individual error budget contributions for an error type iii can be characterized by its logical sensitivity νi=∂pL∂piν_i = \frac{\partial p_L}{\partial p_i}νi​=∂pi​∂pL​​, which measures the response of the logical error rate pLp_LpL​ to each physical noise parameter pip_ipi​. Normally, νiν_iνi​ is measured using linear fits such as finite differences, where pLp_LpL​ is measured at two or more values of pip_ipi​ to calculate partial derivatives. In this paper, we develop a differentiable estimator to obtain all components of ∇ppL\nabla_{\mathbf p}p_L∇p​pL​ simultaneously from a single Monte Carlo data set at one noise configuration, using information about the underlying fault configurations. In surface code simulations with circuit-level noise, the estimator agrees with conventional finite differences while requiring one to two orders of magnitude fewer shots to achieve the same variance. We apply this technique to quantify error budgets, resolve sensitivities at the individual qubit level, and infer effective code distance. Finally, we incorporate the sensitivities into Newton root finding to locate and trace threshold contours in multidimensional noise models. These results provide an efficient method for extracting and applying logical sensitivity information from standard quantum error correction simulations.
Quantum computing holds immense promise for revolutionizing various fields, but its inherent susceptibility to noise poses a significant challenge to achieving reliable computations. This work investigates the degradation of quantum information due to noise and proposes an optimized approach to error-correcting codes specifically tailored for quantum systems. We establish a precise noise degradation model, incorporating various noise types and their statistical properties, represented as (σi). This model allows for a more realistic simulation of quantum noise compared to traditional approaches. Subsequently, we employ an optimization algorithm, based on the principle of minimizing bit-flip error rates, to design error-correcting codes. The core of our design strategy leverages information theory concepts, particularly channel capacity and mutual information, represented as (Cch, Imn), to determine the optimal code parameters. The optimization process aims to find the most efficient code that can effectively protect quantum information from noise, ultimately enhancing the reliability of quantum computations. The final optimized code is characterized by its encoding rate (R), decoding rate (D), and the minimum distance (dmin) of the code, represented as (R, D, dmin). The results demonstrate the effectiveness of our approach in mitigating noise degradation and improving the performance of quantum error correction.
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between states and thus play the same role as thermal fluctuations in the conventional approach. The idea is tested by the transverse Ising model, in which the transverse field is a function of time similar to the temperature in the conventional method. The goal is to find the ground state of the diagonal part of the Hamiltonian with high accuracy as quickly as possible. We have solved the time-dependent Schr\"odinger equation numerically for small size systems with various exchange interactions. Comparison with the results of the corresponding classical (thermal) method reveals that the quantum annealing leads to the ground state with much larger probability in almost all cases if we use the same annealing schedule.