Balanced triples attaining finite-degree GV
Balanced triples attaining finite-degree GV
Let be any balanced triple satisfying
The corresponding HA-side and MN-side classical constituent codes are the codes associated with this triple, and a balanced triple is one satisfying the displayed relations. Balanced triples attaining finite-degree GV. The HA-side and MN-side classical constituent codes attain GV distance already at fixed finite degree, and hence the associated nested CSS family attains the CSS GV distance. This claim concerns finite-degree classical constituent performance and its implication for the associated CSS family; the surrounding discussion indicates that the rigorous certification is concentrated on even , while extensions to odd require additional estimates. The supplied text does not establish whether this stated conjectural claim has been resolved.
Sources & referencesView supporting material
Primary source
Kenta Kasai, “Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound”, arXiv:2603.24588 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.