Pre-registration (frozen 17 Nov 2026): can a cellular-automaton decoder recover the stored-memory advantage on length-8 sequences of two-qubit Werner data-hiding states?
Frozen protocol and the code that executes it, deposited before the run. CLAUSE: for length-8 sequences of two-qubit Werner data-hiding states with the Boolean label equal to the parity of the symmetric/antisymmetric sectors, the best cellular-automaton decoder recovers less than 50 percent of the accuracy gap between the memory-free local-measurement maximum-likelihood baseline and the stored-memory joint Helstrom rival, after optimising the allowed local measurements. STATED EXPECTATION: a decoder that post-processes a fixed measurement record cannot beat maximum likelihood on that record, so the recovered fraction is expected to be at most zero; this is an exact enumerative confirmation of a known inequality, not a discovery. DESIGN: exact enumeration of all 4^8 records against all 2^8 sector assignments; non-adaptive product projective measurements optimised over the angle between the two qubit axes; a sweep of all 34,816 elementary cellular-automaton decoders (256 rules, two boundaries, 0-16 steps, four readouts) at eight angles; controls on state validity, the analytic 5/6 per-pair accuracy, a Born-rule Monte Carlo check of the enumeration, a planted case the sweep must be able to solve, and the inequality itself. SCOPE: d = 2, equal priors, n = 8, non-adaptive product measurements, one-dimensional elementary automata. It does not cover adaptive local strategies, POVMs, other n, or the row's separate entanglement-flatness threshold claim.
Authors
- John Goodman (ORCID: https://orcid.org/0009-0008-4080-8043)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-17
- DOI
- https://doi.org/10.5281/zenodo.24297406
- Primary Topic
- Quantum Information and Cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00