Alok Presentation

8/3/2019 Alok Presentation

1/20

Quantum Computers

Presented By:


2/20

Overview

Brief History Computing (generations)

Current technology Limitations

Theory of Quantum Computing How it Works?

Applications

Timeline


3/20

History

Abacus

Gear Driven

Integrated Circuits

Over 200 million transistors.


4/20

Moores Law

In 1965 Gordon Moore predicted thatnumber oftransistors per square inch on

integrated circuits had doubled everyyear since the integrated circuit wasinvented. Moore predicted that this trendwould continue for the foreseeable future.

This has held true .. So far


5/20

Moores Law (cont.)

Recently Gordon Moore announced thathis prediction in 1965 would not remain

true for much longer.The Microprocessor Industry was gettingcloser to the limits of the currenttechnology.

The ability to put transistors on chips wasapproaching the atomic level.


6/20

Stretching the limits

Intel has announced new SRAM

chips for high density memory.Contains 330 million transistors.

Pentium IV has 30 million

transistors


7/20

Problems

Current technology is not havingdifficulty adding more

transistors.At current rate transistors will beas small as an atom.

If scale becomes too small,Electrons tunnel through micro-thin barriers between wires

corrupting signals.


8/20

Quantum Computers

Completely new approach tocomputing.

Uses quantum particles to achievecomputation.

Still Theoretical.


9/20

Entanglement

Albert Einstein Baffled

Coined phrase spooky action-at-a-

distance Still remains a mystery

Superposition


10/20

Two States Are Better Than One!

Digital Computers rely on Osand 1s

Voltage produces high and lows

Can only have one state

Quantum computers can have

multiple states Two places at once


11/20

Example

Reflecting photons offhalf -silvered mirror(deflects half the light)

Where do you think the

photon landed?


12/20

Why Is This Helpful?

Multiple computations simultaneously

Computing power is exponential


13/20

Digital vs. Quantum

Digital produces serial results, Evenwith threads!

Quantum is truly concurrent

Digital computers need an exponentialamount of resources to accomplish a

task

Quantum computers only performs 2^ncomputations. (n = number of

Qubits)


14/20

The Larger the problem

Because of the exponential factorthe larger computations save

more resources than smallerones.

Adding large calculations toexisting algorithms does notcomplicate computation

Efficiency due to Qubits


15/20

Power of Algorithms

Multiplication Algorithms assistin large computations

Quantum Algorithms can speedup processes by using logic

instructions such as `... andnow take a superposition of allnumbers from the previous

operations...';


16/20

Algorithms (cont.)

Will be extremely effective in anylogic based algorithms such as

factoring large numbers. Algorithms are not just theoretical

anymore

In 1994 Peter Shor, of Bell Labsdevised a polynomial time algorithmfor factoring large numbers on a

quantum computer.


17/20

Status

Quantum Algorithms do exist (Peter Shor)

Intellectual hives devoted to quantumcomputing: Oxford University, University of

Innsbruck in Austria, Boulder-Colorado, labs ofthe National Institute of Standards & Technology(NIST), Los Alamos National LaboratoryMassachusetts Institute of Technology , many

others. Even Microsoft Research in Redmond, Wash.,

now counts a quantum computer scientistamong its theorists.


18/20

Status (cont.)

Rudimentary Quantum Computers exist

December 19, 2001 IBM performs

Shors Algorithm Quantum computing is so complex that

expanding on simple operations is still 1020 years away.

Most well known QCs based on nuclearmagnetic resonance (NMR).


19/20

Timeline

Desktop Quantum computersexpected by many within 20

years Faster than anticipated progress


20/20

Thank you!

Alok Presentation

Documents

Transcript of Alok Presentation