SUBMITTED BYPurva Girhotra B.

Tech [cs BTBTC08045]

1

CONTENTS

Introduction What is a quantum computer Quantum Computing Terminologies used How does a quantum computer work??????????? Challenges Applications Merits Problems faced Todays quantum computers Current progress and future prospects Conclusion

INTRODUCTION
Civilization has advanced as people discovered new ways of exploiting various physical resources such as materials, forces and energies. Valves

Transistors

Integrated Circuits

so on

Technology has resulted in squeezing Logic gates on surface of SILICON CHIPS , soon they would be even much smaller as they would be made out of HANDFUL OF ATOMS. This is what is known as Quantum Technology. Support new kind of computation with qualitatively new algorithms based on quantum principles.

A Glimpse of the past..

I think I can safely say that nobody understands quantum mechanics Feynman 1982 - Feynman proposed the idea of universal simulator, which will mimic the behaviour of any finite physical object. 1985 - David Deutsch developed the quantum turing machine, showing that quantum circuits are universal.

1994 - Peter Shor came up with a quantum algorithm to factor very large numbers in polynomial time.

What is a Quantum Computer

QUANTUM + COMPUTING = QUANTUM COMPUTING

A Quantum Computer is a computer that harnesses the power of atoms and molecules to perform memory and processing tasks. It has the potential to perform certain calculations billions of times faster than any silicon-based computer. NOTE-In a quantum computer , the fundamental unit of information is not binary but rather more quaternary in nature.

QUANATUM COMPUTING

Quantum computing is the area of study focused on developing computer technology based on the principles of quantum theory, which explains the nature and behavior of energy and matter on the quantum (atomic and subatomic) level. Development of a quantum computer, if practical, would mark a leap forward in computing capability far greater than that from the abacus to a modern day supercomputer, with performance gains in the billionfold realm and beyond.

Why quantum computing?

It would be useful to understand why we should bother about this craziness when we already have ultra fast computers which are doubling in speed every 6 months (Moores Law). There are 2 reasons: We are not sure how long Moores Law will hold. As our chips get smaller and smaller we get closer and closer to the subatomic world whose behaviour majorly screws up our current computer architecture. As mentioned, the possible computational power from quantum computing is tremendous.

TERMINOLOGIES USED -

Bits Qubits Superposition Entanglement

Diagrammatic Representation of Qubit

Light pulse of frequency for time interval t Excited state

Ground state

Electron

STATE |0>

STATE |1>

10

BITS v/s

QUBITS

In the classical model of a computer, the most fundamental building block, the bit, can only exist in one of two distinct states, a 0 or a 1. Any quantum system with two state can be regarded as a QUBIT. In a quantum computer the rules are changed . Not only can a 'quantum bit', usually referred to as a 'qubit', exist in the classical 0 and 1 states, it can also be in a coherent superposition of both. A physical implementation of a qubit could use the two energy levels of an atom. An excited state representing |1> and a ground state representing |0>.
11

NOW WHAT IS THIS????

Light pulse of frequency for time interval t/2

STATE |0>

STATE |0>+|1>

12

Superposition

The electron's spin may be either in alignment with the field, which is known as a spin-up state, or opposite to the field, which is known as a spindown state. Changing the electron's spin from one state to another is achieved by using a pulse of energy(Say 1 unit of energy). |> = |0> + |1> Each qubit utilized could take a superposition of both 0 or 1.Thus number of computation undertaken is 2^n ,where n is number of qubits used. This is in true what is known as PARALLEL PROCESSING.. How these particles interact with each other..

13

14

ENTANGLEMENT
Due to the phenomenon of superposition, the measured particle has no single spin direction before being measured, but is simultaneously in both a spin-up and spin-down state. The spin state of the particle being measured is decided at the time of measurement and communicated to the correlated particle, which simultaneously assumes the opposite spin direction to that of the measured particle. Quantum entanglement allows qubits that are separated by incredible distances to interact with each other instantaneously (not limited to the speed of light). No matter how great the distance between the correlated particles, they will remain entangled as long as they are isolated.

15

How does a Quantum Computer work???

In a classical computer , the bits can exist in either 0 or 1.

On other hand, a qubit not only exist in a classical 0 or 1 state , but also as a SUPERPOSITON Of both. Thus , a processor that uses registers of qubits will be able to perform calculations using all possible values of input registers simultaneously. This is what we call Quantum Parallelism.
A Quantum Computer promises to be immensely powerful because it can be in superposition and can act on perform myriad operations using a single processing unit.
16

CHALLENGES
The current challenge is not to build a full QUANTUM COMPUTER . Scientist are concentrating to make QUANTUM LOGIC GATES and Simple Quantum networks. Experimental and theoretical research being developed Worldwide. Quantum computation over Classical Computation being developed. To find how useful quantum computation turns out to be..

17

APPLICATIONSA Quantum computer may not necessarily outperform a classical computer. Some algorithms works best if they are used on a Quantum Computer rather then on a Classical Computer. These algorithms are difficult to formulate on a classical computer The applications areSHORS ALGORIHM

GROVERS ALGORITHM
SIMULATION OF QUANTUM MECHANICAL SYSTEM

18

SHORS ALGORITHM
Developed by PETER SHOR in 1994

