Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

35
Introduction to Introduction to Quantum Computing Quantum Computing By By Sumant Gupta Sumant Gupta 02103029 02103029 C.S.E C.S.E

Transcript of Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Page 1: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Introduction to Quantum Introduction to Quantum ComputingComputing

ByBySumant GuptaSumant Gupta

0210302902103029C.S.EC.S.E

Page 2: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

OUTLINEOUTLINE

Why Quantum Computing?Why Quantum Computing?

What is Quantum Computing?What is Quantum Computing?

HistoryHistory

Quantum WeirdnessQuantum Weirdness

Quantum Properties Quantum Properties

Quantum DevicesQuantum Devices

Page 3: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Why Quantum Computing?

Page 4: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Transistor DensityTransistor Density

1970 1975 1980 1985 1990 1995 2000 2005 2010103

104

105

106

107

108

109Transistors per chip

Year

80786PentiumPro

Pentium80486

8038680286

8086

80804004

?

Page 5: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Transistor SizeTransistor Size

1985 1990 1995 2000 2010 2015 202010-1

100

101

102

103

104Electrons per device

2005Year

(16M)

(Transistors per chip)

(4M)

(256M)(1G)

(4G)

(16G)

(64M)

??1 electron/transistor

Page 6: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Why Quantum Computing?Why Quantum Computing?

By 2020 we will hit natural limits on the size of By 2020 we will hit natural limits on the size of transistorstransistors Max out on the number of transistors per chipMax out on the number of transistors per chip Reach the minimum size for transistors Reach the minimum size for transistors Reach the limit of speed for devicesReach the limit of speed for devices

Eventually, all computing will be done using Eventually, all computing will be done using some sort of alternative structuresome sort of alternative structure DNADNA Cellular AutomatonCellular Automaton QuantumQuantum

Page 7: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

What is Quantum Computing?

Page 8: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

IntroductionIntroductionThe common characteristic of any digital The common characteristic of any digital computer is that it stores bits computer is that it stores bits Bits represent the state of some physical systemBits represent the state of some physical system Electronic computers use voltage levels to represent Electronic computers use voltage levels to represent

bits bits

Quantum systems possess properties that allow Quantum systems possess properties that allow the encoding of bits as physical statesthe encoding of bits as physical states Direction of spin of an electronDirection of spin of an electron The direction of polarization of a photonThe direction of polarization of a photon The energy level of an excited atomThe energy level of an excited atom

Page 9: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Spin StatesSpin StatesAn electron is always in one of two spin statesAn electron is always in one of two spin states ““spin up” – the spin is parallel to the particle axisspin up” – the spin is parallel to the particle axis ““spin down” – the spin is antiparallel to the particle spin down” – the spin is antiparallel to the particle

axisaxis

Notation:Notation:

Spin up:

Spin down:

Page 10: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

qubitqubit

A A qubitqubit is a bit represented by a is a bit represented by a quantum systemquantum system

By convention:By convention: A qubit state 0 is the spin up stateA qubit state 0 is the spin up state A qubit state 1 is the spin down stateA qubit state 1 is the spin down state

01

Page 11: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

DefinitionsDefinitions

A qubit is governed by the laws of A qubit is governed by the laws of quantum physicsquantum physics While a quantum system can be in one of a While a quantum system can be in one of a

discrete set of states, it call also be in a discrete set of states, it call also be in a blend of states called a blend of states called a superpositionsuperposition

That is a qubit can be in:That is a qubit can be in:

01 10c0 + c1

|c0|2+|c1|2 = 1

Page 12: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

MeasurementMeasurement

If a qubit is realized by the spin of an If a qubit is realized by the spin of an electron, it is possible to measure the electron, it is possible to measure the qubit value by passing the electron qubit value by passing the electron through a magnetic fieldthrough a magnetic field If the qubit encodes a |0> then it will be If the qubit encodes a |0> then it will be

deflected upwarddeflected upward If the qubit encodes a |1> then it will be If the qubit encodes a |1> then it will be

deflected downwarddeflected downward

Page 13: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Superposition MeasurementSuperposition Measurement

If the qubit is in a superposition state it If the qubit is in a superposition state it cannot be determine if it will deflect up or cannot be determine if it will deflect up or downdown

