arXiv:2610.14192
Lifting an $[n,k,d]$ Binary Linear Code to an $[[n,k,d]]$ Quantum Stabilizer Code
Thamadathil Aswanth, Navin Kashyap
Abstract
The codeword stabilized (CWS) framework provides a systematic method for constructing quantum error correcting codes from a simple undirected graph and a classical code. When the underlying classical code is linear, the resulting quantum code is a stabilizer code. In this work, we investigate the conditions under which an arbitrary $[n,k,d]$ classical binary linear code can be lifted to an $[[n,k,d]]$ quantum stabilizer code using the CWS framework. We analyze the random CWS code constructed from a given $[n,k,d]$ binary linear code $\mathcal{C}$ and an Erdős-Rényi random graph $\mathrm{G}(n, \frac12)$. We establish a lower bound on the probability that the resulting quantum code preserves the minimum distance $d$ of the classical code. This probabilistic analysis yields a Gilbert-Varshamov-type condition on the $n,k,d$ parameters of the classical code that guarantees the existence of a graph resulting in a quantum code with the same $n,k,d$ parameters.
AI Summary
The paper asks when a given classical binary linear $[n,k,d]$ code can be used, without increasing blocklength, to construct an $[[n,k,d]]$ quantum stabilizer code through the codeword-stabilized (CWS) framework. It fixes the classical code and samples the defining graph from $G(n,1/2)$. The main result lower-bounds the probability that the resulting quantum code is pure and has distance exactly $d$ by $1-2^{k-n}\sum_{j=1}^{d-1}\binom{n}{j}(3^j-1)$. Thus, every classical code satisfying $\sum_{j=1}^{d-1}\binom{n}{j}(3^j-1)<2^{n-k}$ admits a distance-preserving graph. Asymptotically, if $R+h_2(\delta)+\delta\log_2 3<1$, the success probability is at least $1-2^{-n[1-R-h_2(\delta)-\delta\log_2 3]}$. The proof uses the fact that, for any fixed nonzero binary vector $a$, multiplication by a uniformly random graph adjacency matrix produces a uniform vector in $a^\perp$. It applies a union bound over low-weight Pauli errors containing $X$ or $Y$, pairing errors differing by an $X/Y$ swap to calculate their combined failure probability. A minimum-weight classical codeword supplies an undetectable $Z$ error, establishing the distance upper bound $d$. The finite-length existence condition is more restrictive than an existing pure-stabilizer Gilbert–Varshamov bound, while its asymptotic rate–distance condition coincides with established bounds. Its additional guarantee concerns lifting each prescribed classical code in this parameter region. Explicit, efficient deterministic constructions of compatible graphs remain open.
During the preparation of this manuscript, the authors used Gemini 3.1 Pro and GPT-5.6 Luna to refine the presentation of the proofs and polish the writing.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 6 pages, Submitted to ITW 2027