REVIEW 4 cited by
Quantum "hyperbicycle" low-density parity check codes with finite rate
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
We introduce a "hyperbicycle" ansatz for quantum codes which gives the hypergraph-product (generalized toric) codes by Tillich and Z\'emor and generalized bicycle codes by MacKay et al. as limiting cases. The construction allows for both the lower and the upper bounds on the minimum distance; they scale as a square root of the block length. Many of thus defined codes have finite rate and a limited-weight stabilizer generators, an analog of classical low-density parity check (LDPC) codes. Compared to the hypergraph-product codes, hyperbicycle codes generally have wider range of parameters; in particular, they can have higher rate while preserving the (estimated) error threshold.
Forward citations
Cited by 4 Pith papers
-
The Pangaea Architecture: Fault-Tolerant Heterogeneous Topological Codes via a Quantum Bus
A quantum bus connects many logical qubits through a gauge-code strip, with a claimed factor O(d) reduction in qubit overhead for long-range logical interactions.
-
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...
-
The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
-
Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search
A polynomial-gcd reformulation of bicycle quantum LDPC codes enables an exact-distance search that finds [[66,20,7]] with kd^2/n=14.85 and proves an n=48 exclusion result.
Discussion (0). Continue with ORCID to comment.