Rank metric quantum codes achieve optimal fault correction in stacked systems
Singleton-Optimal Rank-Metric CSS Codes : Equality Structure and Exact Projected-Recovery Radii
Information Theory
Summary
Modern quantum computers can suffer from errors that affect many parts at once but in a structured way. The paper studies special types of quantum error-correcting codes called rank-metric CSS codes, which are better suited for these errors. The authors prove a fundamental limit on how well these codes can perform and identify exactly when codes meet this limit. They also analyze how precisely errors can be detected and corrected under different conditions, providing new families of codes with efficient error recovery.
What this means in practice
- •For quantum hardware engineers: Implement error correction in quantum devices with stacked architectures exploiting rank-metric codes for denser but lower-rank fault patterns.
- •For quantum software developers: Design efficient decoders for quantum codes that guarantee unique error correction up to proven limits, improving fault tolerance software.
A theory result. No direct application yet.
Authors
Myeongjun Kim, Suseong Lee, Jaeho Jeon, Young-Sik Kim
Abstract
Correlated faults from shared control can have dense physical support yet low rank over a base field, motivating rank-metric quantum codes for stacked architectures. We prove an asymmetric rank-metric Singleton bound for Calderbank--Shor--Steane codes, including degenerate codes, and characterize equality through commuting maximum-rank-distance matrix codes. Optimal pairs exist for every admissible parameter triple and are necessarily pure. Comparison with erasure bounds establishes an exact advantage in stacked rank distance for general stabilizer codes at fixed physical resources on certain tall layouts. We determine whether relaxing the recovery target enlarges the worst-case correctable radius. For Singleton-optimal pairs with positive logical dimension, the measured syndrome determines the projected error modulo stabilizers exactly at radii strictly below half the sector rank distance, on every layout and for every nonzero projector. The projected syndrome is recoverable at arbitrary radii exactly when the complementary check space is invariant under the adjoint projector; otherwise, the same radius limit applies. For nontrivial idempotents, this invariance requires more rows than columns or sector distance one. For trace-self-adjoint projectors, linear ambient projected-syndrome interfaces in both sectors exist exactly when the code splits as a tensor product across the projector. Designs placing the two check spaces in complementary projector images are necessarily one-sided whenever they encode logical information. Two explicit families realize the extreme cases of the equality structure, including a two-sided family with an efficient certifying decoder attaining the optimal unique-decoding radius.