Computational Toy Model of Non-Local Information Storage in a Quantum Cellular Automaton

In the paper's words

Can local, unitary dynamics generate the kind of non-local information storage that holographic quantum error correction requires? This paper revisits that question with a fully reproducible, exact state-vector simulation of a twelve-qubit quantum cellular automaton (QCA) evolving under the particle-conserving Fredkin gate. Two structural facts frame the investigation.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. With a documented symmetry-breaking initialization, the Fredkin QCA generates substantial entanglement (half-chain entropy up to 2.5 bits at $t = 6$) and, after erasure of up to two-thirds of the chain, retains residual segment correlations that a swap-gate control loses exactly and immediately.

   from Abstract

2. Half-chain entropy saturating near 2.5 bits on a twelve-qubit chain (maximum 6 bits) is substantial but sub-volume; the corrected text describes the observed regime accurately.

   from 3. Corrections to version 1.0

3. Repeating the Fredkin evolution from a seeded random-phase product state yields the same qualitative structure: half-chain entropy peaks at 2.49 bits at $t = 6$ and fluctuates in the same band (1.05–2.11 bits), endpoint mutual information is 0.124 (erasure-invariant), and the segment mutual information decays over the same range.

   from 5.4 Robustness of the qualitative picture

4. The verification also cost something: the headline "75% erasure robustness" of version 1.0 is gone, replaced by the honest statement that endpoint mutual information is erasure-invariant in every state (Lemma 1), and that the meaningful erasure diagnostics are the segment and conditional quantities.

   from 6.2 What the verification cost

5. The "75% erasure robustness" framing of the earlier version therefore measured a quantity that is robust by definition.

   from 2.3 Two erasure lemmas

6. Entanglement grows rapidly, peaking near 2.5 bits at $t = 6$, then fluctuates between roughly 1.2 and 2.1 bits through $t = 24$ — substantial, structured, and sub-volume (the maximum is 6 bits).

   from 5.1 Entanglement generation

How it is done

1. Second, the mutual information between two probe qubits is exactly invariant under erasure of the qubits between them, under any erasure protocol; the meaningful quantities are therefore the correlations between the surviving segments and the correlations conditioned on the erased block.

   from Abstract

2. The earlier version of this work defined an "erasure protocol" in which a block of central qubits is removed by a partial trace and the mutual information between the two endpoint qubits is then evaluated.

   from 2.3 Two erasure lemmas

3. The reported erasure decay is not reproducible under the stated protocol.

   from 3. Corrections to version 1.0

4. Endpoint mutual information $I(L:R)$ with $L = q_0$, $R = q_{11}$: by Lemma 1 erasure-invariant; reported once as the baseline.

   from 4.3 Metrics

What would falsify it

The paper's text states no explicit falsification criterion; the limits below are what it says about where the claim stops.

Where the claim stops

1. The premises end where these four bounds end; the paper's claims do not extend beyond them.

   from 6.5 Limitations and scope of the claims

2. The fixed-point obstruction and the erasure-invariance lemma remove the original paper's headline claims and replace them with a reproducible, initialization-documented simulation whose genuine content is the zero-versus-nonzero contrast: Fredkin dynamics delocalize information across a chain in ways that transport dynamics cannot, at every erasure scale tested, and the diagnostics that certify this are two lines of information theory that any practitioner can run on a laptop.

   from 8. Conclusion

3. The result is a proof of principle, bounded by its twelve-qubit scale and by the proxy status of its diagnostics: local unitary dynamics can delocalize information across a chain in a way that pure transport dynamics cannot, and this delocalization is measurable with two cheap information-theoretic diagnostics before any decoder is designed.

   from Abstract

Where to read

1. Abstract239 words · 1 min
2. 1. Introduction289 words · 1 min
3. 2. Theoretical framework495 words · 2 min
4. 3. Corrections to version 1.0338 words · 1 min
5. 4. Methods336 words · 1 min
6. 5. Results480 words · 2 min
7. 6. Discussion534 words · 2 min
8. 7. What a practitioner can do with this result340 words · 1 min
9. 8. Conclusion137 words · 1 min