Presentation is loading. Please wait.

Presentation is loading. Please wait.

Limits and Horizon of Computing Post silicon computing.

Similar presentations


Presentation on theme: "Limits and Horizon of Computing Post silicon computing."— Presentation transcript:

1 Limits and Horizon of Computing Post silicon computing

2 Limits Theoretical limit: Some unsolvable problems Halting problem

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

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

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

6 Example Traveling Salesman Problem:

7 Example Traveling Salesman Problem, Brute Force: TownsRoutes 22 36 424 5120 …… O(n!)

8 Classes Exponential and factorial growth:

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

10 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!)

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

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

13 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

14 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

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

16 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

17 Silicon Reaching limits of ability to work with silicon…

18 Tiny tiny tiny Transistors are small http://htwins.net/scale2/ http://htwins.net/scale2/ Modern chip: 14 nanometer scale Transistor ~30 atoms across 30 atoms!!!

19 Single Atom Transistor? Built in lab… not real practical

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

21 3D Gates Trick 2: New materials

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

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

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

25 Longer Term? Need something completely different

26 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

27 Video Quantum Computers: – What they are: https://www.youtube.com/watch?v=CMdHDHEuOUE https://www.youtube.com/watch?v=CMdHDHEuOUE – How they work: https://www.youtube.com/watch?v=g_IaVepNDT4#t=146 https://www.youtube.com/watch?v=g_IaVepNDT4#t=146

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

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

30 Scaling

31 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

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

33 100 A problem space is represented by 100 bits 2 100 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…

34 Reality Solving 3 x 5 = 15 the hard way https://www.youtube.com/watch?v=Yl3o236gdp8#t=268 https://www.youtube.com/watch?v=Yl3o236gdp8#t=268


Download ppt "Limits and Horizon of Computing Post silicon computing."

Similar presentations


Ads by Google