DOCSLIB.ORG

When—And How—Can a Cellular Automaton Be Rewritten As a Lattice Gas?

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
When—And How—Can a Cellular Automaton Be Rewritten As a Lattice Gas? calg November 2, 2018 When—and how—can a cellular automaton be rewritten as a lattice gas? aTommaso Toffoli, bSilvio Capobianco, and cPatrizia Mentrasti aElectrical and Computer Engineering, Boston University bSchool. Comp. Sci., Reykjavik University, Iceland cDip. di Matematica, Universit`adi Roma “La Sapienza” [email protected], [email protected], [email protected] Both cellular automata (CA) and lattice-gas automata (LG) provide finite algorithmic presentations for certain classes of infinite dynamical systems studied by symbolic dynamics; it is customary to use the term ‘cellular automaton’ or ‘lattice gas’ for the dynamic system itself as well as for its presentation. The two kinds of presentation share many traits but also display profound differences on issues ranging from decidability to modeling convenience and physical implementability. Following a conjecture by Toffoli and Margolus, it had been proved by Kari (and by Durand–Lose for more than two dimensions) that any invertible CA can be rewritten as an LG (with a possibly much more complex “unit cell”). But until now it was not known whether this is possible in general for noninvertible CA—which comprise “almost all” CA and represent the bulk of examples in theory and applications. Even circumstantial evidence—whether in favor or against—was lacking. Here, for noninvertible CA, (a) we prove that an LG presentation is out of the question for the vanishingly small class of surjective ones. We then turn our attention to all the rest—noninvertible and nonsurjective— which comprise all the typical ones, including Conway’s ‘Game of Life’. For these (b) we prove by explicit construction that all the one-dimensional ones are representable as LG, and (c) we present and motivate the conjecture that this result extends to any number of dimensions. The tradeoff between dissipation rate and structural complexity implied by the above results have compelling implications for the thermodynamics of computation at a microscopic scale. I do not know of any single instance where something useful argued conclusions. With as much irritation one could re- for the work on lattice gases has been borrowed from the tort, “How can lattice gases differ ‘in essence’ from cellular cellular automata field. Lattice gases differ in essence automata if they are merely a subset of them? What are from cellular automata. A confusion of the two fields dis- torts our thinking, hides the special properties of lattice these CA legacies that may ‘distort our thinking’ and ‘hide gases, and makes it harder to develop a good intuition. the special properties of lattice gases’? And aren’t there dy- (Michel H´enon[17], with specific reference to Wolfram[42]) namical systems that are much more naturally and easily modeled as cellular automata?” Today, with the benefit of twenty years’ hindsight—and especially after the results of the present paper—we are in a 1 Introduction position to defuse the argument. H´enon’s appeal could less belligerantly be reworded as follows: “Even though CA and Cellular automata (CA) provide a quick modeling route to LG describe essentially the same class of objects, for sound phenomenological aspects of nature—especially the emer- pedagogical reasons it may be expedient to deal with them arXiv:0709.1173v1 [nlin.CG] 7 Sep 2007 gence of complex behavior in dissipative systems. But in separate chapters—or even in separate books for different lattice-gas automata (LG) are unmatched as a source of audiences and applications. What is ox in the stable may fine-grained models of fundamental aspects of physics, es- well be beef on the table.” The bottom-line message is pecially for expressing the dynamics of conservative1 sys- that these two modeling approaches do not reflect mutually tems. exclusive strategies, but just opposite tradeoffs between the In the quote at the beginning of this paper, one may well structural complexity of a piece of computing machinery sympathize with H´enon’s annoyance: it turns out that dy- and its thermodynamic efficiency. namical behavior that is synthesized with the utmost nat- uralness when using lattice gases as a “programming lan- guage” become perversely hard to express in the cellular 2 Preview automata language. Yet, H´enon’s are visceral feelings, not Let C andLbe the sets of dynamical systems representable, 1A dynamics is called ‘conservative’ if it is the manifest expression of an invertible microscopic mechanism. It is called ‘dissipative’ if respectively, as cellular automata and lattice gases. Our the underlying mechanism is not invertible to begin with, or if its overall question is, How are these two sets related? On invertibility is de facto irrelevant because one is not capable or willing one hand, we shall see that any lattice gas can be trivially to maintain a strict accounting of microscopic states—perhaps owing rewritten as a cellular automaton—henceL ⊂C. As for the to lack of precise knowledge of the initial state and the evolution laws, impredictable influences on the part of the environment, or the sheer converse issue, i.e., how much of C is inL , let’s recall that size of the task. C is naturally partitioned into three classes which reflect 1 fundamental categorical properties, namely, (One must keep in mind that in a cellular automaton the t state set for qx is restricted to a finite alphabet A, while for descriptive name categorical property a differential equation it ranges over the whole continuum C+ invertible injective and surjective R. On the other hand, the local map f of a cellular automa- C◦ almost invertible noninjective but surjective ton is an unrestricted function of its arguments, while the C− locally lossy noninjective, nonsurjective corresponding map g of the finite-difference scheme can only see its arguments through “small differences”—qx+1 − qx, According to a conjecture made by one of us in 1990 and of the order of h, in space, and qt+1 − qt, of the order of k, proved by Kari in 1996 for the 1D and 2D cases and in time.) Durand–Lose in 2001 for the general case, the vanishingly + Though symbolic dynamics systems are generally infinite, small class C of invertible cellular automata is definitely both cellular automata and lattice-gas automata manage to “in.” For the other two classes, evidence has been lacking 2 provide finite algorithmic presentations for certain classes either way —which is particularly irritating for such decep- of them. These two kinds of presentation share a number tively simple CA as the one consisting merely of a row of of traits but also display profound differences—on issues and 2-input gates. ranging from decidability to physical implementability—to Here we first dismiss, as definitely “out,” the vanishingly the point that one might suspect that CA and LG specify ◦ small class C of almost invertible CA—where, while the quite different kinds of dynamical systems (see the H´enon system as a whole loses in one step a nonzero amount of quote at the beginning of this paper). information, the amount of loss per site is nonetheless zero. On the other hand, for a number of reasons, some empir- − What is left is the class C of locally lossy CA; these ical and some esthetical, we’ve long been entertaining the lose in one step a nonzero amount of information per site. notion—the hope, if you wish, since the evidence was ex- This class comprises almost all cellular automata. Here tremely scant either way—that in fact CA and LG provide we present a procedure for rewriting any one-dimensional just different presentations for the same kind of objects. In − C CA into an LG (which will have a more complex unit other words, letting C denote the set of dynamical systems cell, consisting of two layers and spanning more than one representable as cellular automata andL the set of those site of the original CA). We also show a procedure for a representable as lattice gases, one may ask, How are C and simple 2D example. Work is in progress on an analogous Lrelated? Are they disjoint, partially overlapping, or even construction (with a number of layers that increases with coincident? If the latter were true, how come that LG pre- the number of dimensions) hoped to be of general applica- sentations of even the very simplest CA are so hard to come bility. On the basis of these partial results, we propose the by? conjecture that—exception made for the paradoxical class ◦ C already dismissed above—the family of dynamical sys- t+1 tems presentable as cellular automata and that presentable as lattice gases coincide. t 3 Background Figure 1: A simple one-dimensional cellular automaton; this circuit can be thought of as a presentation of a dynamical system Symbolic dynamics studies a class of dynamical systems on the full shift[25]. For concreteness, assume that the site state which display topological continuity (reflecting locality of alphabet is binary and the local transition function at each site, interaction) and invariance under space and time transla- denoted by a shaded gate, is a logic and; the gates are fed by tion (the regularity of a “spacetime crystal”[39])—and can fanout (or “signal replicator”) nodes, denoted by dots. Is there thus be viewed as discrete, locally-finite versions of the par- an equivalent lattice gas? tial differential equations of field theories. For example, the local map of a simple one-dimensional cellular automaton, Take, for example, the simplest nontrivial CA, namely, which is a a recurrence relation of the form a string of 2-input and gates fed by fanout nodes (Fig. 1). Until now, no one had managed to exhibit a functionally t+1 t t qx = f(qx, qx+1) equivalent LG or, contrariwise, prove that such an LG can- not exist! What’s perhaps even more intriguing, this very is analogous to the well-known forward-time, forward-space question has never (as far as we know) been raised in the finite-difference scheme[32, p.
Load more

Recommended publications
  • Elementary Gates for Quantum Computation
    Elementary gates for quantum computation Adriano Barenco Charles H. Bennett Richard Cleve y z Oxford University IBM Research University of Calgary David P. DiVincenzo Norman Margolus Peter Shor x { y IBM Research MIT AT&T Bell Labs Tycho Sleator John Smolin Harald Weinfurter yy k UCLA Univ. of Innsbruck New York Univ. submitted to Physical Review A, March 22, 1995 (AC5710) Abstract We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Bo olean values (x; y )to(x; x y )) is universal in the sense that all unitary op erations on arbitrarily many bits n n (U(2 )) can b e expressed as comp ositions of these gates. Weinvestigate the numb er of the ab ove gates required to implement other gates, such as gener- alized Deutsch-To oli gates, that apply a sp eci c U(2) transformation to one input bit if and only if the logical AND of all remaining input bits is satis ed. These gates play a central role in many prop osed constructions of quantum com- putational networks. We derive upp er and lower b ounds on the exact number Clarendon Lab oratory, Oxford OX1 3PU, UK; [email protected]. y Yorktown Heights, New York, NY 10598, USA; b ennetc/[email protected]. z Department of Computer Science, Calgary, Alb erta, Canada T2N 1N4; [email protected]. x Lab oratory for Computer Science, Cambridge MA 02139 USA; [email protected].
    [Show full text]
  • Collision-Based Computing Springer-Verlag London Ltd
    Collision-Based Computing Springer-Verlag London Ltd. Andrew Adamatzky (Ed.) Collision-Based Computing , Springer Andrew Adamatzky Facu1ty of Computing, Engineering and Mathematical Sciences, University of the West of England, Bristol, BS16 lQY British Library Cataloguing in Publication Data Collision-based computing l.Cellular automata 1. Adamatzky, Andrew 511.3 ISBN 978-1-85233-540-3 Library of Congress Cataloging -in -Publication Data A catalog record for this book is available from the Library of Congress. Apart from any fair dealing for the purposes of research or private study, or criticism or review, as permitted under the Copyright, Designs and Patents Act 1988, this publication may only be reproduced, stored or transmitted, in any form or by any means, with the prior permission in writing of the publishers, or in the case of reprographic reproduction in accordance with the terms of licences issued by the Copyright Licensing Agency. Enquiries concerning reproduction outside those terms should be sent to the publishers. ISBN 978-1-85233-540-3 ISBN 978-1-4471-0129-1 (eBook) DOI 10.1007/978-1-4471-0129-1 http://www.springer.co. uk © Springer-Verlag London 2002 Originally published by Springer-Verlag London Berlin Heidelberg in 2002 The use of registered names, trademarks etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant laws and regulations and therefore free for general use. The publisher makes no representation, express or implied, with regard to the accuracy of the information contained in this book and cannot accept any legal responsibility or liability for any errors or omissions that may be made.
    [Show full text]
  • Tommaso TOFFOLI [email protected] Research Affiliate Work: (617) 353-9846 Boston University Home: (617) 410-7138 Electrical and Computer Engineering
    Tommaso TOFFOLI [email protected] Research Affiliate work: (617) 353-9846 Boston University home: (617) 410-7138 Electrical and Computer Engineering Curriculum Vitae Affiliate Member 15 Oct 2020 formerly Principal Research Scientist (1977–1995) Massachusetts Institute of Technology Laboratory for Computer Science (now csail) IEEE Fellow, Oct 2012 PhD in Computer and Communication Sciences The University of Michigan, Oct 1977 Doctor of Physics University of Rome, Italy, Feb 1967 INTERESTS AND EXPERTISE. ACHIEVEMENTS Information Mechanics. Foundations and physical aspects of computing. Theory of cellular automata. Interconnection complexity, synchronization. Formal models of computation consistent with microscopical physics (uniformity, locality, reversibility, inertia and other conservation principles, variational, relativistic, and quantum aspects of computation). Proved the computation-universality of invertible cellular automata (1977); formulated the conjecture (later proved by Kari) that all invertible cellular automata are structurally invertible (1990). Introduced the “Toffoli gate” (1981), which was later adopted by Feynman and others as a fundamental logic primitive for quantum computation. Proposed, with Fredkin, the first concrete charge- conserving scheme for computation (1980)—an idea that has been taken up by the low-power industry in recent years. Proved that dissipative cellular automata algorithms can be replaced by nondissipative lattice- gas algorithms (2006–2009). Advances in quantum information theory and thermodynamics (2006–2010). Fungibility of bulk computation; connections between lagrangian action and computation capacity (1998–). Fine-grained architectures for massively parallel computation. Pioneering work on cellular au- tomata machines: design, realization, support, and applications (1982). Development and realization (with Norman Margolus) of cam8, a fine-grained, indefinitely scalable multiprocessor architecture which embodies the concept of programmable matter (1987–1993).
    [Show full text]
  • Quantum Cellular Automata
    Quantum Cellular Automata by Bassam Aoun & Mohamad Tarifi ABSTRACT We provide an introduction to Quantum Cellular Automata. 2 ACKNOWLEDGEMENTS We acknowledge our friend Carlos for extremely useful conversations and his good sense of humor! We acknowledge Prof. Michel Mosca for his excellent course that introduced and hooked us to Quantum Information Processing. We also acknowledge University of Waterloo for being a good host. 3 CO NTENTS Abstract .......................................................................................................................... 2 Acknowledgements....................................................................................................... 3 Contents ......................................................................................................................... 4 1. Introduction............................................................................................................... 5 2. Brief Overview of Quantum Mechanics............................................................... 6 2.1 The beam splitter experiment ........................................................................... 6 2.2 Quantum Mechanics Postulates ....................................................................... 8 2.3 Quantum Bits .................................................................................................... 10 2.4 Quantum Computing ....................................................................................... 14 2.5 Qunautm Algorithm........................................................................................
    [Show full text]
  • Programmingtheuniverse File:///C|/Lloyd-Programminguniverse/1
    ProgrammingtheUniverse file:///C|/Lloyd-ProgrammingUniverse/1.htm10/07/2007 15:28:55 ProgrammingtheUniverse THIS IS A BORZOI BOOK PUBLISHED BY ALFRED A. KNOPF Copyright © 2006 by Seth Lloyd All rights reserved. Published in the United States by Alfred A. Knopf, a division of Random House, Inc., New York, and in Canada by Random House of Canada Limited, Toronto. www.aaknopf.com Knopf, Borzoi Books, and the colophon are registered trademarks of Random House, Inc. Library of Congress Cataloging-in-Publication Data Lloyd, Seth, [date] Programming the universe : a quantum computer scientist takes on the cosmos / by Seth Lloyd. p. cm. eISBN-13: 978-0-307-26471-8 eISBN-10: 0-307-26471-8 1. Quantum theory—Mathematical models. 2. Microcomputers—Programming. 3. Quantum computers. I. Title. QC174.12.L57 2006 530.12—dc22 2005050408 v1.0 file:///C|/Lloyd-ProgrammingUniverse/2.htm10/07/2007 15:28:56 ProgrammingtheUniverse To Eve file:///C|/Lloyd-ProgrammingUniverse/3.htm10/07/2007 15:28:56 ProgrammingtheUniverse Contents Title Page Dedication Prologue: The Apple and the Universe PART ONE: THE BIG PICTURE CHAPTER ONE: Introduction CHAPTER TWO: Computation CHAPTER THREE: The Computational Universe PART TWO: A CLOSER LOOK CHAPTER FOUR: Information and Physical Systems CHAPTER FIVE: Quantum Mechanics CHAPTER SIX: Atoms at Work CHAPTER SEVEN: The Universal Computer CHAPTER EIGHT: Complexity Simplified Personal Note: The Consolation of Information Acknowledgments Further Reading A Note About the Author Copyright file:///C|/Lloyd-ProgrammingUniverse/4.htm (1 of 2)10/07/2007 15:28:56 ProgrammingtheUniverse file:///C|/Lloyd-ProgrammingUniverse/4.htm (2 of 2)10/07/2007 15:28:56 ProgrammingtheUniverse PROLOGUE The Apple and the Universe “In the beginning was the bit,” I began.
    [Show full text]
  • Quantum Cellular Automata
    QUANTUM CELLULAR AUTOMATA Wim van Dam Master’s thesis (387) Computing Science Institute University of Nijmegen, The Netherlands (current email-address: [email protected]) written under the supervision of prof. dr. ir. P.M.B. Vit´anyi (C.W.I. & University of Amsterdam) and prof. C.H.A. Koster (University of Nijmegen) Summer 1996 2 Acknowledgments Writing a master’s thesis can sometimes be a lonesome activity, I therefore feel privileged to be able to thank the following people. First of all I want to thank Kees Koster and Paul Vit´anyi for their experienced guidance and interest during the writing of this thesis. I also thank Andr´eBerthiaume for giving me a ‘first hand’ introduction in quantum computing, his knowledge of this field prevented me from making a lot of typical beginner’s mistakes. Sjoerd Stallinga and Paul Bastiaansen should be mentioned for explaining me the essentials of quantum mechanics. The hospitality of Christoph D¨urr and Huong LˆeThanh made an inspiring and enjoyable visit to Paris possible in the summer of ’95. In 1996, the Institute for Scientific Interchange Foundation enabled me to go to the ‘Torino workshop on Quantum Computing’. During this workshop I enjoyed the interesting discussions with Tommaso Toffoli, Seth Lloyd, Norman Margolus, Adriano Barenco and David Meyer. 3 Contents 1 Quantum Physics 9 1.1 The Two-Slit Experiment . 9 1.2 TheBra-ketnotation.................................. 9 1.3 The Mathematics of Quantum Physics . 11 1.4 The Superposition of Basis States . 12 1.5 Evolution of Quantum Mechanical Systems . 13 1.6 Expanding the State Space .
    [Show full text]
  • Reversibility for Efficient Computing Michael P. Frank
    Reversibility for E±cient Computing (Manuscript, Based on Ph.D. Thesis) Michael P. Frank CISE Department University of Florida http://www.cise.ufl.edu/~mpf Working version of Dec. 20, 1999 This document is available online through http://www.cise.ufl.edu/~mpf/manuscript Abstract Today's computers are based on irreversible logic devices, which have been known to be fundamentally energy-ine±cient for several decades. Recently, alternative re- versible logic technologies have improved rapidly, and are now becoming practical. In traditional models of computation, pure reversibility seems to decrease overall computational e±ciency; I provide a proof to this e®ect. However, traditional models ignore important physical constraints on information processing. This thesis gives the ¯rst analysis demonstrating that in a realistic model of com- putation that accounts for thermodynamic issues, as well as other physical constraints, the judicious use of reversible computing can strictly increase asymptotic computa- tional e±ciency, as machine sizes increase. I project real bene¯ts for supercomputing at a large (but achievable) scale in the fairly near term. And with proposed future computing technologies, I show that reversibility will bene¯t computing at all scales. Next, the thesis demonstrates that reversible computing techniques do not make computer design much more di±cult. I describe how to design asymptotically e±cient processors using an \adiabatic" reversible electronic logic technology that can be built with today's microprocessor fabrication processes. I describe a simple universal reversible parallel processor chip that our group recently fabricated, and a reversible instruction set for a more traditional RISC-style uniprocessor.
    [Show full text]
  • 1 Crystalline Computation
    Chapter 18 of Feynman and Computation (A. Hey, ed.), Perseus Books (1999). 1 CRYSTALLINE COMPUTATION Norman Margolus Abstract Discrete lattice systems have had a long and productive history in physics. Ex- amples range from exact theoretical models studied in statistical mechanics to ap- proximate numerical treatments of continuum models. There has, however, been relatively little attention paid to exact lattice models which obey an invertible dy- namics: from any state of the dynamical system you can infer the previous state. This kind of microscopic reversibility is an important property of all microscopic physical dynamics. Invertible lattice systems become even more physically realis- tic if we impose locality of interaction and exact conservation laws. In fact, some invertible and momentum conserving lattice dynamics—in which discrete particles hop between neighboring lattice sites at discrete times—accurately reproduce hy- drodynamics in the macroscopic limit. These kinds of discrete systems not only provide an intriguing information- dynamics approach to modeling macroscopic physics, but they may also be supremely practical. Exactly the same properties that make these models physically realistic also make them efficiently realizable. Algorithms that incorporate constraints such as locality of interaction and invertibility can be run on microscopic physical hard- ware that shares these constraints. Such hardware can, in principle, achieve a higher density and rate of computation than any other kind of computer. Thus it is interesting to construct discrete lattice dynamics which are more physics-like both in order to capture more of the richness of physical dynamics in informational models, and in order to improve our ability to harness physics for computation.
    [Show full text]
  • An Introduction to Quantum Computing
    An Introduction to Quantum Computing Phillip Kaye Raymond Laflamme Michele Mosca 1 TEAM LinG 3 Great Clarendon Street, Oxford ox2 6dp Oxford University Press is a department of the University of Oxford. It furthers the University’s objective of excellence in research, scholarship, and education by publishing worldwide in Oxford New York Auckland Cape Town Dar es Salaam Hong Kong Karachi Kuala Lumpur Madrid Melbourne Mexico City Nairobi New Delhi Shanghai Taipei Toronto With offices in Argentina Austria Brazil Chile Czech Republic France Greece Guatemala Hungary Italy Japan Poland Portugal Singapore South Korea Switzerland Thailand Turkey Ukraine Vietnam Oxford is a registered trade mark of Oxford University Press in the UK and in certain other countries Published in the United States by Oxford University Press Inc., New York c Phillip R. Kaye, Raymond Laflamme and Michele Mosca, 2007 The moral rights of the authors have been asserted Database right Oxford University Press (maker) First published 2007 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission in writing of Oxford University Press, or as expressly permitted by law, or under terms agreed with the appropriate reprographics rights organization. Enquiries concerning reproduction outside the scope of the above should be sent to the Rights Department, Oxford University Press, at the address above You must not circulate this book in any other binding or cover and you must
    [Show full text]
  • Large Scale Cellular Automata on Fpgas: a New Generic Architecture and a Framework
    Large Scale Cellular Automata on FPGAs: A New Generic Architecture and a Framework NIKOLAOS KYPARISSAS∗ and APOSTOLOS DOLLAS, Technical University of Crete, Greece Cellular Automata (CA) are discrete mathematical models discovered in the 1940s by John von Neumann and Stanislaw Ulam, and used extensively in many scientific disciplines ever since. The present work evolved from a Field Programmable Gate Array (FPGA)-based design to simulate urban growth into a generic architecture which is automatically generated by a framework to efficiently compute complex cellular automata with large 29 × 29 neighborhoods in Cartesian or toroidal grids, with 16- or 256-states per cell. The new architecture and the framework are presented in detail, including results in terms of modeling capabilities and performance. Large neighborhoods greatly enhance CA modeling capabilities, such as the implementation of anisotropic rules. Performance-wise, the proposed architecture runs on a medium-size FPGA up to 51 times faster vs. a CPU running highly optimized C code. Compared to GPUs the speedup is harder to quantify because CA results have been reported on GPU implementations with neighborhoods up to 11 × 11, in which case FPGA performance is roughly on par with GPU; however, based on published GPU trends, for 29 × 29 neighborhoods the proposed architecture is expected to have better performance vs. a GPU, at one-tenth the energy requirements. The architecture and sample designs are open source available under the creative commons license. CCS Concepts: • Computer systems organization ! Real-time system architecture; Special purpose systems; • Computing methodologies ! Real-time simulation; • Hardware ! Reconfigurable logic applications; Hardware accelerators. Additional Key Words and Phrases: cellular automata, generic architecture, framework, FPGA accelerator ACM Reference Format: Nikolaos Kyparissas and Apostolos Dollas.
    [Show full text]
  • Arxiv:Comp-Gas/9811002V1 10 Nov 1998 Eaieyltl Teto Adt Xc Atc Oeswihoe an Obey Which Models Lattice Has, Exact There to Namics Ph Paid M Models
    To appear in Feynman and Computation (A. Hey, ed.), Perseus Books (1998). 1 CRYSTALLINE COMPUTATION Norman Margolus Abstract Discrete lattice systems have had a long and productive history in physics. Ex- amples range from exact theoretical models studied in statistical mechanics to ap- proximate numerical treatments of continuum models. There has, however, been relatively little attention paid to exact lattice models which obey an invertible dy- namics: from any state of the dynamical system you can infer the previous state. This kind of microscopic reversibility is an important property of all microscopic physical dynamics. Invertible lattice systems become even more physically realis- tic if we impose locality of interaction and exact conservation laws. In fact, some invertible and momentum conserving lattice dynamics—in which discrete particles hop between neighboring lattice sites at discrete times—accurately reproduce hy- drodynamics in the macroscopic limit. These kinds of discrete systems not only provide an intriguing information- dynamics approach to modeling macroscopic physics, but they may also be supremely practical. Exactly the same properties that make these models physically realistic also make them efficiently realizable. Algorithms that incorporate constraints such as locality of interaction and invertibility can be run on microscopic physical hard- ware that shares these constraints. Such hardware can, in principle, achieve a higher density and rate of computation than any other kind of computer. Thus it is interesting to construct discrete lattice dynamics which are more physics-like both in order to capture more of the richness of physical dynamics in informational models, and in order to improve our ability to harness physics for computation.
    [Show full text]
  • Gates, States, and Circuits
    Gates, States, and Circuits Notes on the circuit model of quantum computation Tech. Note 014 v0.6 beta http://threeplusone.com/gates Gavin E. Crooks 2021-07-24 Contents List of figures 3 List of tables 4 1 Introduction: Gates, states, and circuits 5 1.1 Additional reading ........................ 5 2 Bloch sphere representation of a qubit 7 3 Standard 1-qubit gates 10 3.1 Pauli gates ............................. 10 3.2 Rotation gates .......................... 12 3.3 Pauli-power gates ......................... 15 3.4 Quarter turns ........................... 18 3.5 Hadamard gates .......................... 21 3.6 Axis cycling gates ........................ 23 3.7 T gates ............................... 24 3.8 Global phase ........................... 25 4 Decomposition of 1-qubit gates 27 4.1 Z-Y-Z decomposition ....................... 27 4.2 V-Z decomposition ........................ 29 4.3 General Euler angle decompositions .............. 29 4.4 Bloch rotation decomposition .................. 30 4.5 Decomposition of Bloch rotation ................ 30 5 The canonical gate 31 6 Standard 2-qubit gates 35 6.1 Identity .............................. 35 6.2 Controlled-Not gates ....................... 35 6.3 iSwap locally equivalent gates ................. 37 6.4 Swap gate ............................. 38 Contents 6.5 Ising gates ............................. 39 6.6 XY gates .............................. 42 6.7 Isotropic exchange gates ..................... 43 6.8 Parametric swap gates ...................... 44 6.9 Orthogonal gates ......................... 45 6.10 XXY gates ............................. 48 6.11 Perfect entanglers ........................ 50 7 Decomposition of 2-qubit gates 51 7.1 Kronecker decomposition .................... 51 7.2 Canonical decomposition .................... 52 7.3 CNot decomposition ....................... 53 7.4 B-gate decomposition ...................... 53 7.5 ABC decomposition ....................... 54 8 Standard 3-qubit gates 57 9 Controlled unitary gates 62 9.1 Anti-control gates .......................
    [Show full text]