Quantum Cellular Automata (QCA) Andrew Valesky

Similar documents
Thai. What is in a word?

Introduction. Le Song. Machine Learning I CSE 6740, Fall 2013

Lecture 8: Information Theory and Maximum Entropy

On Musical Performances Identification, Entropy and String Matching

INSTITUTE FOR INTEGRATIVE SCIENCE & HEALTH

Imaging Basics: with photons/electrons WS Imaging Basics: with photons/electrons. Content: Small is beautiful... Small is beautiful...

Imaging Basics: with photons/electrons

How to Run a PAT Project? A Cooking Recipe!

Visualization (human) Analysis (computer) Documents, Textures, Biometrics, Object recognition

CS344: Introduction to Artificial Intelligence

arxiv: v2 [cs.ms] 23 Aug 2018

A Few Interesting Answers to Some Hard Questions

Modelling with cellular automata

Introduction to Artificial Life and Cellular Automata. Cellular Automata

Language Technology. Unit 1: Sequence Models. CUNY Graduate Center Spring Lectures 5-6: Language Models and Smoothing. required hard optional

15-251: Great Theoretical Ideas in Computer Science Lecture 7. Turing s Legacy Continues

Cellular Automata. ,C ) (t ) ,..., C i +[ K / 2] Cellular Automata. x > N : C x ! N. = C x. x < 1: C x. = C N+ x.

biologically-inspired computing lecture 12 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing

Cellular Automata CS 591 Complex Adaptive Systems Spring Professor: Melanie Moses 2/02/09

Cellular Automata. and beyond. The World of Simple Programs. Christian Jacob

Cellular Automata. History. 1-Dimensional CA. 1-Dimensional CA. Ozalp Babaoglu

Introduction to Scientific Modeling CS 365, Fall 2011 Cellular Automata

II. Cellular Automata 8/27/03 1

Cellular automata are idealized models of complex systems Large network of simple components Limited communication among components No central

Cellular Automata: Tutorial

*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co.

II. Spatial Systems A. Cellular Automata 8/24/08 1

II. Spatial Systems. A. Cellular Automata. Structure. Cellular Automata (CAs) Example: Conway s Game of Life. State Transition Rule

Chapter 19. History of Life on Earth

Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA

BINARY MORPHOLOGY AND CELLULAR AUTOMATA

We prove that the creator is infinite Turing machine or infinite Cellular-automaton.

Outline 1 Introduction Tiling definitions 2 Conway s Game of Life 3 The Projection Method

Mitchell Chapter 10. Living systems are open systems that exchange energy, materials & information

Motivation. Evolution has rediscovered several times multicellularity as a way to build complex living systems

Chaos, Complexity, and Inference (36-462)

Logical AND. Logical XOR

A Colorful Introduction to Cellular Automata

Perplexity of Complexity 1

Turing s Legacy Continues

Image Encryption and Decryption Algorithm Using Two Dimensional Cellular Automata Rules In Cryptography

Fundamentals of Computer Science

Dynamics and Chaos. Melanie Mitchell. Santa Fe Institute and Portland State University

@igorwhiletrue

11. Automata and languages, cellular automata, grammars, L-systems

Chaos, Complexity, and Inference (36-462)

The Nature & Origin of Life

Self-reproducing programs. And Introduction to logic. COS 116, Spring 2012 Adam Finkelstein

Models. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation

Extension of cellular automata by introducing an algorithm of recursive estimation of neighbors

Complexity Theory. Ahto Buldas. Introduction September 10, Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach.

The Nature & Origin of Life

Follows the scientific method (O,Q,H,E,C,R)

Justine Seastres. Cellular Automata and the Game of Life

Quantum Cellular Automata. Bassam Aoun & Mohamad Tarifi

Wire-Crossing Technique on Quantum-Dot Cellular Automata

Text Readings. Chapter # 17 in Audesirk, Audesirk and Byers: The History of Life Pg. # Geologic Time...


