A layered gauging method constructs (k+1)-dimensional topological orders, including fracton models like the X-cube, from k-dimensional symmetries such as subsystem, anomalous, or noninvertible ones.
Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
abstract
The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with fixed non-zero rate is logarithmic in the blocklength. We propose a construction of quantum LDPC codes with fixed non-zero rate and prove that the minimum distance grows proportionally to the square root of the blocklength.
citation-role summary
background 3
citation-polarity summary
years
2026 8verdicts
UNVERDICTED 8roles
background 3polarities
background 3representative citing papers
A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showing injection error rates around 10^{-3} or lower under depolarizing and asymmetric噪声
An LLM-guided evolutionary workflow discovers 465 distinct bivariate bicycle and perturbed quantum LDPC codes at n ≤ 360, recovering known codes and reporting new examples such as [[288,16,12]].
A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
The Frontier decoder approximates optimal quantum LDPC decoding via narrow-frontier dynamic programming, achieving near-optimal thresholds for surface and color codes plus state-of-the-art circuit-level performance with small retained lists.
Tensor and balanced product codes arise from a coupled-layer construction via anyon condensation on stacked constituent codes.
Syn@fac optimization reduces estimated circuit failure probability by a factor of 9 on average across non-Clifford benchmarks for bivariate bicycle code modular FTQC architectures, with additional gains from transvection deferral and Clifford insertion.
A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the [[18,4,4]] code.
citing papers explorer
-
Constructing Bulk Topological Orders via Layered Gauging
A layered gauging method constructs (k+1)-dimensional topological orders, including fracton models like the X-cube, from k-dimensional symmetries such as subsystem, anomalous, or noninvertible ones.
-
In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes
A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showing injection error rates around 10^{-3} or lower under depolarizing and asymmetric噪声
-
Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search
An LLM-guided evolutionary workflow discovers 465 distinct bivariate bicycle and perturbed quantum LDPC codes at n ≤ 360, recovering known codes and reporting new examples such as [[288,16,12]].
-
Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation
A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
-
Approximating optimal decoding of quantum LDPC codes with narrow frontiers
The Frontier decoder approximates optimal quantum LDPC decoding via narrow-frontier dynamic programming, achieving near-optimal thresholds for surface and color codes plus state-of-the-art circuit-level performance with small retained lists.
-
Coupled-Layer Construction of Quantum Product Codes
Tensor and balanced product codes arise from a coupled-layer construction via anyon condensation on stacked constituent codes.
-
Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture
Syn@fac optimization reduces estimated circuit failure probability by a factor of 9 on average across non-Clifford benchmarks for bivariate bicycle code modular FTQC architectures, with additional gains from transvection deferral and Clifford insertion.
-
Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures
A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the [[18,4,4]] code.