Quickly Factorize large numbers.

Assumption- Factoring large number is infeasible.

Now A Question Arises whether the assumption is valid for classical computer or for a quantum computer.

On a quantum computer SHORS ALGORITHM runs in polynomial time of O(log n)^3).

19

Procedure-

Let us suppose we have to find a number p (1<p<n) which would factorize n As for an example, Consider value of n=15,the algorithm consist of 3 steps.

20

STEP 1

The first stage of the algorithm is to place a memory register into a coherent superposition of all its possible states. The letter 'Q' will be used denote a qubit that is in the coherent state.

21

STEP 2The second stage of the algorithm performs a calculation using the register. The details of which are as follows: The number N is the number we wish to factorize, N = 15

A random number X is chosen, where 1 < X < N-1

is raised to the power contained in the register (register A) and then divided by N The remainder from this operation is placed in a second 4 qubit register (register B).
22

cont. Let us suppose X=2 ,contents of register B for every possible of A is as follows-

Register A 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Register B 1 2 4 8 1 2 4 8 1 2 4 8 1 2 4 8

Notice that the contents of register B follows a repeating sequence (1,2,4,8,1,2,4,8...), the frequency at which this repeats can be named f. In this case the repeating sequence (1, 2, 4, 8) has four values so f = 4.

23

cont.

STEP 3The frequency factor f which is calculated, is used in following formula to calculate a (possible )factor-

Factor P1 = X^f/2 1 Factor P2=X^f/2 + 1 Ans = gcd (P1,N),gcd (P2,N)

In our example the value answer of 3 and

F=4 does give a correct

5.

24

GROVERS ALGORITHM
The algorithm was given by Lov Grover to search an unsorted database faster then a conventional computer. With Grover's algorithm searching is performed in root n time. Has a useful application in field of cryptography. Used to crack DES. If an encrypted document with 56 bit key is to be searched, This would take only 185 trials ,if we are using Grovers algorithm.

25

Simulation Of Quantum mechanical System-

FEYNMAN-Quantum computer be able to simulate quantum mechanical system with greater degree of accuracy. Quantum computers with a few tens of quantum bits could perform simulations that would take an unfeasible amount of time on a classical computer. As for an example, a quantum computer would allow the HUBBARD MODEL to be simulated ,a task that is beyond the scope of current conventional computers.

26

MERITS OF Quantum Computing

Some merits discussed previously are Use of quantum computers to Factoring large numbers, encoding and decoding secret information searching a number from a unsorted database. Some of the applications for which they can be used areQUANTUM COMMUNICATION QUANTUM CRYPTOGRAPHY ARTIFICIAL INTELLIGENCE

27

PROBLEMS FACED
The merits described appears to be promising but there are tremendous obstacles to overcome. Some of the problems with quantum computing are-

!!Interference

!!Error Correction

!!Output observance

28

Can we really make a quantum computer . Who knows in a quantum world anything is possible??????????????????????

Will I have Quantum computer as my desktop PC

Building a quantum computer is a daunting challenge. However , the most promising technologies , have demonstrated necessary building blocks of a quantum computer. A lot of progress is made to realizing viable quantum computers.

29

Current Progress And Future Prospects

The recent work on the 'computing liquid' technique pioneered by Dr. Gershenfield and Dr. Chuang (Los Alamos National Laboratory, New Mexico) has given quantum computing a promising future. Other techniques , such as QUANTUM DOTS ,may also yield result as technology advances .

Researches in quantum communication have enjoyed a greater level of success .

On the other side of the argument, is the topic of decoherence. This problem has not been resolved and many people, including Rolf Landauer of IBM's Thomas Watson Research Centre, believe that the quantum computer is unlikely to progress beyond the 10qubit system (described above), as decoherence makes them too fragile to be practical.
30

Recent Developments
JUNE 2007, Researchers at Delft University of Technology have succeeded in carrying out calculations with two quantum bits, the building blocks of a possible future quantum computer. MAY 2010 Professors have developed a system for measuring energy involved in adding electrons to semi-conducting materials. JUNE 2010 The remarkable ability of an electron to exist in two places at once has been controlled in the most common electronic material -- silicon -- for the first time.

31

CONCLUSION
With classical computers gradually approaching their limit, the quantum computer promises to deliver a new level of computational power. A quantum computer thus has the theoretical capability of simulating any finite physical system and may even hold the key to creating an artificially intelligent computer. The quantum computers power to perform calculations across a multitude of parallel universes gives it the ability to quickly perform tasks that classical computers will never be able to practically achieve. They enable the most commonly used cryptography techniques to be broken in a matter of seconds. David Deutsch - one of the groundbreaking scientists in the world of quantum computing - himself said, "Perhaps, their most profound effect may prove to be theoretical".

32

REFERRENCES
http://www.quantiki.org http://www.sciencedaily.com http://www.doc.ic.ac.uk/~nd/surprise_97/journal/vol4/spb3/ http://www-users.cs.york.ac.uk/schmuel/comp/comp.html http://www.ewh.ieee.org/r10/bombay/news4/Quantum_Computers.htm http://webopedia.com/TERM/Q/quantum_computing/html

http://www.doc.ic.ac.uk/~nd/surprise_97/journal/vol1/ spb3/

33

THANK YOU

34