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

AIP conference proceedings

Probabilistic coding with multiple error corrections

Dmitry Moiseev, Alexander Shokin

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.1063/5.0092565

Related papers

Error Correcting Codes Based on Probabilistic Decoding and Sparse Matrices

Hironori Uchikawa

Mathematics for industry•Jan 1, 2014•0 citations

Stochastic Decoding of Error-Correcting Codes

François Leduc-Primeau, Saied Hemati, Vincent Gaudet +1 more

Springer eBooks•Jan 1, 2019•1 citation

Decoding LDPC Codes with Probabilistic Local Maximum Likelihood Bit Flipping

Rejoy Roy Mathews

Communication channels are inherently noisy making error correction coding a major topic of research for modern communication systems. Error correction coding is the addition of redundancy to information transmitted over communication channels to enable detection and recovery of erroneous information. Low-density parity-check (LDPC) codes are a class of error correcting codes that have been effective in maintaining reliability of information transmitted over communication channels. Multiple algorithms have been developed to benefit from the LDPC coding scheme to improve recovery of erroneous information. This work develops a matrix construction that stores the information error probability statistics for a communication channel. This combined with the error correcting capability of LDPC codes enabled the development of the Probabilistic Local Maximum Likelihood Bit Flipping (PLMLBF) algorithm, which is the focus of this research work.

International Symposium on Information Theory and its Applications•Mar 9, 2020•1 citation

Quantum Codes for Generalized Amplitude-damping Noise

Sourav Dutta, Anubhab Rudra, Manav Seksaria +2 more

Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing. One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise. Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength. In this work, we introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, resource-efficient error correction. We construct a five-qubit permutation-invariant code that, under probabilistic recovery, achieves a fidelity loss quadratic in the damping strength, thus outperforming existing QEC codes. Formulating PAQEC as an optimization problem, we present a numerical technique based on Charnes-Cooper and semidefinite programming to identify the optimal recovery map for any PAQEC code. Our results establish PAQEC as a powerful tool for developing resource-efficient, high-fidelity quantum codes tailored to realistic noise, with promising implications for near-term quantum devices and future fault-tolerant architectures.

quant-pharXiv:2609.15924•Sep 15, 2026•0 citations

Quantum Error Correction Codes: Probabilistic Error Correction and Reconstruction

Jincheng Zhang

This paper investigates the application of probabilistic error correction techniques within quantum error correction codes, coupled with machine learning algorithms, to enhance the effectiveness of quantum information processing in noisy environments. Traditional quantum error correction methods primarily rely on deterministic correction mechanisms, often failing to adequately account for the probabilistic nature of noise. This work proposes a novel framework that leverages the probabilistic characteristics of quantum error correction codes, combined with machine learning, to dynamically predict noise distributions and adapt the error correction strategy. The core mechanism involves designing a probabilistic error correction policy based on the chosen quantum error correction code and employing machine learning to predict the noise distribution. This predictive capability allows for dynamic adjustment of the error correction scheme, ultimately leading to improved quantum information reconstruction. The theoretical underpinnings and algorithmic design are presented, outlining a path toward more robust quantum communication and computation. This approach offers a significant departure from conventional methods and promises to unlock greater resilience in quantum systems facing environmental noise. ---

•Aug 29, 2026•0 citations

On the efficiency of nondegenerate quantum error correction codes for Pauli channels

Gunnar G. Bjork, Jonas Almlöf, Isabel Sainz

We examine the efficiency of pure, nondegenerate quantum-error correction-codes for Pauli channels. Specifically, we investigate if correction of multiple errors in a block is more efficient than using a code that only corrects one error per block. Block coding with multiple-error correction cannot increase the efficiency when the qubit error-probability is below a certain value and the code size fixed. More surprisingly, existing multiple-error correction codes with a code length equal or less than 256 qubits have lower efficiency than the optimal single-error correcting codes for any value of the qubit error-probability. We also investigate how efficient various proposed nondegenerate single-error correcting codes are compared to the limit set by the code redundancy and by the necessary conditions for hypothetically existing nondegenerate codes. We find that existing codes are close to optimal.

arXiv:0810.0541•Oct 2, 2008•1 citation
Communication channels are inherently noisy making error correction coding a major topic of research for modern communication systems. Error correction coding is the addition of redundancy to information transmitted over communication channels to enable detection and recovery of erroneous information. Low-density parity-check (LDPC) codes are a class of error correcting codes that have been effective in maintaining reliability of information transmitted over communication channels. Multiple algorithms have been developed to benefit from the LDPC coding scheme to improve recovery of erroneous information. This work develops a matrix construction that stores the information error probability statistics for a communication channel. This combined with the error correcting capability of LDPC codes enabled the development of the Probabilistic Local Maximum Likelihood Bit Flipping (PLMLBF) algorithm, which is the focus of this research work.
Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing. One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise. Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength. In this work, we introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, resource-efficient error correction. We construct a five-qubit permutation-invariant code that, under probabilistic recovery, achieves a fidelity loss quadratic in the damping strength, thus outperforming existing QEC codes. Formulating PAQEC as an optimization problem, we present a numerical technique based on Charnes-Cooper and semidefinite programming to identify the optimal recovery map for any PAQEC code. Our results establish PAQEC as a powerful tool for developing resource-efficient, high-fidelity quantum codes tailored to realistic noise, with promising implications for near-term quantum devices and future fault-tolerant architectures.
This paper investigates the application of probabilistic error correction techniques within quantum error correction codes, coupled with machine learning algorithms, to enhance the effectiveness of quantum information processing in noisy environments. Traditional quantum error correction methods primarily rely on deterministic correction mechanisms, often failing to adequately account for the probabilistic nature of noise. This work proposes a novel framework that leverages the probabilistic characteristics of quantum error correction codes, combined with machine learning, to dynamically predict noise distributions and adapt the error correction strategy. The core mechanism involves designing a probabilistic error correction policy based on the chosen quantum error correction code and employing machine learning to predict the noise distribution. This predictive capability allows for dynamic adjustment of the error correction scheme, ultimately leading to improved quantum information reconstruction. The theoretical underpinnings and algorithmic design are presented, outlining a path toward more robust quantum communication and computation. This approach offers a significant departure from conventional methods and promises to unlock greater resilience in quantum systems facing environmental noise. ---
We examine the efficiency of pure, nondegenerate quantum-error correction-codes for Pauli channels. Specifically, we investigate if correction of multiple errors in a block is more efficient than using a code that only corrects one error per block. Block coding with multiple-error correction cannot increase the efficiency when the qubit error-probability is below a certain value and the code size fixed. More surprisingly, existing multiple-error correction codes with a code length equal or less than 256 qubits have lower efficiency than the optimal single-error correcting codes for any value of the qubit error-probability. We also investigate how efficient various proposed nondegenerate single-error correcting codes are compared to the limit set by the code redundancy and by the necessary conditions for hypothetically existing nondegenerate codes. We find that existing codes are close to optimal.