We classify quantum cellular automata whose cells are qubits, on hypercubic lattices Zs, 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.
Classification of Qubit Cellular Automata on Hypercubic Lattices
Pizzamiglio A.
;Bisio A.;Perinotti P.
2025-01-01
Abstract
We classify quantum cellular automata whose cells are qubits, on hypercubic lattices Zs, 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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
