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

International Symposium on Information Theory and its Applications

Efficient quotient codes decodable in polynomial time for quantum error correction and cryptography

Mitsuru Hamada

Published Dec 1, 2008• 1 citation
Publisher

Abstract

Quantum error-correcting codes that achieve high rates in the Shannon theoretic sense and that are efficiently decodable are presented.
DOI
10.1109/isita.2008.4895425

Related papers

Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

Mitsuru Hamada

A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon-theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.

arXiv:quant-ph/0610195•IEEE Transactions on Information Theory•Dec 1, 2008•51 citations

Construction of some new entanglement-assisted quantum error-correcting codes of large lengths

Meng Cao, Fuchuan Wei

Discrete Mathematics•Mar 19, 2024•5 citations

Entanglement-Assisted Quantum Error-Correcting Codes

Todd A. Brun, Min-Hsiu Hsieh

We provide a self-contained introduction for entanglement-assisted quantum error-correcting codes in this book chapter.

arXiv:1610.04013•Oct 13, 2016•0 citations

Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

Mitsuru Hamada

A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.

•Jan 1, 2008•40 citations

Constructions of good entanglement-assisted quantum error correcting codes

Kenza Guenda, Somphong Jitman, Thomas Aaron Gulliver

arXiv:1606.00134•Designs Codes and Cryptography•Jan 25, 2017•256 citations

Quantum Error Correction Code Adaptive Optimization (QCEAO)

Jincheng Zhang

This paper presents a novel approach to quantum error correction (QEC) optimization, termed Quantum Error Correction Code Adaptive Optimization (QCEAO). The core concept revolves around dynamically adjusting the parameters of QEC codes based on real-time error rate measurements during quantum computation. Traditional QEC methods often employ static code parameters, which can be suboptimal for varying error environments. QCEAO addresses this limitation by implementing a feedback loop utilizing decoding algorithms to monitor and adapt to the evolving error landscape. This adaptive strategy significantly enhances the reliability and performance of quantum computations, particularly in scenarios characterized by fluctuating error rates. The paper details the theoretical framework, the adaptive decoding algorithm, and the potential impact of QCEAO on future quantum computing architectures. The primary goal is to establish a robust and efficient QEC system capable of maintaining high fidelity in diverse quantum computing tasks.

•Sep 6, 2026•0 citations
A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon-theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.
A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.
This paper presents a novel approach to quantum error correction (QEC) optimization, termed Quantum Error Correction Code Adaptive Optimization (QCEAO). The core concept revolves around dynamically adjusting the parameters of QEC codes based on real-time error rate measurements during quantum computation. Traditional QEC methods often employ static code parameters, which can be suboptimal for varying error environments. QCEAO addresses this limitation by implementing a feedback loop utilizing decoding algorithms to monitor and adapt to the evolving error landscape. This adaptive strategy significantly enhances the reliability and performance of quantum computations, particularly in scenarios characterized by fluctuating error rates. The paper details the theoretical framework, the adaptive decoding algorithm, and the potential impact of QCEAO on future quantum computing architectures. The primary goal is to establish a robust and efficient QEC system capable of maintaining high fidelity in diverse quantum computing tasks.