Struct HierarchicalTiledDecoder 

pub struct HierarchicalTiledDecoder { /* private fields */ }

Recursive multi-scale decoder achieving O(d^{2-epsilon} polylog d) expected complexity for physical error rates below threshold.

The lattice is recursively partitioned into tiles. At each level, tiles are decoded independently and boundary corrections are merged. Because error chains cross tile boundaries with probability decaying exponentially in the tile side length, the merge cost is dominated by a sublinear fraction of the total work.

Implementations

impl HierarchicalTiledDecoder

pub fn new(tile_size: u32, num_levels: u32) -> Self

Create a new hierarchical tiled decoder.

• tile_size – side length of base tiles (must be >= 2).
• num_levels – number of recursive coarsening levels.

pub fn complexity_bound( &self, code_distance: u32, physical_error_rate: f64, ) -> ComplexityBound

Provable complexity bound for a given code distance and error rate.

Trait Implementations

impl SurfaceCodeDecoder for HierarchicalTiledDecoder

fn decode(&self, syndrome: &SyndromeData) -> Correction

Decode a syndrome and return the inferred correction.

fn name(&self) -> &str

Human-readable name for this decoder.