The thesis focuses on the analytical and the numerical study of the Weyl and Dirac Quantum Cellular Automata (QCAs). A QCA describes the unitary local evolution of a denumerable collection of quantum systems in mutual interaction. The Weyl QCA can be derived under the assumptions of linearity, unitarity, locality, homogeneity and isotropy and one can show that it recovers the relativistic evolution of the Weyl equation in the limit of small wave-vectors. Under these assumptions a QCA can be described in terms of a set of so-called transition matrices. In the specific case of the Weyl automaton the transition matrices generate a semigroup allowing for the explicit computation of the propagator in position space as a sum over paths. The computation of the propagator is simplified by encoding the lattice paths as binary strings, so that the problems reduces to a combinatorial problem for the binary strings. The thesis also addresses the Thirring QCA, featuring an on-site interaction. We provide a starting point for the study of the perturbation theory in this case.
The thesis focuses on the analytical and the numerical study of the Weyl and Dirac Quantum Cellular Automata (QCAs). A QCA describes the unitary local evolution of a denumerable collection of quantum systems in mutual interaction. The Weyl QCA can be derived under the assumptions of linearity, unitarity, locality, homogeneity and isotropy and one can show that it recovers the relativistic evolution of the Weyl equation in the limit of small wave-vectors. Under these assumptions a QCA can be described in terms of a set of so-called transition matrices. In the specific case of the Weyl automaton the transition matrices generate a semigroup allowing for the explicit computation of the propagator in position space as a sum over paths. The computation of the propagator is simplified by encoding the lattice paths as binary strings, so that the problems reduces to a combinatorial problem for the binary strings. The thesis also addresses the Thirring QCA, featuring an on-site interaction. We provide a starting point for the study of the perturbation theory in this case.
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 amplitudes 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.
We consider quantum cellular automata on a body-centered cubic lattice and provide a simple derivation of the only two homogenous, local, isotropic, and unitary two-dimensional automata [G. M. D'Ariano and P. Perinotti, Phys. Rev. A 90, 062106 (2014)]. Our derivation relies on the notion of Gram matrix and emphasizes the link between the transition matrices that characterize the automata and the body-centered cubic lattice: The transition matrices essentially are the matrix representation of the vertices of the lattice's primitive cell. As expected, the dynamics of these two automata reduce to the Weyl equation in the limit of small wave vectors and continuous time. We also briefly examine the four-dimensional case, where we find two one-parameter families of automata that reduce to the Dirac equation in a suitable limit.
Simulations of one quantum system by an other has an implication in realization of quantum machine that can imitate any quantum system and solve problems that are not accessible to classical computers. One of the approach to engineer quantum simulations is to discretize the space-time degree of freedom in quantum dynamics and define the quantum cellular automata (QCA), a local unitary update rule on a lattice. Different models of QCA are constructed using set of conditions which are not unique and are not always in implementable configuration on any other system. Dirac Cellular Automata (DCA) is one such model constructed for Dirac Hamiltonian (DH) in free quantum field theory. Here, starting from a split-step discrete-time quantum walk (QW) which is uniquely defined for experimental implementation, we recover the DCA along with all the fine oscillations in position space and bridge the missing connection between DH-DCA-QW. We will present the contribution of the parameters resulting in the fine oscillations on the Zitterbewegung frequency and entanglement. The tuneability of the evolution parameters demonstrated in experimental implementation of QW will establish it as an efficient tool to design quantum simulator and approach quantum field theory from principles of quantum information theory.
This thesis presents a model of Quantum Cellular Automata (QCA). The presented formalism is a natural quantization of the classical Cellular Automata (CA). It is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this model is to act as a theoretical model of quantum computation, similar to the quantum circuit model. The main advantage that QCA have over quantum circuits is that QCA make considerably fewer demands on the underlying hardware. In particular, as opposed to direct implementations of quantum circuits, the global evolution of the lattice in the QCA model does not assume independent control over individual \emph{qudits}. Rather, all qudits are to be addressed collectively in parallel. The QCA model is also shown to be an appropriate abstraction for space-homogeneous quantum phenomena, such as quantum lattice gases, spin chains and others. Some results that show the benefits of basing the model on local unitary operators are shown: computational universality, strong connections to the circuit model, simple implementation on quantum hardware, and a series of applications. A detailed discussion will be given on one particular application of QCA that lies outside either computation or simulation: single-spin measurement. This algorithm uses the techniques developed in this thesis to achieve a result normally considered hard in physics. It serves well as an example of why QCA are interesting in their own right.
The quantum walk is a subset of classical random walks.Considerable research has lately been conducted on quantum walks in relation to quantum computing.The walk may be thought of as a type of quantum cellular automata.In a broader sense, there is a one-to-one link between them.Furthermore, we look at another type of quantum cellular automata that may be thought of as a quantum version of stochastic cellular automata.The quantum walk formalism is a widely used and quite practical paradigm for modelling quantum systems such as Dirac equation simulations, discrete dynamics in both the low and high energy regimes, and the development of a multitude of quantum algorithms.The walker in a QW moves in a quantum superposition of pathways, and the ensuing interference serves as the foundation for a broad range of quantum algorithms, including quantum search, graph isomorphism issues, and rating nodes in a network.To generate a block representation of n-dimensional quantum cellular automata, we apply the following general result to them.As a result, we have demonstrated that their generic, axiomatic formulation nevertheless produces a unifying, operational representation of them.Some non-trivial ramifications are investigated, such as the fact that bijective non-reversible CA are not physical as closed systems, or that quantum information can move faster than classical informationwithin some specified dynamics.Finally, we present n-dimensional quantum cellular automata that can simulate anything else.This means that the initial configuration and local transition rule of any one-dimensional QCA may be stored within the universal QCA's initial configuration.The simulated QCA will then correspond to many phases of the universal QCA.In the sense that each cell in the simulated QCA is represented as a group of nearby cells in the universal QCA, the simulation preserves the topology.Because the encoding is linear, it bears no cost of the calculation.
We consider the Weyl quantum walk in 3+1 dimensions, that is a discrete-time walk describing a particle with two internal degrees of freedom moving on a Cayley graph of the group [Formula: see text], which in an appropriate regime evolves according to Weyl's equation. The Weyl quantum walk was recently derived as the unique unitary evolution on a Cayley graph of [Formula: see text] that is homogeneous and isotropic. The general solution of the quantum walk evolution is provided here in the position representation, by the analytical expression of the propagator, i.e. transition amplitude from a node of the graph to another node in a finite number of steps. The quantum nature of the walk manifests itself in the interference of the paths on the graph joining the given nodes. The solution is based on the binary encoding of the admissible paths on the graph and on the semigroup structure of the walk transition matrices.This article is part of the themed issue 'Second quantum revolution: foundational questions'.