REVIEW 5 cited by
Quantum LDPC Codes with Almost Linear Minimum Distance
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We give a construction of quantum LDPC codes of dimension $\Theta(\log N)$ and distance $\Theta(N/\log N)$ as the code length $N\to\infty$. Using a product of chain complexes this construction also provides a family of quantum LDPC codes of distance $\Omega(N^{1-\alpha/2}/\log N)$ and dimension $\Omega(N^\alpha \log N)$, where $0 \le \alpha < 1$. We also introduce and study a new operation called lifted product, which naturally generalizes the product operations for quantum codes and chain complexes. Moreover, as a simple byproduct of our results on quantum codes, we obtain a new result on classical codes. We show that for any fixed $R < 1$ there exists an asymptotically good family of classical quasi-cyclic LDPC codes of rate at least $R$ with, in some sense, optimal circulant size $\Omega(N/\log N)$ as the code length $N\to\infty$.
Forward citations
Cited by 5 Pith papers
-
Decoupling 2D translation-invariant topological CSS codes
Every 2D translation-invariant topological CSS code is local-unitarily equivalent, at the maximal anyon-preserving translation symmetry, to stacks of toric codes and product states, with an explicit polynomial-time co...
-
From Koszul-Complex Stabilizer Models to Superselection Profiles: Topological Rigidity and Nonsplit Extensions
For single-layer translation-invariant CSS codes, the nonzero superselection layer and its degree determine the stable translation-invariant Clifford class; multi-layer nonsplit extensions show individual layers do no...
-
Logical Spectroscopy: Lifted-Product Codes with Addressable Bases
Logical spectroscopy decomposes Abelian lifted-product codes into Frobenius packets, builds a complete addressable conjugate logical basis by finite-field algebra plus idempotent lifts, and supplies design diagnostics...
-
Transversal Gates for Highly Asymmetric qLDPC Codes
First qLDPC code constructions with transversal non-Clifford phase gates, obtained by embedding a local code with the desired transversal gate into a Tanner-based hypergraph or balanced product code, at the cost of O(...
-
Demystifying the Balanced Product Code: A Review
A pedagogical re-derivation of balanced product quantum LDPC codes using parity-check matrices, with worked examples and proof sketches, containing no new theorem beyond the known literature.
Discussion (0). Continue with ORCID to comment.