Entanglement creation and characterization in a trapped-ion quantum simulator

Foundation Tier 3 6 Test

Investigation of possibility of high temperature quantum-dot cellular automata

Boolean Algebra & Digital Logic

CELLULAR AUTOMATA WITH CHAOTIC RULE FORMATION AND ITS CHARACTERISTICS ABSTRACT

2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information

Science of the Sea - Biology. Erica Goetze Department of Oceanography Marine Science Building 631. Zooplankton Ecologist

6.080 / Great Ideas in Theoretical Computer Science Spring 2008

Computation by competing patterns: Life rule B2/S

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute Of Technology, Madras

From Greek philosophers to circuits: An introduction to boolean logic. COS 116, Spring 2011 Sanjeev Arora

Lecture 19: Universality and Computability

Quantum-Dot Cellular Automata (QCA)

Cellular Automata: Overview and classical results

DESIGN OF QCA FULL ADDER CIRCUIT USING CORNER APPROACH INVERTER

Quantum Walk in Position Space with Single Optically Trapped Atoms Michal Karski, et al. Science 325, 174 (2009)

OCN 201. Origin of the Universe

Bio Chemical evolution

The Nature of Computation

Theory of Computation

AST 205. Lecture 18. November 19, 2003 Microbes and the Origin of Life. Precept assignment for week of Dec 1

IMPLEMENTATION OF PROGRAMMABLE LOGIC DEVICES IN QUANTUM CELLULAR AUTOMATA TECHNOLOGY

Symmetries and Dynamics of Discrete Systems

Toward a Better Understanding of Complexity

Cellular Automata and Tilings

The Nature & Origin of Life

Symmetry Analysis of Discrete Dynamical Systems

Chapter 1. Introduction

CBSSS 6/24/02. Physics becomes the. Computing Beyond Silicon Summer School. computer. Norm Margolus

From Quantum Cellular Automata to Quantum Field Theory

FINAL EXAM CHEAT SHEET/STUDY GUIDE. You can use this as a study guide. You will also be able to use it on the Final Exam on

Can You do Maths in a Crowd? Chris Budd

Radial View: Observing Fuzzy Cellular Automata with a New Visualization Method

XX Eesti Arvutiteaduse Talvekool

Complexity Theory Turing Machines

Unit 4: Computer as a logic machine

Shadows of the Mind. A Search for the Missing Science of Consciousness ROGER PENROSE. Rouse Ball Professor of Mathematics University of Oxford

Higher Tier 5 7 Test. [2 marks] ii hydrogen name formula. [2 marks] iii magnesium name formula

TETRACTYS. The Tetractys, is a triangular figure consisting of ten points arranged in four rows.

A physical analysis of mechanical computability. Answers

Mathematical or Physical? A physical analysis of mechanical computability. Answers. Abstract model. Mental calculator. Conceptual Outline

MAA509: Quantum Computing and Information Introduction

Transcription:

Quantum Cellular Automata (QCA) Andrew Valesky

Presentation Schedule Quantum Observations (5 min) Cellular Automata (5 min) Quantum Cellular Automata (10 min)

Pythagoras of Samos Pythagorean Theorem Pythagoreanism

Flatland: A Romance of Many Dimensions Edwin Abbot Abbot (1884) women are line-segments men are polygons (n-sided) for he cannot conceive of any other except himself and plumes himself upon the variety of Its Thought as an instance of creative Power. Let us leave this God of Pointland to the ignorant fruition of his omnipresence and omniscience. ~ (the Sphere)

The Quantum Mind Hyperspace: A Scientific Odyssey Through Parallel Universes, Time Warps, and the 10th Dimension Michio Kako Human s see in 3 dimensions No advantage to see in other dimentions Evolutionary survival Must our minds work in 3 dimensions? Quantum Probability in Cognition Dr. MacLennan Theories of Cognition Logic Aristotle s time Classical Probability 1970 Quantum Probability

