REVIEW 3 cited by
Good quantum LDPC codes with linear time decoder from lossless expanders
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
read the original abstract
Quantum low-density parity-check (qLDPC) codes are quantum stabilizer codes where each stabilizer acts on a constant number of qubits and each qubit is acted on by a constant number of stabilizers. We study qLDPC codes constructed from balanced products and lossless expanders. We found that assuming the existence of 2-sided lossless expander graphs with free group action, the resulting qLDPC codes have constant rate, linear distance, and linear time decoders.
Forward citations
Cited by 3 Pith papers
-
Transversal non-Clifford gates on almost-good quantum LDPC and quantum locally testable codes
Almost-good qLDPC and qLTC codes admit nontrivial transversal logical multi-controlled-Z gates via cohomological cup products and two-way product-expanding punctured Reed–Solomon local codes.
-
Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors
New minimum-distance bounds for generalized bicycle codes are used to construct two degree-4 check families, [[d^2+1,2,d]] and [[d^2,2,d]], with surface-code-comparable simulated thresholds and a logical CNOT via relabeling.
-
Bias-tailored single-shot quantum LDPC codes
A new hierarchy of bias-tailored single-shot quantum LDPC codes is proposed, with simplified and reduced variants and a periodic 3D XZZX code as an explicit example.
Discussion (0). Sign in to comment.