Limits and Horizon of Computing Post silicon computing.

Slides:



Advertisements
Similar presentations
The Relationship Between Nanotechnology and Quantum Computing June Dr. Geordie Rose, President & CEO D-Wave
Advertisements

Turing Machines January 2003 Part 2:. 2 TM Recap We have seen how an abstract TM can be built to implement any computable algorithm TM has components:
CS211 Problems: unsolvable, unfeasible and unsolved Topic 3: P and NP.
Time Complexity P vs NP.
Trends in Memory Computing. Changes in memory technology Once upon a time, computers could not store very much data. The first electronic memory storage.
Introduction to Algorithms Rabie A. Ramadan rabieramadan.org 2 Some of the sides are exported from different sources.
Quantum Computing. Introduction to Computing Is currently done on your laptop today Numbers as we commonly use them are in decimal (base 10) format. Computers.
Quantum Computation and Error Correction Ali Soleimani.
Quantum Technology Essential Question:
Cryptography & Complexity An amazing blend of Mathematics, Computer Science, Physics and achieving “the impossible”.
Matthew Guidry. The Fundamentals of Cryptography  One of the fundamentals of cryptography is that keys selected for various protocols that are computationally.
Public Key Cryptography Topical Lecture Week 10. PUBLIC AB Public Key Cryptography A: Hey B, send me an encoded message. This is how you encode a message.
FUTURE COMPUTERS By - Kapil jadhav. History of Computers. Long and a fascinating history. Started with huge and complicated machines. First, second, third.
Future Computers CSCI 107, Spring When Moore’s law runs out of room When transistors become only tens of atoms thick –Quantum mechanics applies.
By: Mike Neumiller & Brian Yarbrough
Moore’s Law the number of circuits on a single silicon chip doubles every 18 to 24 months.
ELE 523E COMPUTATIONAL NANOELECTRONICS W2: Emerging Computing, 15/9/2014 FALL 2014 Mustafa Altun Electronics & Communication Engineering Istanbul Technical.
The science that drives modern computers. COS 116, Spring 2012 Adam Finkelstein.
Lecture 5 Overview Does DES Work? Differential Cryptanalysis Idea – Use two plaintext that barely differ – Study the difference in the corresponding.
Quantum Computing David Dvorak CIS 492. Quantum Computing Overview What is it? How does it work? –The basics –Clarifying with examples Factoring Quantum.
Quantum Computing The Next Generation of Computing Devices? by Heiko Frost, Seth Herve and Daniel Matthews.
Quantum Computing Presented by: Don Davis PHYS
Quantum Computing BCS Belgium Branch.
Beyond Silicon: Tackling the Unsolvable with DNA.
Public Key Encryption and the RSA Public Key Algorithm CSCI 5857: Encoding and Encryption.
Multi-core Programming Introduction Topics. Topics General Ideas Moore’s Law Amdahl's Law Processes and Threads Concurrency vs. Parallelism.
DNA Computing BY DIVYA TADESERA. Contents  Introduction  History and its origin  Relevancy of DNA computing in 1. Hamilton path problem(NP problem)
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
An Introduction to Quantum Phenomena and their Effect on Computing Peter Shoemaker MSCS Candidate March 7 th, 2003.
1 Joe Meehean.  Log: binary search in sorted array  Linear: traverse a tree  Log-Linear: insert into a heap  Quadratic (N 2 ): your sort from P1 
Strength of Cryptographic Systems Dr. C F Chong, Dr. K P Chow Department of Computer Science and Information Systems The University of Hong Kong.
Quantum Computing Basic Concepts and Applications.
By Joseph Szatkowski and Cody Borgschulte. ● Uses phenomenon associated with quantum mechanics instead of electrical circuitry ● Quantum mechanics explains.
David Evans CS150: Computer Science University of Virginia Computer Science Class 33: Computing with Photons From The.
Cliff Shaffer Computer Science Computational Complexity.
Quantum Computing Paola Cappellaro
Physics of Computing and the Promise and Limitations of Quantum Computing Charles H. Bennett IBM Research Yorktown Santa Cruz, 24 Oct 2005.
Erdal Kose CC30.10 These slides are based of Prof. N. Yanofsky Lecture notes.
Is This the Dawn of the Quantum Information Age? Discovering Physics, Nov. 5, 2003.
Quantum Computing and Quantum Programming Language
Limits to Computation How do you analyze a new algorithm? –Put it in the form of existing algorithms that you know the analysis. –For example, given 2.
Optimization Problems
Introduction to Quantum Computing
Moore’s Law and Its Future Mark Clements. 15/02/2007EADS 2 This Week – Moore’s Law History of Transistors and circuits The Integrated circuit manufacturing.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 15: Intractable Problems (Smiley.
Complexity © 2014 Project Lead The Way, Inc.Computer Science and Software Engineering.
Computer Theory Michael J. Watts
Chapter VI What should I know about the sizes and speeds of computers?
As if computers weren’t fast enough already…
Quantum Cryptography and Quantum Computing. Cryptography is about a)manipulating information b)transmitting information c)storing information.
QUANTUM COMPUTERS, COMPUTING AND INFORMATION ALAN DURNEV, PHYSICS.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 23: Intractable Problems (Smiley Puzzles.
Quantum Computing Are We There Yet?
Christopher Monroe Joint Quantum Institute and Department of Physics NIST and University of Maryland Quantum Computation and Simulation.
Quantum Computing: An Introduction
DNA Computing. What is it?  “DNA computing is a branch of computing which uses DNA, biochemistry, and molecular biology hardware, instead of the traditional.
Computer Performance & Storage Devices Computer Technology #2.
QUANTUM COMPUTING By Sandeep Neeli.
Trends in Memory Computing.
QUANTUM COMPUTING: Quantum computing is an attempt to unite Quantum mechanics and information science together to achieve next generation computation.
Introduction to Quantum Computing Lecture 1 of 2
Unsolvable Problems December 4, 2017.
Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.”
Limits and Horizon of Computing
By Nealesh Ragoodial - Security Capstone
Class 14: Intractable Problems CS150: Computer Science
Discrete Mathematics CS 2610
Quantum Computing and the Quest for Quantum Computational Supremacy
What is Digital Information?
Quantum Computing Hakem Alazmi Jhilakshi Sharma Linda Vu.
Presentation transcript:

Limits and Horizon of Computing Post silicon computing

Limits Theoretical limit: Some unsolvable problems Halting problem

Limits Theoretical limit: Some unsolvable problems Halting problem Practical Limits: Too slow to be worth it

Example Know there is a binary key of n digits that decrypts data… try every possible key

Example Know there is a binary key of n digits that decrypts data… try every possible key nPossible keys …… O(2 n )

Example Traveling Salesman Problem:

Example Traveling Salesman Problem, Brute Force: TownsRoutes …… O(n!)

Classes Exponential and factorial growth:

Classes Exponential and factorial growth: Doable Impossible For Any Significant Size

Classes Polynomial: Work is O(n m ) for some constant m O(1), O(logn), O(n), O(n*logn), O(n 2 ), O(n 3 ) Worse than polynomial: More time than polynomial O(2 n ), O(n!)

Other Hard Problems Factoring Integers – why RSA works! Many optimization problems

P vs NP

But Moore's Law! Moore's Law "solves" polynomial problems – 18 months, 2x as fast – 3 years, 4x as fast – 6 years, 16x as fast

But Moore's Law! Moore's Law "solves" polynomial problems – 18 months, 2x as fast – 3 years, 4x as fast – 6 years, 16x as fast O(n) : do 16x more work O(n 2 ) : do 4x more work

But Moore's Law! More's law not much help with non- polynomial problems – 2 n doubles each time n increases by 1

But Moore's Law! More's law not much help with non- polynomial problems – 2 n doubles each time n increases by 1 18 months do +1 units of work 3 years do +2 units of work 6 years do +4 units of work

Silicon Reaching limits of ability to work with silicon…

Tiny tiny tiny Transistors are small Modern chip: 14 nanometer scale Transistor ~30 atoms across 30 atoms!!!

Single Atom Transistor? Built in lab… not real practical

3D Gates Trick 1: Fancier ways of building with silicon

3D Gates Trick 2: New materials

Molecular Computation Trick 3: Molecular computation DNA Storage: 700 terabytes in one gram

Longer Term? Moore's law is going to break…

Longer Term? Moore's law is going to break… Even it can't help us with some problems…

Longer Term? Need something completely different

Quantum Mechanics Trick 4: Quantum Mechanics – Rules that govern sub atomic physics Particles can pass through solid objects Particles can be entangled and read each other's "minds" across the universe Everything is random until it is observed… then it changes to match observation

Video Quantum Computers: – What they are: – How they work:

Optimization Problem Each switch is on or off – make the highest total:

Classical Approach 6 switches, each on or off 2 6 or 32 possible states… try them one by one

Scaling

Quantum Approach Switches can be both on and off… – Test all possible solution at once! – Observing forces qubits to one state… – …set up so desired answer is most likely state

100 A problem space is represented by 100 bits possible answers – Conventional computer: 1,000,000,000 solutions checked per second 40 trillion years to solve

100 A problem space is represented by 100 bits possible answers – Quantum computer with 100 bits Try all states at once Seconds (+ lots of setup time) Answer is only probably correct – need multiple runs to confirm…

Reality Solving 3 x 5 = 15 the hard way