Quantum cellular automata for quantum error correction and density classification
Thiago L. M. Guedes, Don Winter, and Markus M\"uller

TL;DR
This paper introduces quantum cellular automata with built-in quantum error correction, demonstrating their potential to maintain quantum information integrity through local, automated updates inspired by classical density classification rules.
Contribution
The paper proposes and analyzes quantum cellular automata capable of quantum error correction, bridging a gap in understanding their long-range order and error correction abilities.
Findings
Quantum cellular automata can perform quantum error correction.
Simulations show they can preserve quantum information over multiple steps.
Designs based on classical rules demonstrate practical error correction potential.
Abstract
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant manner on all cells/qudits of a register, generating a global rule that updates cell states locally, i.e., based solely on the states of their neighbors. Although desirable features in many applications, it is generally not clear to which extent these fully automated discrete-time local updates can generate and sustain long-range order in the (noisy) systems they act upon. In special, whether and how quantum cellular automata can perform quantum error correction remain open questions. We close this conceptual gap by proposing quantum cellular automata with quantum-error-correction capabilities. We design and investigate two (quasi-)one dimensional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
