Classification of Qubit Cellular Automata on Hypercubic Lattices
We classify quantum cellular automata whose cells are qubits, on hypercubic lattices Z^{s}, with the von Neumann neighborhood scheme, in terms of realizability as finite-depth quantum circuits. We show the most general structure of such automata and use its characterisation to simulate a few steps of evolution and evaluate the rate of entanglement production between one cell and its surroundings.
Authors
- Andrea Pizzamiglio
- Alessandro Bisio (ORCID: https://orcid.org/0000-0002-9356-3448)
- Paolo Perinotti (ORCID: https://orcid.org/0000-0003-4825-4264)
Institutions
- University of Pavia (IT)
- Istituto Nazionale di Fisica Nucleare, Sezione di Pavia (IT)
Publication Details
- Journal
- Physical Review Letters
- Published
- 2025-06-18
- DOI
- https://doi.org/10.1103/physrevlett.134.240601
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- European Commission
- Multidisciplinary University Research Initiative