Threshold for Life MIT Media Laboratory Prof. Isaac Chuang.

Slides:



Advertisements
Similar presentations
Computing with adversarial noise Aram Harrow (UW -> MIT) Matt Hastings (Duke/MSR) Anup Rao (UW)
Advertisements

The Threshold for Fault-Tolerant Quantum Computation Daniel Gottesman Perimeter Institute.
1 SODA January 23, 2011 Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D Matthew CookUniversity of Zurich and.
The Recursion Theorem Sipser – pages Self replication Living things are machines Living things can self-reproduce Machines cannot self reproduce.
F AULT T OLERANT Q UANTUM C OMPUTATION December 21 st, 2009 Mirmojtaba Gharibi.
Umesh V. Vazirani U. C. Berkeley Quantum Algorithms: a survey.
Finite Automata and Non Determinism
A Universal Operator Theoretic Framework for Quantum Fault Tolerance Yaakov S. Weinstein MITRE Quantum Information Science Group MITRE Quantum Error Correction.
Quantum Error Correction SOURCES: Michele Mosca Daniel Gottesman Richard Spillman Andrew Landahl.
Quantum Error Correction and Fault Tolerance Daniel Gottesman Perimeter Institute.
Phase in Quantum Computing. Main concepts of computing illustrated with simple examples.
Local Fault-tolerant Quantum Computation Krysta Svore Columbia University FTQC 29 August 2005 Collaborators: Barbara Terhal and David DiVincenzo, IBM quant-ph/
Beyond the DiVincenzo Criteria: Requirements and Desiderata for Fault-Tolerance Daniel Gottesman.
Quantum Automata Formalism. These are general questions related to complexity of quantum algorithms, combinational and sequential.
Quantum Algorithms I Andrew Chi-Chih Yao Tsinghua University & Chinese U. of Hong Kong.
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 5 Reducibility Contents Undecidable Problems from Language Theory.
Interactive Proofs For Quantum Computations Dorit Aharonov, Michael Ben-Or, Elad Eban School of Computer Science and Engineering The Hebrew University.
In Search of a Magic Bottle of Error-Be-Gone Dave Bacon Caltech Department of Physics Institute for Quantum Information Decoherence errosol.
Von Neumann’s Automaton and Viruses Most slides taken from Weizmann Institute of Science and Rensselaer Polytechnic Institute.
Cellular Automata Avi Swartz 2015 UNC Awards Ceremony.
Introduction At the heart of the growth of a multi-cellular organism is the process of cellular division… … aka (in computing) self-replication.
MAS.S62 FAB The Threshold for Life
Software faults & reliability Presented by: Presented by: Pooja Jain Pooja Jain.
Requirements and Desiderata for Fault-Tolerant Quantum Computing Daniel Gottesman Perimeter Institute for Theoretical Physics Beyond the DiVincenzo Criteria.
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
MAS.S62 FAB Error Correcting Systems n MAJ p p p p p p p p p k.
1 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 16 (2011)
CSCI 4325 / 6339 Theory of Computation Zhixiang Chen.
Ketan Patel, Igor Markov, John Hayes {knpatel, imarkov, University of Michigan Abstract Circuit reliability is an increasingly important.
What should Computer Science students learn from Mathematics? Y. C. Tay Department of Mathematics Department of Computer Science National University of.
Computer Viruses, Artificial Life & the Origin of Life Robert C Newman Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org.
Computer Science Dept, San Jose State University, CA Self Reproducing CA’s and Programs Shruti Parihar May 06, 2003.
Course material – G. Tempesti Course material will generally be available the day before the lecture Includes.
FAB 2 MAS 960 Special Topics: How To Make Something That Makes (almost) Anything 1.Air inlets 2.Crushers 3.Ganglion 4.Multiple Visual.
Cellular Automata & DNA Computing 우정철. Definition Of Cellular Automata Von Von Neuman’s Neuman’s Definition Wolfram’s Wolfram’s Definition Lyman.
1 New Coins from old: Computing with unknown bias Elchanan Mossel, U.C. Berkeley
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 20 Slide 1 Critical systems development 3.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 8: February 4, 2004 Fault Detection.
Quantum signal processing Aram Harrow UW Computer Science & Engineering
1 Dorit Aharonov Hebrew Univ. & UC Berkeley Adiabatic Quantum Computation.
Quantum Computing Reversibility & Quantum Computing.
Why synthsize genes and genomes? minimal life -genome rewrite -genetic circuits -metabolic pathways -vaccines -gene therapy -individual.
Cybernetics and American Youth Subculture From Wikipedia In 1947, Wiener decided to introduce the neologism cybernetics into his scientific theory. The.
1 Fault-Tolerant Computing Systems #1 Introduction Pattara Leelaprute Computer Engineering Department Kasetsart University
제 4 주. Cellular Automata A Brief history of Cellular Automata P. Sarkar, ACM Computing Surveys, vol. 32, no. 1, pp. 80~107, 2000 학습목표 계산도구로서의 Cellular.
Capabilities and limitations of quantum computers Michele Mosca 1 November 1999 ECC ’99.
Review of Basic Computer Science Background. Computer Science You’ll Need Some models of computationSome models of computation –Finite state machines.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
Physics of Information Technology MIT – Spring 2006 Avogadro Scale Engineering ‘COMPLEXITY’
Attendance Syllabus Textbook (hardcopy or electronics) Groups s First-time meeting.
From bacteria to artificial cells. The problem of self reproduction
Folding Programs Erik Demaine CSAIL, MIT.
Fabricational Capacity
Linear Quantum Error Correction
A low cost quantum factoring algorithm
OTHER MODELS OF TURING MACHINES
Evolutionary Algorithms
Presentation Title Greg Snider QSR, Hewlett-Packard Laboratories
VLSI Testing Lecture 12: Alternate Test
Threshold for Life Prof. Isaac Chuang MIT Media Laboratory.
Non-Deterministic Finite Automata
Reliability is a Fungible Resource
Genetic Algorithms Artificial Life
The Off-Line Machine Input File read-only (once) Input string
Improving Quantum Circuit Dependability
Chapter 1 Regular Language
Von Neumann’s Automaton and Viruses
Cellular Automata (CA) Overview
Presentation transcript:

Threshold for Life MIT Media Laboratory Prof. Isaac Chuang

Objective Claim: Life can be constructed from faulty components Question: How Faulty?

An Amazing Theorem Reliable computers can be constructed from faulty components A circuit containing N (error-free) gates can be simulated with probability of error at most , using N log(N/  ) faulty gates, which fail with probability p, so long as p<p th. von Neumann (1956) Quantum version: Preskill, Shor, Aharonov, Ben-Or, Gottesman, Chuang*,… * D. Gottesman and I. Chuang, Nature, vol. 402, p. 390, 1999

Fault-Tolerant Circuits

The Fault-Tolerance Threshold A circuit containing N (error-free) gates can be simulated with probability of error < , using c d N faulty gates, which fail with probability p, if p<p th. Proof: Assume 3-input gates. N=1 easy. Non-Fault-Tolerant Circuit 1:  Circuit 2:  Circuit 3:  p Fails with probability 3  +p < 4  MAJ Fails with probability < 3(4  2 + p < 49  2 If p<  2 and 49  2 <  p<  Fault-Tolerant

Efficient Fault Tolerance A circuit containing N (error-free) gates can be simulated with prob. of error < , using O(N log N) faulty gates, which fail with prob. p, if p<p th. Key concept: concatenation (encoding at multiple levels) Status: p th ¼ 1/6 (Hajek & Weller ’91)

Fault-Tolerant Life Nature does not seem to use such constructions How can life be made fault-tolerant?

What is Life? Desirable characteristics: Self repair Self reproduction Growth Evolution Schrodinger von Neumann (1966) Theory of Self-Reproducing Automata: elementary machine capable of reproduction and universal computation

Von Neumann’s Automaton Model based on 29 state Cellular Automaton (simulation from H-H Chou) Langton’s 8-state replicator (not universal) Universal Turing machine Universal constructor

Visions of Fault-Tolerant Life Two interesting questions: What is the fault-tolerance threshold for Life? What would fault-tolerant creatures be like? Rad-hard biologyImmortal Biosystems…Reproduction?