Math 2.0

Resources / preprint

From Random Quantum Codes to Explicit qLDPC Codes via Local Properties 7MVPNFPRKB

URIm2://res/7MVPNFPRKB
Kindpreprint
CreatorsFernando Granha Jeronimo, Xiaojuan Ma, Nikhil Shagrithaya
Date2026-09-30
Subjectsarxiv cs.IT, arxiv math.IT, arxiv quant-ph
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-09-30
IdsarXiv 2609.40252

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
185PTYQ0CWstatementcorollary 8.13arxiv
Rate Threshold, Classical Settingdefinitiondefinition 8.7arxiv
Random normalizers are AEL-robust relative designsstatementcorollary 11.9arxiv
CSS code from a nested pairdefinitiondefinition 8.2arxiv
Quotient-minor gapdefinitiondefinition 4.3arxiv
Informal main constructionstatementtheorem 1.10arxiv
Exact row-span countstatementlemma 2.2arxiv
Flagged realizationdefinitiondefinition 3.2arxiv
Quotienting a flagged witnessstatementlemma 3.5arxiv
Probability of a fixed flagged matrixstatementlemma 4.5arxiv
Uniform nested ensembledefinitiondefinition 7.1arxiv
Folded fixed-map probabilitystatementlemma 9.6arxiv
Dependent-pair boundstatementlemma 5.4arxiv
Expander averagingstatementlemma 12.1arxiv
Subcritical fixed flagstatementproposition 5.2arxiv
Probability of Joint Sector Satisfactionstatementcorollary 8.12arxiv
Flag and feasibilitydefinitiondefinition 3.1arxiv
80JB83BNSFstatementcorollary 8.14arxiv
Kernel-profile mass identitystatementlemma 9.16arxiv
Probability of Joint Sector Satisfactionstatementcorollary 9.15arxiv
Mass separation from positive gapstatementlemma 4.4arxiv
Threshold Preservationstatementtheorem 8.11arxiv
Automatic feasibility in a fixed nested pairstatementlemma 3.3arxiv
Single Sector Rate Thresholddefinitiondefinition 8.6arxiv
Relative subspace designdefinitiondefinition 1.7arxiv
Parity-check nested ensembledefinitiondefinition 4.1arxiv
CSS-AEL lifting theorem for relative subspace designsstatementtheorem 12.8arxiv
Existence of robust inner CSS gadgetsstatementtheorem 11.10arxiv
Informal robust LCL inner gadgetsstatementtheorem 1.9arxiv
Quantum list decodingdefinitiondefinition 1.3arxiv
Profile characterizationstatementtheorem 10.11arxiv
Ratestatementproposition 12.4arxiv
Explicit Quantum List Recoverable Codes, Informalstatementtheorem 1.12arxiv
Folded LCL pairdefinitiondefinition 12.7arxiv
Realization probability in terms of $\lambda$statementproposition 8.5arxiv
Flag slopedefinitiondefinition 8.4arxiv
Folded quotient-minor identitystatementlemma 9.8arxiv
Minimal bad profilestatementlemma 10.12arxiv
Folded threshold theorems and the uniform ensemblestatementcorollary 9.13arxiv
One-sector fixed-type comparisonstatementproposition 8.8arxiv
Flag cost and potentialdefinitiondefinition 4.2arxiv
Quantum list recoverydefinitiondefinition 1.4arxiv
Logical kernel and logical row spacedefinitiondefinition 2.4arxiv
Expectation for one flagstatementcorollary 4.6arxiv
Quotient LCL propertydefinitiondefinition 3.4arxiv
Folded exact-row-space countstatementlemma 9.5arxiv
Fixed qLCL type thresholdstatementtheorem 5.6arxiv
CSS-AEL pairdefinitiondefinition 12.2arxiv
F764CB5XKTstatementtheorem 8.9arxiv
Quantum list decoding, list recovery for CSS codesdefinitiondefinition 1.5arxiv
Folded one-flag expectationstatementcorollary 9.7arxiv
Folded fixed-type thresholdstatementtheorem 9.12arxiv
J7TXG4B5W9statementtheorem 15.2arxiv
Explicit Quantum List Decodable Codes, Informalstatementtheorem 1.11arxiv
Supercritical fixed flagstatementproposition 5.5arxiv
Classical List recoverydefinitiondefinition 1.2arxiv
CSS subspace-design codedefinitiondefinition 1.8arxiv
JSYETQNG2Cstatementtheorem 15.1arxiv
Folded pair submodularitystatementlemma 9.10arxiv
Joint Realization of a Local Profiledefinitiondefinition 8.10arxiv
LZ outer codes over the inner logical alphabetstatementtheorem 13.2arxiv
KAFB99E3N1statementproposition 10.4arxiv
Pair submodularitystatementlemma 5.3arxiv
Random normalizers are LCL robuststatementtheorem 11.8arxiv
Inheritance from ordinary designsstatementproposition 10.5arxiv
Logical distinctness spacedefinitiondefinition 2.5arxiv
Logical distancestatementproposition 10.7arxiv
Subspace commutation via the $\F_q$-pairingstatementlemma 8.1arxiv
Classical List Decodingdefinitiondefinition 1.1arxiv
Folded subcritical directionstatementproposition 9.9arxiv
Map count for bad profilesstatementlemma 11.7arxiv
Potential of a quotient minorstatementlemma 5.1arxiv
Quotient LCL threshold, uniform nested ensemblestatementtheorem 7.3arxiv
Conditioning on full rankstatementlemma 7.2arxiv
Bounded-entropy profile ensembledefinitiondefinition 14.1arxiv
Informal qLCL thresholdstatementtheorem 1.6arxiv
Vector-alphabet extensionstatementlemma 13.1arxiv
AEL lift for folded LCLstatementtheorem 12.6arxiv
Nested pairdefinitiondefinition 2.3arxiv
Positivity of $\kappa_s(U,T)-\kappa_s(W,T\cap W)$statementlemma 8.3arxiv
Robust implies relativestatementproposition 11.5arxiv
Distinctness modulo stabilizersstatementlemma 2.6arxiv
Kernel profiles are an LCL specializationstatementproposition 11.4arxiv
Kernel-profile quotient LCL equals contained profilesstatementproposition 10.10arxiv
AEL-robust folded LCLdefinitiondefinition 11.2arxiv
Contained relative profiledefinitiondefinition 10.9arxiv
Global folded LCL profiledefinitiondefinition 12.5arxiv
Exact CSS orthogonalitystatementproposition 12.3arxiv
Bounded-entropy folded profile classdefinitiondefinition 11.1arxiv
Explicit LCL CSS familystatementtheorem 14.2arxiv
Local profiledefinitiondefinition 2.1arxiv
Monotonicitystatementproposition 10.6arxiv
Folded dependent-pair boundstatementlemma 9.11arxiv
AEL-robust relative subspace designdefinitiondefinition 11.3arxiv
Folded parity-check and uniform ensemblesdefinitiondefinition 9.4arxiv
Random-subspace containmentstatementlemma 11.6arxiv
Quotient LCL threshold, parity-check ensemblestatementtheorem 6.1arxiv

Catalogue records