Manuscript Psy04-B@1 · Psy04-B-v1.tex · section · 62c2b6f0
The sharp classical benchmark on the cut
The sharp classical benchmark on the cut · lines 905–911
This is an established random-access-code benchmark AmbainisRAC. Sequential arrival does not tighten it: the upper proof already permits the more general batch encoder.
Nearby in this section
- section: The sharp classical benchmark on the cut
- lemma: Lemma: Deterministic-table reduction
- section: The sharp classical benchmark on the cut
- theorem: Theorem: Sharp two-state classical bound
- proposition: Proposition: Storage processing cannot improve a fixed classical encoder's optimum
- section: The sharp classical benchmark on the cut