However, the probability of each possible However, the probability of each possible deflection can be founddeflection can be found

10c0 + c1

Probability of 0 c02

Probability of 1 c12

Page 14: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Quantum Computing History

Page 15: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

HistoryHistory

In the 1970’s Fredkin, Toffoli, Bennett and others In the 1970’s Fredkin, Toffoli, Bennett and others began to look into the possibility of reversible began to look into the possibility of reversible computation to avoid power loss.computation to avoid power loss.

Since quantum mechanics is reversible, a possible link Since quantum mechanics is reversible, a possible link between computing and quantum devices was between computing and quantum devices was suggestedsuggested

Some early work on quantum computation occurred in Some early work on quantum computation occurred in the 80’sthe 80’s

Benioff 1980,1982 explored a connection between Benioff 1980,1982 explored a connection between quantum systems and a Turing machinequantum systems and a Turing machine

Feynman 1982, 1986 suggested that quantum systems Feynman 1982, 1986 suggested that quantum systems could simulate reversible digital circuitscould simulate reversible digital circuits

Deutsch 1985 defined a quantum level XOR mechanismDeutsch 1985 defined a quantum level XOR mechanism

Page 16: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Existing Quantum ComputersExisting Quantum Computers

Los Alamos and IBM both have working Los Alamos and IBM both have working liquid NMR quantum computers with 3 – 6 liquid NMR quantum computers with 3 – 6 qubit registers.qubit registers.

NIST, LANL and others using an Ion Trap NIST, LANL and others using an Ion Trap method have achieved a single method have achieved a single CONTROLLED NOT.CONTROLLED NOT.

Page 17: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Quantum Weirdness

Page 18: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

One of the unusual features of Quantum One of the unusual features of Quantum Mechanics is the interaction between an Mechanics is the interaction between an event and its measurementevent and its measurement Measurement changes the state of a Measurement changes the state of a

quantum systemquantum system Measurement of the superposition state of Measurement of the superposition state of

a qubit forces it into one of the qubit states a qubit forces it into one of the qubit states in an unpredictable mannerin an unpredictable manner

Page 19: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Comparison IComparison ICompare qubits to classical bitsCompare qubits to classical bits

A bit always has adefinite value

True False, a qubit need not have adefinite value until the momentafter it is observed

A bit can only be 0 or 1 True False, a qubit can be in asuperposition of 0 and 1simultaneously

A bit can be copied withoutaffecting its value

True False, a qubit in an unknownstate cannot be copied withoutdisrupting its state

Assumption Classical Quantum

A bit can be read withoutaffecting its value

True False, reading a qubit that isinitially in a superposition willchange the value of the qubit

Page 20: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Comparison IIComparison II

Reading one bit has no effecton another unread bit

True False, if the qubit being read isentangled with another qubitreading one will affect the other

To compute the result of acomputation you must runthe computer

True

Assumption Classical Quantum

False, if you have a quantum computer that could perform thecomputation if it were run, thenthe answer can be obtained eventhough the computer is not run

Page 21: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Quantum Phenomena

Page 22: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Quantum PhenomenaQuantum Phenomena

There are five quantum phenomena There are five quantum phenomena that make quantum computing weirdthat make quantum computing weird SuperpositionSuperposition InterferenceInterference EntanglementEntanglement Non-determinismNon-determinism Non-clonabilityNon-clonability

Page 23: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

SuperpositionSuperposition

The Principal of Superposition states if a The Principal of Superposition states if a quantum system can be measured to be quantum system can be measured to be in one of a number of states then it can in one of a number of states then it can also exist in a blend of all its states also exist in a blend of all its states simultaneouslysimultaneously

RESULT: An n-bit qubit register can be RESULT: An n-bit qubit register can be in all 2in all 2nn states at once states at once Massively parallel operationsMassively parallel operations

Page 24: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

InterferenceInterference

We see interference patterns when We see interference patterns when light shines through multiple slitslight shines through multiple slits

This is a quantumThis is a quantumphenomena which isphenomena which isalso present in quantumalso present in quantumcomputerscomputers A quantum computerA quantum computer

can operate on severalcan operate on severalinputs at once, the results inputs at once, the results interfere with each otherinterfere with each otherproducing a collectiveproducing a collectiveresultresult

Page 25: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

