λEnter Calculus CompanionRegistered manuscripts, kept distinct

Manuscript En02-B@1 · En02-B-v1.tex · section · ca28dee4

What is completed

Introduction and scope › What is completed · lines 219–240

Back to manuscript

The principal results are:

  1. an explicit batch decoder and a reference-preserving channel certificate;

  2. an exact streaming decoder and a nontrivial one-qubit-memory obstruction;

  3. an intrinsic recovery-channel ledger, avoiding arbitrary off-code lower bounds;

  4. a proved decoder-module scheduling bound for a finite perfect-code tree;

  5. a matching upper and lower bound for a declared one-way distributed implementation;

  6. channel-level implementation-error budgets.

The tree model is a rooted concatenation of the perfect-code isometry. It is not asserted to be a hyperbolic tessellation, a continuum holographic dual, or a model of gravitational dynamics.