Limits and Horizon of Computing

Slides:



Advertisements
Similar presentations
CS211 Problems: unsolvable, unfeasible and unsolved Topic 3: P and NP.
Advertisements

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.
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:
Matthew Guidry. The Fundamentals of Cryptography  One of the fundamentals of cryptography is that keys selected for various protocols that are computationally.
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.
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.
Exponential Functions and Equations. Water Temperature – Time vs. Hours The following table shows the time, in hours, before the body of a scuba diver,
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 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.
DNA Computing BY DIVYA TADESERA. Contents  Introduction  History and its origin  Relevancy of DNA computing in 1. Hamilton path problem(NP problem)
Limits and Horizon of Computing Post silicon computing.
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 
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
Erdal Kose CC30.10 These slides are based of Prof. N. Yanofsky Lecture notes.
Quantum Computing and Quantum Programming Language
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?
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?
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.
Quantum Computers TAUKI TAHMID BRAC UNIVERSITY ID:
CSC 108H: Introduction to Computer Programming Summer 2011 Marek Janicki.
Computer Performance & Storage Devices Computer Technology #2.
Different methods of quantum computing optimization
QUANTUM COMPUTING By Sandeep Neeli.
Trends in Memory Computing.
Optimization Problems
NP-Complete Problems.
QUANTUM COMPUTING: Quantum computing is an attempt to unite Quantum mechanics and information science together to achieve next generation computation.
Activity 1 6 minutes Research Activity: What is RAM? What is ROM?
Last time More and more information born digital
Introduction to Quantum Computing Lecture 1 of 2
Analysis of algorithms
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.”
Chapter 2 Fundamentals of the Analysis of Algorithm Efficiency
By Nealesh Ragoodial - Security Capstone
Class 14: Intractable Problems CS150: Computer Science
Optimization Problems
Computational Complexity
Discrete Mathematics CS 2610
Lecture 24: Metalinguistics CS200: Computer Science
Halting Problem.
Quantum Computing and the Quest for Quantum Computational Supremacy
CSC 380: Design and Analysis of Algorithms
Quantum Computing Hakem Alazmi Jhilakshi Sharma Linda Vu.
What is Computer Science About? Part 2: Algorithms
Analysis of algorithms
Quantum Computing Andrew Krumbach Carolyn Camara
Algorithms CSCI 235, Spring 2019 Lecture 36 P vs
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 00000000 00000001 00000010 00000011 00000100 …

Example Know there is a binary key of n digits that decrypts data… try every possible key O(2n) n Possible keys 1 2 4 3 8 16 … 10 1024 20 ~1,000,000 30 ~1,000,000,000 40 ~1,000,000,000,000

Example Traveling Salesman Problem:

Example O(n!) Traveling Salesman Problem: Towns Routes 2 3 6 4 24 5 120 … 10 3,628,800 20 2,432,902,008,176,640,000

Classes Exponential and factorial growth:

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

Classes Polynomial: Work is O(nm) for some constant m O(1), O(logn), O(n), O(n*logn), O(n2), O(n3) Non-polynomial: More time than polynomial O(2n), O(n!)

P vs NP https://www.youtube.com/watch?v=YX40hbAHx3s

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

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(n2) : do 4x more work

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

But Moore's Law! More's law not much help with non- polynomial problems 2n 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 http://htwins.net/scale2/ Modern chip: 14 nanometer scale Transistor ~30 atoms across 30 atoms!!!

New Materials Trick 1: New materials

Molecular Computation Trick 2: 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 3: 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: https://www.youtube.com/watch?v=CMdHDHEuOUE How they work: https://www.youtube.com/watch?v=g_IaVepNDT4

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

Classical Approach 6 switches, each on or off 26 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 2100 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 2100 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 https://www.youtube.com/watch?v=Yl3o236gdp8#t=250