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

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

A Search Algorithm for Bases of Calderbank-Shor-Steane Type Quantum Error-Correcting Codes

Kin‐ichiroh Tokiwa

Published Mar 1, 2001• 0 citations
OpenAlex

Related papers

Calderbank-Steane-Shor Holographic Quantum Error Correcting Codes

Thomas M. Stace

Bulletin of the American Physical Society•Mar 7, 2019•2 citations

Error-correctable efficient quantum homomorphic encryption using Calderbank–Shor–Steane codes

IlKwon Sohn, Boseon Kim, Kwangil Bae +2 more

arXiv:2401.08059•Quantum Information Processing•Jan 23, 2025•8 citations

Calderbank-Shor-Steane holographic quantum error-correcting codes

Robert J. Harris, Nathan A. McMahon, Gavin K. Brennen +1 more

We expand the class of holographic quantum error-correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other holographic codes. We demonstrate this by introducing the self-dual Calderbank-Shor-Steane (CSS) heptagon holographic code, based on the 7-qubit Steane code. Finally, we show promising thresholds for the erasure channel by applying a straightforward, optimal erasure decoder to the heptagon code and benchmark it against existing holographic codes.

arXiv:1806.06472•Physical Review A•Nov 1, 2018•61 citations

A survey on quantum error correcting codes

황규호

•Jan 1, 2018•0 citations

Coherent information for Calderbank-Shor-Steane codes under decoherence

Ryotaro Niwa, Jong Yeon Lee

Stabilizer codes lie at the heart of modern quantum-error-correcting codes (QECCs). Of particular importance is a class called Calderbank-Shor-Steane (CSS) codes, which includes many important examples such as toric codes, color codes, and fractons. Recent studies have revealed that the decoding transition for these QECCs could be intrinsically captured by calculating information-theoretic quantities from the mixed state. Here we perform a simple analytic calculation of the coherent information for general CSS codes under local incoherent Pauli errors via diagonalization of the density matrices and mapping to classical statistical mechanical (SM) models. Our result establishes a rigorous connection between the decoding transition of the quantum code and the phase transition in the random classical SM model. It is also directly confirmed for CSS codes that exact error correction is possible if and only if the maximum-likelihood decoder always succeeds in the thermodynamic limit. Thus, the fundamental threshold is saturated by the optimal decoder.

arXiv:2407.02564•Physical Review A•Mar 3, 2025•22 citations

A new description of quantum error-correcting codes

Wen-Ching Li

AMS/IP studies in advanced mathematics•Jul 20, 2007•0 citations
We expand the class of holographic quantum error-correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other holographic codes. We demonstrate this by introducing the self-dual Calderbank-Shor-Steane (CSS) heptagon holographic code, based on the 7-qubit Steane code. Finally, we show promising thresholds for the erasure channel by applying a straightforward, optimal erasure decoder to the heptagon code and benchmark it against existing holographic codes.
Stabilizer codes lie at the heart of modern quantum-error-correcting codes (QECCs). Of particular importance is a class called Calderbank-Shor-Steane (CSS) codes, which includes many important examples such as toric codes, color codes, and fractons. Recent studies have revealed that the decoding transition for these QECCs could be intrinsically captured by calculating information-theoretic quantities from the mixed state. Here we perform a simple analytic calculation of the coherent information for general CSS codes under local incoherent Pauli errors via diagonalization of the density matrices and mapping to classical statistical mechanical (SM) models. Our result establishes a rigorous connection between the decoding transition of the quantum code and the phase transition in the random classical SM model. It is also directly confirmed for CSS codes that exact error correction is possible if and only if the maximum-likelihood decoder always succeeds in the thermodynamic limit. Thus, the fundamental threshold is saturated by the optimal decoder.