Optimal minimum distance under arbitrary support constraints on parity-check matrices is derived and achievable over large fields, but not always via generalized Reed-Solomon subcodes, as shown by a K_{6,6} incidence counterexample.
Surface codes: Towards practical large-scale quantum computation
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
A hierarchy-aware scheduler for surface-code FTQC multiprogramming delivers 3.1x normalized speedup and 29% improvement over prior baselines on synthetic Clifford+T workloads while keeping mean slowdown low.
citing papers explorer
-
On Codes with Support-Constrained Parity Checks
Optimal minimum distance under arbitrary support constraints on parity-check matrices is derived and achievable over large fields, but not always via generalized Reed-Solomon subcodes, as shown by a K_{6,6} incidence counterexample.
-
No Tile Left Behind: Multiprogramming for Surface-Code Architectures
A hierarchy-aware scheduler for surface-code FTQC multiprogramming delivers 3.1x normalized speedup and 29% improvement over prior baselines on synthetic Clifford+T workloads while keeping mean slowdown low.