arXiv subjects

Andrea Pizzamiglio

Publications and source records attributed to Andrea Pizzamiglio.

4 recordsLinked to original sources

arXiv2025

Renormalisation of Fermionic Cellular Automata

We present an exact renormalisation scheme for fermionic cellular automata on hypercubic lattices. By grouping neighbouring cells into tiles and selecting subspaces within them, multiple evolution steps on the original system correspond to a single step of an effective automaton acting on the subspaces. We derive a necessary and sufficient condition for renormalisability and fully characterise the renormalisation flow for two-cell tiles and two time steps of nearest-neighbour fermionic automata on a chain of spinless modes, identifying all fixed points.

quant-ph↗

arXiv2025

Classification of qubit cellular automata on hypercubic lattices

We classify quantum cellular automata whose cells are qubits, on hypercubic lattices $\mathbb 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.

quant-ph↗

arXiv2024

A perturbative approach to the solution of the Thirring quantum cellular automaton

The Thirring Quantum Cellular Automaton (QCA) describes the discrete time dynamics of local fermionic modes that evolve according to one step of the Dirac cellular automaton followed by the most general on-site number-preserving interaction, and serves as the QCA counterpart of the Thirring model in quantum field theory. In this work, we develop perturbative techniques for the QCA path-sum approach, expanding both the number of interaction vertices and the mass parameter of the Thirring QCA. By classifying paths within the regimes of very light and very heavy particles, we computed the transition matrices in the two- and three-particle sectors to the first few orders. Our investigation into the properties of the Thirring QCA, addressing the combinatorial complexity of the problem, yielded some useful results applicable to the many-particle sector of any on-site number-preserving interactions in one spatial dimension.

quant-ph↗

arXiv2021

Dynamical localization simulated on actual quantum hardware

Quantum computers are invaluable tools to explore the properties of complex quantum systems. We show that dynamical localization of the quantum sawtooth map, a highly sensitive quantum coherent phenomenon, can be simulated on actual, small-scale quantum processors. Our results demonstrate that quantum computing of dynamical localization may become a convenient tool for evaluating advances in quantum hardware performances.

quant-ph↗