DOCSLIB.ORG

LN13.Digi.Pdf (4.880Mb)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
LN13.Digi.Pdf (4.880Mb) Jarkko Kari (Editor) Proceedings of JAC 2010 Journées Automates Cellulaires Turku Centrefor Computer Science TUCS Lecture Notes No 13, Dec 2010 Proceedings of JAC 2010 Journ´eesAutomates Cellulaires December 15-17, 2010, Turku, Finland Editor: Jarkko Kari TUCS Lecture Notes 13 December 2010 ISBN 978-952-12-2503-1 (printed) ISBN 978-952-12-2504-8 (electronic) ISSN 1797-8823 (printed) ISSN 1797-8831 (electronic) Foreword The second Symposium on Cellular Automata “Journ´eesAutomates Cellulaires” (JAC 2010) took place in Turku, Finland, on December 15-17, 2010. The first two conference days were held in the Educarium building of the University of Turku, while the talks of the third day were given onboard passenger ferry boats in the beautiful Turku archipelago, along the route Turku–Mariehamn–Turku. The con- ference was organized by FUNDIM, the Fundamentals of Computing and Discrete Mathematics research center at the mathematics department of the University of Turku. The program of the conference included 17 submitted papers that were selected by the international program committee, based on three peer reviews of each paper. These papers form the core of these proceedings. I want to thank the members of the program committee and the external referees for the excellent work that have done in choosing the papers to be presented in the conference. In addition to the submitted papers, the program of JAC 2010 included four dis- tinguished invited speakers: Michel Coornaert (Universit´ede Strasbourg, France), Bruno Durand (Universit´ede Provence, Marseille, France), Dora Giammarresi (Uni- versit`adi Roma Tor Vergata, Italy) and Martin Kutrib (Universit¨atGießen, Ger- many). I sincerely thank the invited speakers for accepting our invitation to come and give a plenary talk in the conference. The invited talk by Bruno Durand was eventually given by his co-author Alexander Shen, and I thank him for accepting to make the presentation with a short notice. Abstracts or extended abstracts of the invited presentations appear in the first part of this volume. The program also included several informal presentations describing very recent developments and ongoing research projects. I wish to thank all the speakers for their contribution to the success of the symposium. I also would like to thank the sponsors and our collaborators: the Finnish Academy of Science and Letters, the French National Research Agency project EMC (ANR-09-BLAN-0164), Turku Centre for Computer Science, the University of Turku, and Centro Hotel. Finally, I sincerely thank the members of the local organizing committee for making the conference possible. These proceedings are published both in an electronic format and in print. The electronic proceedings are available on the electronic repository HAL, managed by several French research agencies. The printed version is published in the general publications series of TUCS, Turku Centre for Computer Science. We thank both HAL and TUCS for accepting to publish the proceedings. Turku, December 2010 Jarkko Kari Program Committee Enrico Formenti (Universit´ede Nice-Sophia Antipolis, France) Jarkko Kari (chair, University of Turku, Finland) Jean Mairesse (Universit´eParis 7, France) Ivan Rapaport (Universidad de Chile, Santiago, Chile) Klaus Sutner (Carnegie Mellon University, Pittsburgh, USA) Siamak Taati (University of Groningen, the Netherlands) External referees Florent Becker, Raimundo Brice˜no, Silvio Capobianco, Romain Demangeon, Al- berto Dennunzio, Amir F. Dana, Anah´ıGajardo, Pierre Guillon, Edmund Harriss, Petr K˚urka, Bruno Martin, Pierre-Etienne´ Meunier, Christophe Papazian, Julien Provillard, Eric´ R´emila,Ville Salo, Matthias Schulz, V´eroniqueTerrier, Guillaume Theyssier, Michael Weiss, Jean-Baptiste Yun`es,Charalampos Zinoviadis. Organizing Committee Alexis Ballier Pierre Guillon Timo Jolivet Jarkko Kari (chair) Arto Lepist¨o Charalampos Zinoviadis Table of Contents Invited Talks: Abstracts and Extended Abstracts Some Extensions of the Moore-Myhill Garden of Eden Theorem . 1 M. Coornaert 1D Effectively Closed Subshifts and 2D Tilings . 2 B. Durand, A. Romashchenko, and A. Shen Tiling-recognizable Two-dimensional Languages: from Non-determinism to Determinism through Unambiguity . 8 D. Giammarresi Measuring Communication in Cellular Automata . 13 M. Kutrib and A. Malcher Regular Papers A Quantum Game of Life. 31 P. Arrighi and J. Grattage The Block Neighborhood . 43 P. Arrighi and V. Nesme Computing (or not) Quasi-periodicity Functions of Tilings . 54 A. Ballier and E. Jeandel A Simulation of Oblivious Multi-head One-way Finite Automata by Real-time Cellular Automata . 65 A. Borello Construction of µ-limit Sets . 76 L. Boyer, M. Delacourt, and M. Sablik A Categorical Outlook on Cellular Automata . 88 S. Capobianco and T. Uustalu Combinatorial Substitutions and Sofic Tilings. 100 Th. Fernique and N. Ollinger Infinite Time Cellular Automata: a Real Computation Model . 111 F. Givors, G. Lafitte, and N. Ollinger Computational Complexity of Avalanches in the Kadanoff Two-dimensional Sandpile Model. 121 E. Goles and B. Martin Clandestine Simulations in Cellular Automata . 133 P. Guillon, P.-E. Meunier, and G. Theyssier Slopes of Tilings. 145 E. Jeandel and P. Vanier Transductions Computed by Iterative Arrays . 156 M. Kutrib and A. Malcher An Upper Bound on the Number of States for a Strongly Universal Hyperbolic Cellular Automaton on the Pentagrid . 168 M. Margenstern Time-symmetric Cellular Automata . 180 A. Moreira and A. Gajardo Yet Another Aperiodic Tile Set . 191 V. Poupet Decomposition Complexity . 203 A. Shen Real-time Sorting of Binary Numbers on One-dimensional CA . 214 Th. Worsch and H. Nishio Journees´ Automates Cellulaires 2010 (Turku), pp. 1-1 SOME EXTENSIONS OF THE MOORE-MYHILL GARDEN OF EDEN THEOREM MICHEL COORNAERT Institut de Recherche Math´ematique Avanc´ee Universit´e de Strasbourg, 7 rue Ren´e Descartes, 67084 Strasbourg Cedex, France E-mail address: [email protected] Abstract. The Moore-Myhill Garden of Eden theorem asserts that a cellular automaton with finite alphabet over a free abelian group of rank 2 is surjective if and only if it is pre-injective. Here, pre-injectivity means that two configurations which coincide outside of a finite subset of the group must coincide everywhere if they have the same image under the cellular automaton. The Garden of Eden theorem has been extended to amenable groups by Ceccherini-Silberstein, Machi and Scarabotti and to cellular automata defined over strongly irreducible subshifts of finite type by Fiorenzi. I will discuss these extensions as well as linear versions jointly obtained with Ceccherini-Silberstein. c 1 Journees´ Automates Cellulaires 2010 (Turku), pp. 2-7 1D EFFECTIVELY CLOSED SUBSHIFTS AND 2D TILINGS BRUNO DURAND 1, ANDREI ROMASHCHENKO 2, AND ALEXANDER SHEN 2 1 LIF, CNRS & Aix–Marseille Universit´e E-mail address: [email protected] URL: http://www.lif.univ-mrs.fr/~bdurand 2 LIF, CNRS & Aix–Marseille Universit´e,on leave from IITP RAS E-mail address: {Andrei.Romashchenko,Alexander.Shen}@lif.univ-mrs.fr Abstract. Michael Hochman showed that every 1D effectively closed subshift can be simulated by a 3D subshift of finite type and asked whether the same can be done in 2D. It turned out that the answer is positive and necessary tools were already developed in tilings theory. We discuss two alternative approaches: first, developed by N. Aubrun and M. Sablik, goes back to Leonid Levin; the second one, developed by the authors, goes back to Peter Gacs. 1. Simulation Let A be a finite alphabet and let F be an enumerable set of A-strings. Con- sider all biinfinite A-sequences (i.e., mappings of type Z A) that do not contain substrings from F . The set of these sequences is effectively→ closed (its complement is a union of an enumerable set of intervals in Cantor topology) and invariant under (left and right) shifts. Sets constructed in this way are called effectively closed 1D subshifts. Effectively closed 2D subshifts are defined in a similar way; instead of biinfinite sequences we have configurations, i.e., mappings of type Z2 A, and instead of forbidden strings we have forbidden patterns (rectangles filled with→ A-letters). Given the set F of forbidden patterns, we consider the set of all configurations where no elements of F appear. This set of configurations is closed under vertical and horizontal shifts. If F is enumerable, we get effectively closed 2D subshifts; if F is finite, we get 2D subshifts of finite type. 2D subshifts of finite type are closely related to tilings. A tile is a square with colored sides (colors are taken from some finite set C). A tile set is a set of tiles, i.e., a subset of C4, since each tile is determined by four colors (upper, lower, left, and right). For a tile set τ, we consider all τ-tilings, i.e., the tilings of the entire plane by translated copies of τ-tiles with matching colors. Key words and phrases: effectively closed subshifts, subshifts of finite type, tilings. The paper was supported part by NAFIT ANR-08-EMER-008-01 grant, part by EMC ANR- 09-BLAN-0164-01. c 2 1D EFFECTIVELY CLOSED SUBSHIFTS AND 2D TILINGS 3 Tilings can be considered as a special case of 2D subshifts of finite type. In- deed, subshift is governed by local rules (forbidden pattern say what is not allowed according to these rules). In tilings the rules are extremely local: they say that the neighbor tiles should have matching colors, i.e., 1 2 rectangles where the colors do not match, are forbidden. × So every tile set determines a subshift of finite type (the alphabet is a tile set). The reverse statement is also true if we allow the extension of an alphabet. (It is natural since we have to simulate any local rule by a more restricted class of matching rules.) Formally, for every alphabet A and subshift S of finite type we can find: a set of colors C; • a tile set τ C4; • a mapping d⊂: τ A such• that every τ-tiling→ after applying d to each tile becomes an element of S and every element of S can be obtained in this way from some τ-tiling.
Load more

Recommended publications
  • Understanding Quantum Computing
    International Journal of Scientific Engineering and Applied Science (IJSEAS) - Volume-1, Issue-6, September 2015 ISSN: 2395-3470 www.ijseas.com Understanding Quantum Computing Dr. K J Sarma, SMIEEE; Dept of Humanities and Mathematics & Academic cell Malla Reddy Engineering College (Autonomous ), Secunderabad, India, Abstract: It has been decided that Quantum estimated number of atoms in the universe and Computing (Q.C.) should be pursued, as it this enormous potential computational power is would be one of the priority research areas of the well worth harvesting.” M.A. Nielsen and I.L. future having a potential for computational Chuang [ 26 ] technology development and growth. Hence there is a need to motivate and involve The digital computers operate with the help of youngsters in research activity related to transistors. Digital computers require data to be quantum computing. There is a need to keep the encoded into binary digits (bits), each of which youngsters informed of the what, why, where, is always in one of two definite states (0 or 1), when, how of quantum computing. A review and the memory is made up of the bits. The of the origin and the progress of the binary digits for data encoding quantum developments in Quantum Computing is made computation uses qubits (quantum bits), which In this paper the author tried to review various can be in super-positions of states. aspects of the Quantum Computing like A Quantum Turing machine [40] is a theoretical Architecture, Operating system, Infrastructure model of such a computer, and is also known as required if any, links with other computing the universal quantum computer.
    [Show full text]
  • Teaching Computer Scientists Quantum Mechanics N
    From Cbits to Qbits: Teaching computer scientists quantum mechanics N. David Mermin Laboratory of Atomic and Solid State Physics, Cornell University, Ithaca, New York 14853-2501 ͑Received 22 July 2002; accepted 26 September 2002͒ A strategy is suggested for teaching mathematically literate students, with no background in physics, just enough quantum mechanics for them to understand and develop algorithms in quantum computation and quantum information theory. Although the article as a whole addresses teachers of physics well versed in quantum mechanics, the central pedagogical development is addressed directly to computer scientists and mathematicians, with only occasional asides to their teacher. Physicists uninterested in quantum pedagogy may be amused ͑or irritated͒ by some of the views of standard quantum mechanics that arise naturally from this unorthodox perspective. © 2003 American Association of Physics Teachers. ͓DOI: 10.1119/1.1522741͔ I. COMPUTER SCIENCE AND QUANTUM to realize—is an extremely simple example of a physical MECHANICS system. It is discrete, not continuous. It is made out of a finite number of units, each of which is the simplest possible These ‘‘bras’’ and ‘‘kets’’—they’re just vectors! kind of quantum mechanical system, a 2-state system, whose —Newly enlightened computer scientist1 possible behavior is highly constrained and easily analyzed. There is a new audience for the teaching of quantum me- Much of the analytical complexity of learning quantum me- chanics whose background and needs require a new style of chanics is connected to mastering the description of continu- quantum pedagogy. The audience consists of computer sci- ous ͑infinite-state͒ systems in (3ϩ1)-dimensional space- entists.
    [Show full text]
  • INFIERY-GSIERRA.Pdf
    Germán Sierra (Instituto de Física Teórica UAM-CSIC, Madrid) 6th INFIERY Summer School Madrid, 1st September 2021 Plan of the lecture - Part I: Historial background - Part II: The qubit and quantum gates Quantum Computation and Quantum Information Quantum Mechanics Quantum Computation and Quantum Information Quantum Mechanics Computer Sciences Quantum Computation and Quantum Information Quantum Mechanics Computer Sciences Quantum Computation and Quantum Information Information Theory Quantum Mechanics Computer Sciences Quantum Computation and Quantum Information Information Theory Cryptography Quantum Mechanics Quantum Mechanics Golden age of Physics Quantum Mechanics Golden age of Physics First Quantum Revolution About an improvement of Wien's spectral equation Max Planck 1858 - 1947 On the theory of the law of energy distribution in normal spectrum is light a wave or a particle? is light a wave or a particle? Isaac Newton 1642-1727 is light Thomas Young 1773-1829 a wave or a particle? Isaac Newton 1642-1727 is light Thomas Young 1773-1829 a wave or a particle? Isaac Newton 1642-1727 James Maxwell 1831-1879 is light Thomas Young 1773-1829 a wave or a particle? Isaac Newton 1642-1727 James Maxwell 1831-1879 Albert Einstein (1879-1955) On a heuristic point of view about the creation and generation of light Annalen der Physik, 1905 when a ray of light propagates from a point, energy is not distributed continuously over increasing volume, but it is composed of a finite number of energy quanta, in space,that move without being divided and that they can be absorbed or emitted only as a whole. On a heuristic point of view about the creation and generation of light Annalen der Physik, 1905 when a ray of light propagates from a point, energy is not distributed continuously over increasing volume, but it is composed of a finite number of energy quanta, in space,that move without being divided and that they can be absorbed or emitted only as a whole.
    [Show full text]
  • Experimental Realization of Schumacher's Information
    Experimental Realization of Schumacher's Information Geometric Bell Inequality Tahereh Rezaei,1 Shahabeddin M. Aslmarand,1 Robert Snyder,1, 2 Behzad Khajavi,3 Paul M. Alsing,4 Michael Fanto,4 Doyeol (David) Ahn,5, 1 and Warner A. Miller1 1)Department of Physics, Florida Atlantic University, Boca Raton, FL, 33431 2)L3Harris, 10001 Jack Finney Blvd, CBN018, Greenville, TX 75402, USA. 3)Dept of Biomedical Engineering, University of Houston, Houston, Texas, 77204 4)Air Force Research Laboratory, Information Directorate,Rome, NY 13441 5)Center Quantum Information Processing, Department of Electrical and Computer Engineering, University of Seoul, Seoul 130-743, Republic of Korea Abstract Quantum mechanics can produce correlations that are stronger than classically allowed. This stronger{than{ classical correlation is the \fuel" for quantum computing. In 1991 Schumacher forwarded a beautiful geometric approach, analogous to the well-known result of Bell, to capture non-classicality of this correlation for a singlet state. He used well-established information distance defined on an ensemble of identically{prepared states. He calculated that for certain detector settings used to measure the entangled state, the resulting geometry violated a triangle inequality | a violation that is not possible classically. This provided a novel information{based geometric Bell inequality in terms of a \covariance distance." Here we experimentally- reproduce his construction and demonstrate a definitive violation for a Bell state of two photons based on the usual spontaneous parametric down-conversion in a paired BBO crystal. The state we produced had a visibility of Vad = 0:970. We discuss generalizations to higher dimensional multipartite quantum states. I.
    [Show full text]
  • The Physics of Quantum Information
    The Physics of Quantum Information Complementarity, Uncertainty, and Entanglement Joseph M. Renes 12 December 2012 arXiv:1212.2379v1 [quant-ph] 11 Dec 2012 Habilitation TU Darmstadt, Fachbereich Physik 2011 Contents Preface 1 1 Introduction: What is Quantum Information? 5 1.1 Understanding Classical Information via the InformationGame ................ 6 1.2 ComplementarityintheInformationGame . .................. 7 1.3 EntanglementintheInformationGame . .................. 8 2 Illustrations and Motivations 11 2.1 TeleportationandSuperdenseCoding . ................... 11 2.2 QuantumError-Correction......................... ................... 12 2.3 EntanglementDistillation ........................ .................... 17 2.4 QuantumKeyDistribution.......................... .................. 18 3 Characterizing Quantum Information 23 3.1 Amplitude and Phase Predictability & Entanglement . ..................... 23 3.2 Duality&Decoupling.............................. .................. 28 3.3 EntropicCharacterizations. .. .. .. .. .. .. .. .. .. .. ..................... 31 3.4 SecretKeys&PrivateStates ........................ ................... 33 4 Processing Quantum Information 37 4.1 OptimalEntanglementDistillation . ..................... 37 4.2 OptimalStateMerging............................. .................. 43 4.3 Secret Key Distillation and Private Communication . ...................... 45 5 Duality of Protocols 47 5.1 Duality of Privacy Amplification and Information Reconciliation ................ 47 5.2 Different Approaches to
    [Show full text]
  • The Universe As a Cyclic Organized Information
    NeuroQuantology | March 2015 | Volume 13 | Issue 1 | Page 1 Meijer D.K.F., John Wheeler’s world revised The Universe as a Cyclic Organized Information System: John Wheeler’s World Revisited Dirk K. F. Meijer ABSTRACT This essay highlights the scientific vision of John Archibald Wheeler, a giant of 20th century physics. His ideas provided the important insight that humanity may be in the very center of disclosure and manifestation of the evolution of our universe. This on the basis of scientific reasoning derived from quantum physics rather than simple anthropocentrism or scale chauvinism. Wheeler, the Joseph Henry Professor of Physics Emeritus at Princeton University, became 96. Over a long, productive scientific life, he was known for his drive to address big, overarching questions in physics, subjects which he liked to be merged with philosophical questions about the origin of matter, information and the universe. His interests ranged far and wide and were characterized by true fearlessness. Wheeler's work was not only in gravity and nuclear physics. In the 1950s Wheeler grew increasingly intrigued by the philosophical implications of quantum physics. According to Wheeler, there was no universe until the rise of consciousness to perceive it. In fact, Wheeler was one of the first prominent physicists seriously to propose that reality might not be a wholly physical phenomenon. In some sense, Wheeler suggested, reality grows out of the act of observation, and thus consciousness itself: it is “participatory.” He also stated that information is the most fundamental building block of reality, and that the universe should be seen as a self- synthesized information system: a self-excited circuit that is developing through a (closed loop) cycle.
    [Show full text]
  • Qics - Periodic Activity Report Iii
    QICS - PERIODIC ACTIVITY REPORT III Bob Coecke Chancellor, Masters and Scholars of the University of Oxford FP6 FET STREP - project no 033763 Full name: Foundational Structures for Quantum Information and Computation Thematic priority: Quantum Information Processing and Communications Period covered: Jan. 1st 2009 – Aug. 7th 2010 Date of preparation: Aug. 7th 2010 Start date of project: Jan. 1st 2007 Duration: 42 months Q I C S QICS — proposal no 033763 — Progress report III — 7 August 2010 1 Contents I Publishable executive summary3 II Project objectives and major achievements during the reporting period7 1 Objectives, work done, comparison to state-of-the-art and other developments8 1.1 Objectives of QICS as stated in the initial proposal................................8 1.2 Objectives for the workpackages as stated in the initial proposal......................... 10 1.3 Comparison of these objectives to the current state-of-the-art........................... 11 1.4 Progress made on the objectives during the reporting period............................ 11 1.5 Next steps to be taken for reaching the objectives................................. 11 2 Recruitment, mobility, spin-off 12 3 QICS events and presentations 13 3.1 The QICS school.................................................. 13 3.2 Other QICS events and QICS supported events.................................. 17 3.3 Presentation of QICS output............................................ 17 III Workpackage progress reports of the period — includes project deliverables — 18 4 W1 – deliverable D1: Structures and methods for measurement-based quantum computation 20 4.1 Progress towards objectives and performed tasks for W1.T1............................ 21 4.1.1 Review article on W1............................................ 21 4.1.2 Study normal forms for quantum algorithms in measurement-based computer models.........
    [Show full text]
  • Cellular Automata in Operational Probabilistic Theories
    Cellular automata in operational probabilistic theories Paolo Perinotti QUIT Group, Dipartimento di Fisica, Università degli studi di Pavia, and INFN sezione di Pavia, via Bassi 6, 27100 Pavia, Italy The theory of cellular automata in oper- 5.3 Causal influence . 37 ational probabilistic theories is developed. 5.3.1 Relation with signalling . 38 We start introducing the composition of 5.4 Block decomposition . 39 infinitely many elementary systems, and then use this notion to define update rules 6 Homogeneity 41 for such infinite composite systems. The notion of causal influence is introduced, 7 Locality 47 and its relation with the usual property of signalling is discussed. We then introduce 8 Cellular Automata 51 homogeneity, namely the property of an 8.1 Results . 51 update rule to evolve every system in the same way, and prove that systems evolving 9 Examples 55 by a homogeneous rule always correspond 9.1 Classical case . 55 to vertices of a Cayley graph. Next, we de- 9.2 Quantum case . 55 fine the notion of locality for update rules. 9.3 Fermionic case . 56 Cellular automata are then defined as ho- mogeneous and local update rules. Finally, 10 Conclusion 56 we prove a general version of the wrapping lemma, that connects CA on different Cay- Acknowledgments 57 ley graphs sharing some small-scale struc- A Identification of the sup- and operational ture of neighbourhoods. norm for effects 57 Contents B Quasi-local states 57 1 Introduction1 C Proof of identity 94 64 2 Detailed outlook3 D Homogeneity and causal influence 64 3 Operational Probabilistic Theories4 E Proof of right and left invertibility of a 3.1 Formal framework .
    [Show full text]