Collective Unconscious Jung 1916 dreams, fantasies, and other exceptional states appear natively primordial images or archetypes, as I have called them, belong to the basic stock of the unconscious psyche and cannot be explained as personal acquisitions Collectively called the collective unconscious

Michelangelo's Creation of Adam

Aoccdrnig to a rscheearch at Cmabrigde Uinervtisy, it deosn't mttaer in waht oredr the ltteers in a wrod are, the olny iprmoetnt tihng is taht the frist and lsat ltteer be at the rghit pclae. The rset can be a toatl mses and you can sitll raed it wouthit porbelm. Tihs is bcuseae the huamn mnid deos not raed ervey lteter by istlef, but the wrod as a wlohe. According to a researcher (sic) at Cambridge University, it doesn't matter in what order the letters in a word are, the only important thing is that the first and last letter be at the right place. The rest can be a total mess and you can still read it without problem. This is because the human mind does not read every letter by itself but the word as a whole.

Cellular Automata John von Neumann What kind of logical organization is sufficient for an automaton to reproduce itself? 1903 Regular Grid of cells Finite number of states for each grid N-dimensional Neighborhood defined for each cell Initial state defined for each cell A changing function for each cell Based on neighborhood Usually same for each cell

Processing Image of Game of life Processing Image of Spiernsky Triangle

Game of Life John Conway 1970 Infinite two-dimensional orthogonal grid of cells Two possible states Rules (function or changing cells) Living cell with fewer than two live neighbours dies living cell with two or three live neighbours lives on Living cell with more than three live neighbours dies Dead cell with exactly three live neighbours becomes a live cell

Cellular Automata? Turing Complete Edge of Chaos Applications to other fields

Rule 110: Cellular Automata Turing Complete Simulate a single taped Turing Machine Computable Edge of Chaos Lambda value 0 = order 1 = chaos 01101110

Miller Urey Experiment Create early earth conditions methane (CH 4 ) water (H 2 O) ammonia (NH 3 ) hydrogen (H 2 ) Continuous Electric Sparks Amino Acids were created Protein 20 +

Quantum Cellular Automata Generalization of cellular automata (CA) Reversible CA Grössing G, Zeilinger A (1988) Quantum cellular automata No agreed upon definition

Cellular Automata vs Quantum Cellular Automata (CA) is a 4-tuple (L, Σ,N,f) (QCA) is a 3-tuple (L, H, U)

Partitioned Watrous QCA First proof of computational universality Given any quantum Turing Machine, there exists a PWQCA which simulates the Turing Machine with Constant slowdown Given any PWQCA, there exists a Turing Machine which simulates the PWQCA with linear slowdown

Types of QCA Reversible Local Unitary 1 dimensional Universal Simulate any quantum circuit Can be simulated using a family of quantum circuits Block Partitioned Continuous Time Hamiltonian

QCA Exploration Logical Devices using QCA Quantum Dots Xor adder Quantum Turing Machines are still theoretical Confined to a very finite number of elements Optical lattices Artificial crystals of light and consists of microtraps Crossed laser beams, creating polarization pattern Atoms cool and congregate in the minima Resembles a crystal lattice Quantum tunneling can occur

Quantum Lattice Gas Automata partial differential equation can be the evolution of some CA CA will mimic the partial differentiation equation Continuous time limit Continuous space limit QLGA has demonstrated the equivalence Evolution of set of quantum lattice Boltzman equations Explored to model physical systems

Quantum Tunneling Wave-Particle Duality Particle Classical mechanics Sum of energy Wave Quantum mechanics

Quantum Tunneling The matter rides the wave

Quantum Dot Automata Quantum Dots Consist of nanoparticles 5 quantum dots Two electrons Dots hop among the five states Electrons find farthest distance

Available upon request Works Cited