Related papers: Fermionic cellular automata in one dimension

Fermionic cellular automata in one dimension

URL: http://arxiv.org/abs/2501.05349v1
Date: Thu, 09 Jan 2025 16:22:15 GMT
Title: Fermionic cellular automata in one dimension
Authors: Lorenzo S. Trezzini, Matteo Lugli, Paolo Meda, Alessandro Bisio, Paolo Perinotti, Alessandro Tosini,
Abstract summary: We consider quantum cellular automata for one-dimensional chains of Fermionic modes. A complete characterization of nearest-neighbours automata is given.
Score: 72.49909271232748
License:
Abstract: We consider quantum cellular automata for one-dimensional chains of Fermionic modes and study their implementability as finite depth quantum circuits. Fermionic automata have been classified in terms of an index modulo circuits and the addition of ancillary systems. We strengthen this result removing the ancilla degrees of freedom in defining the equivalence classes. A complete characterization of nearest-neighbours automata is given. A class of Fermionic automata is found which cannot be expressed in terms of single mode and controlled-phase gates composed with shifts, as is the case for qubit cellular automata.

Related papers

Theory of free fermions dynamics under partial post-selected monitoring [49.1574468325115]
We derive a partial post-selected Schrdinger"o equation based on a microscopic description of continuous weak measurement. We show that the passage to the monitored universality occurs abruptly at finite partial post-selection. Our approach establishes a way to study MiPTs for arbitrary subsets of quantum trajectories.
arXiv Detail & Related papers (2023-12-21T16:53:42Z)
An Analysis of On-the-fly Determinization of Finite-state Automata [65.268245109828]
We establish an abstraction of on-the-fly determinization of finite-state automata and demonstrate how it can be applied to bound the automatons. A special case of our findings is that automata with many non-deterministic transitions almost always admit a determinization of complexity.
arXiv Detail & Related papers (2023-08-27T11:51:27Z)
Fermion picture for cellular automata [0.0]
We discuss large classes of automata that are equivalent to discretized fermionic quantum field theories with various types of interactions. We perform explicitly the continuum limit for an automaton that describes a quantum particle in a potential for one space dimension.
arXiv Detail & Related papers (2022-03-26T13:50:11Z)
Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
arXiv Detail & Related papers (2021-08-30T16:30:33Z)
Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z)
Directed percolation in non-unitary quantum cellular automata [0.0]
We construct a non-unitary Quantum Cellular Automaton that generalises the Domany-Kinzel cellular automaton. We study the resulting dynamical evolution using the numerical simulations using the tensor network iTEBD algorithm.
arXiv Detail & Related papers (2021-05-04T10:10:16Z)
How perturbing a classical 3-spin chain can lead to quantum features [0.0]
We will work under the premises of the Cellular Automata Interpretation of QM, by Gerard 't Hooft. We will show that quantum phenomena, in particular superposition states, can arise in a deterministic model because of the limited precision of measurements.
arXiv Detail & Related papers (2020-12-30T15:13:44Z)
Coarse-grained quantum cellular automata [0.0]
We provide a simple procedure to coarse-grain color-blind quantum cellular automata that follow Goldilocks rules. A byproduct of this simple toy-model is a general discrete analog of the Stokes law. The QCA we introduce here can be implemented by present-day quantum platforms, such as Rydberg arrays, trapped ions, and superconducting qbits.
arXiv Detail & Related papers (2020-11-09T09:56:16Z)
Fermionic quantum cellular automata and generalized matrix product unitaries [0.688204255655161]
We study matrix product unitary operators (MPUs) for fermionic one-dimensional (1D) chains. We show that (i) fermionic MPUs do not necessarily feature a strict causal cone and (ii) not all fermionic Quantum Cellular Automata (QCA) can be represented as fermionic MPUs.
arXiv Detail & Related papers (2020-07-23T10:20:33Z)
Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
arXiv Detail & Related papers (2020-04-15T05:16:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.