REVIEW 5 cited by
On Quantum Weight Reduction
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 general procedure for weight reducing quantum codes. This corrects a previous work\cite{owr}, and introduces a new technique that we call "coning" to effectively induce high weight stabilizers in an LDPC code. As one application, any LDPC code (with arbitrary $O(1)$ stabilizer weights) may be turned into a code where all stabilizers have weight at most $5$ at the cost of at most a constant factor increase in number of physical qubits and constant factor reduction in distance. Also, by applying this technique to a quantum code whose $X$-stabilizers are derived from a classical log-weight random code and whose $Z$-stabilizers have linear weight, we construct an LDPC quantum code with distance $\tilde \Omega(N^{2/3})$ and $\tilde\Omega(N^{2/3})$ logical qubits.
Forward citations
Cited by 5 Pith papers
-
Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry
Cohomology operations, including new higher Pontryagin powers, yield constant-depth logical R_k and multi-controlled R_k gates in homological quantum codes on projective spaces, extending the known color-code paradigm.
-
Coupled-Layer Codes: Beyond Quantum Product Constructions
A new coupled-layer construction unifies quantum product codes with coupled-layer phases and produces non-CSS stabilizer codes, including X-cube, Chamon, fermionic toric code, and Walker-Wang examples.
-
Quantum LDPC codes with design rate 1/5 and good performance below 1000 physical qubits
A new family of rate-1/5 quantum LDPC codes built from non-abelian group symmetries approaches teraquop-region memory error rates below 1000 physical qubits under an optimistic, extrapolated benchmark.
-
Restrictions on non-Clifford fault tolerance and ruling out beyond-SQL quantum metrology
Constant signal-aligned noise makes asymptotic beyond-SQL quantum sensing impossible for any protocol, including encoded, biased, adaptive, and nonstabilizer schemes.
-
Multivariate Multicycle Codes for Complete Single-Shot Decoding
Koszul complexes built from four polynomial generators over cyclic group rings yield CSS codes with both X and Z metachecks, giving small, high-confinement, single-shot-decodable quantum codes.
Discussion (0). Continue with ORCID to comment.