EntanglementEntanglement

If two or more qubits are made to interact, they If two or more qubits are made to interact, they can emerge from the interaction in a joint can emerge from the interaction in a joint quantum state which is different from any quantum state which is different from any combination of the individual quantum statescombination of the individual quantum states

RESULT: If two entangled qubits are RESULT: If two entangled qubits are separated by any distance and one of them is separated by any distance and one of them is measured then the other, at the same instant, measured then the other, at the same instant, enters a predictable stateenters a predictable state

Page 26: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Non-DeterminismNon-DeterminismQuantum non-determinism refers to the Quantum non-determinism refers to the condition of unpredictabilitycondition of unpredictability

If a quantum system is in a superposition If a quantum system is in a superposition state and then measured, the measured state and then measured, the measured state can not be predicted.state can not be predicted.

Page 27: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Non-ClonabilityNon-Clonability

It is impossible to copy an unknown It is impossible to copy an unknown quantum state exactlyquantum state exactly

If you asked a friend to prepare a qubit If you asked a friend to prepare a qubit in a superposition state without telling in a superposition state without telling you which superposition state, then you you which superposition state, then you could not make a perfect copy of the could not make a perfect copy of the qubitqubit Useful in quantum cryptologyUseful in quantum cryptology

Page 28: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Quantum Devices

Page 29: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Quantum RegisterQuantum RegisterAny computer requires a memory to store data for Any computer requires a memory to store data for input or outputinput or output

A quantum memory can be thought of as a set of A quantum memory can be thought of as a set of qubitsqubits A 2-bit quantum register would contain the A 2-bit quantum register would contain the

superposition of 4 states:superposition of 4 states:

c0 c1+ c2+

c3+

Page 30: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Register SuperpositionRegister SuperpositionUntil it is read, a quantum n-bit register can be in Until it is read, a quantum n-bit register can be in a superposition of all 2a superposition of all 2nn states states This allows a quantum computer to work on all This allows a quantum computer to work on all

possible inputs at the same timepossible inputs at the same time However, when we read a quantum register it is However, when we read a quantum register it is

forced into only 1 stateforced into only 1 state

REQUIRE: a clever method that will allow a REQUIRE: a clever method that will allow a quantum register to evolve into a superposition quantum register to evolve into a superposition of only acceptable solutionsof only acceptable solutions

Page 31: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Prepare-Evolve-MeasurePrepare-Evolve-Measure

Classical computers operate on a Fetch-Execute Classical computers operate on a Fetch-Execute cyclecycle

Quantum computers operate on a PREPARE-Quantum computers operate on a PREPARE-EVOLVE-MEASURE cycleEVOLVE-MEASURE cycle Prepare: place a quantum memory register in an Prepare: place a quantum memory register in an

initial state (usually all |0>)initial state (usually all |0>) Evolve: step the computer through a set of states Evolve: step the computer through a set of states

which result in a superposition of acceptable solutions which result in a superposition of acceptable solutions in the registerin the register

Measure: measure the register to find one of the Measure: measure the register to find one of the acceptable answersacceptable answers

Page 32: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Quantum GatesQuantum Gates

Quantum logic gates are similar in Quantum logic gates are similar in overall function to digital logic gatesoverall function to digital logic gates They perform logic operations such as They perform logic operations such as

NOT, AND, OR, . . .NOT, AND, OR, . . .

However, quantum logic gates must However, quantum logic gates must have as many outputs as there are have as many outputs as there are inputsinputs Because they must be “reversible”Because they must be “reversible”

Page 33: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Quantum NOTQuantum NOT

The quantum not gate operates on a The quantum not gate operates on a single qubit defined by:single qubit defined by:

0Unot 1=

1Unot 0=

NOT Operation

Page 34: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Square Root of NOTSquare Root of NOT

The quantum inverter is actually The quantum inverter is actually implemented using two special NOT gates implemented using two special NOT gates defined by:defined by:

0 1=U NOT U NOT

1 0=U NOT U NOT

This is kind of gate is unique to quantum computing.There is no way that two applications of any digitalgate can produce the inverse operation

Page 35: Introduction to Quantum Computing By Sumant Gupta 02103029C.S.E.

Thank youThank you

END OF PRESENTATIONEND OF PRESENTATION