From the 1 of 6 linked papers with an AI index.
6 papers
Quantum XYZ Stabilizer Codes
Alessio Baldelli, Davide Orsucci, Francisco Lázaro +1
The paper introduces quantum XYZ stabilizer codes that use three orthogonal parity‑check matrices for X, Y, and Z stabilizers, providing conditions for genuinely non‑CSS codes and…
On Constructing and Decoding Quantum Triorthogonal Codes
Alessio Baldelli, Olai à . Mostad, Hsuan-Yin Lin +2
A triorthogonal code is a binary quantum Calderbank-Shor-Steane (CSS) code defined by a triorthogonal matrix. Triorthogonal codes are a key ingredient in magic-state distillation,…
Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
Alessio Baldelli, Marco Baldi, Massimo Battaglioni +2
Quantum error correcting codes are essential to achieve fault-tolerant quantum computation. This work introduces two constructions of high-rate, dual-containing (DC) Calderbank--Sh…
Near-Codewords Aware Bit Flipping Decoding of QC-MDPC Codes
Alessio Baldelli, Marco Baldi, Davide De Zuane +1
Bit-Flipping (BF) decoders are a family of decoders widely employed in post-quantum cryptographic schemes based on Quasi-Cyclic Moderate-Density Parity-Check (QC-MDPC) codes, such…
Quantum CSS LDPC Codes based on Dyadic Matrices for Belief Propagation-based Decoding
Alessio Baldelli, Massimo Battaglioni, Jonathan Mandelbaum +2
Quantum low-density parity-check (QLDPC) codes provide a practical balance between error-correction capability and implementation complexity in quantum error correction (QEC). In t…
BF-Max: an Efficient Bit Flipping Decoder with Predictable Decoding Failure Rate
Alessio Baldelli, Marco Baldi, Franco Chiaraluce +1
The Bit-Flipping (BF) decoder, thanks to its very low computational complexity, is widely employed in post-quantum cryptographic schemes based on Moderate Density Parity Check code…