| QUANTUM COMPUTERS .

}
BEYOND THE LIMITS

GUIDE: MR. JAYANTH.C DEPT. OF TELECOM DSCE.

BY: BHARATH KUMAR K M 1DS06TE037. TELECOMMUNICATION. DSCE, BENGALURU.

Babbages difference engine.

A silicon chip

What next??

AGENDA
Moores law and limitations. Quantum computer? Data representation Important aspects in quantum computer. classical computer v/s quantum computers. Benefits of quantum computers. Problems in construction of quantum computers. conclusion

Moores Law
In 1965, Gordon Moore predicted that number of transistors per square inch on integrated circuits had doubled every year since the integrated circuit was invented. This has held true .. So far But, this would not remain true for much longer. Fig. Gordon Moore

The ability to put transistors on chips was approaching the atomic level.

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

FORGET CLASSICAL THINK QUANTUM

Milestones
1982 - Feynman proposed the idea of creating machines based on the laws of quantum mechanics instead of the laws of classical physics. 1985 - David Deutsch developed the quantum turning machine, showing that quantum circuits are universal. 1994 - Peter Shor came up with a quantum algorithm to factor very large numbers in polynomial time. 1997 - Lov Grover develops a quantum search algorithm.

Fig. Richard Feynman

QUANTUM COMPUTERS
A next generation of classical computers. uses quantum mechanical phenomenasuperposition and entanglement. Faster than classical silicon computers. Worlds greatest calculation on quantum computer is 3

times 5

equals 15 !!!

Quantum Computer Components

Qubits or quantum bit- enables you to manipul ate 2+ values at the same time Microprocessor to store information Photons (lasers) for fast & long distance interac tions

QUBITS (|0> ,|1>) (|0> |1>)

information as quantum bits or qubits. Its a building block of quantum computers. A qubit is a bit of information that can be both zero and one simultaneously. atoms, ions, photons or electrons and their respective control devices -together acting as computer memory and a processor. Due to multiple states more powerful than today's most powerful supercomputers.
Fig. Representation of a qubit, the fundamental building block of quantum computers.

Bits v/s Qubits

Representation of data- qubits dataA 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>.

Excited State

Light pulse of frequency P for time interval t

Nucleus Ground State Electron

Nucleus

State|0>

State|1>

Superposition & Entanglements

Superposition means a system can be in two or more of its states simultaneously. A single qubit can be forced into a superposition of the two states denoted by the addition of the state vectors: |]> = E |0> + |1>

Nucleus

State |0> +|1>

Superposition gives quantum computers an inherent parallelism. A 30-qubit quantum computer would equal the processing power of a conventional computer that could run at 10 teraflops.

Superposition
The particle has wave-like properties. Interference can cause the particle to act in ways that are impossible to explain without these wavelike properties. The ability for the particle to be in a superposition is where we get the parallel nature of quantum computing. If each of the states corresponds to a different value then, if we have a superposition of such states and act on the system, we effectively act on all the states simultaneously.

Reversible logic.
Reversible--their original input state can be derived from their output state, uniquely deterministic computation can be performed on a quantum computer only if it is reversible. Luckily, it has been shown that any deterministic computation can be made reversible.(Charles Bennet, 1973)

Ex. The AND Gate

A C B A 0 0 1 1

Input B 0 1 0 1

Output C 0 0 0 1

In these 3 cases, information is being destroyed

A Universal Quantum Computer

The CCN gate has been shown to be a universal reversible logic gate as it can be used as a NAND gate.
A - Target A A 0 B - Control 1 B 0 0 0 C - Control 2 C 1 1 Input B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 A 0 0 0 1 1 1 1 0 Output B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1

When our target input is 1, our target output is a result of a NAND of B and C.

1 1

Entanglements.
Correlations between states within a superposition. Referred to as a parallelism of states.

Transfer of this entangled quantum state to an arbitrary distant location is tele-transportation entanglement assisted.

Fig. entangled photons

How does it Work ???

 A quantum computer uses molecules and atoms to do the computations required.  Using Nuclear Magnetic Resonance (NMR) techniques, scientists nowadays can manipulate the spin of an atom.

QUANTUM PROCESSOR

Quantum Computing Parallelism

The most exciting feature of quantum computing is q uantum parallelism.

Parallelism allows a quantum computer to work on a million computation at once.

Classical computers v/s Quantum computers

The memory of a classical computer is a string of 0s and 1s. The memory of a quantum computer is a quantum state that can be a superposition of different numbers.

it can perform calculations on only one set of numbers simultaneously.

A quantum computer can do an arbitrary reversible classical computation on all the numbers simultaneously.

parallel computing is performed by having several processors linked together.

a single quantum processor is able to perform multiple computations on its own

Benefits of quantum computers

Artificial Intelligence. complex compression algorithms for voice and image recognition.

achievement of true randomness.

Molecular simulations.

Ultra secure and dense communication.

Quantum networking

Where do quantum computers fit in.

(quantum complexity theory.)

Fig. D-Wave's 16-qubit quantum computer Fig. where exactly quantum computers fit in.

Issues in the production of quantum computers.

Quantum Decoherence( unwanted interaction between a quantum computer and its environment, which introduces errors)

Hardware for quantum computers.

Need for an efficient quantum programming language.

INEVITABILITY FOR QUANTUM COMPUTERS

Scaling Energy Economic

CONCLUSION
When processor components reach atomic scale, Moores Law breaks down. Quantum effects become important whether we want them or not. But huge obstacles in building a practical quantum computer! Making a practical quantum computing is still far in the future and is just a matter of time. Quantum Computing could provide a radical change in the way computation is performed. The advantages of Quantum Computing lie in the aspects of Quantum Mechanics that are peculiar to it This will be one of the biggest steps in science and will undoubtedly revolutionize the practical computing world.

References
1. BIO-QUANTUM COMPUTING. The general science journal by Paolo Manzelli. 2.QUANTUN COMPUTERS BY Neil Gershenfeld (MIT) and Isaac Chuang (IBM Almaden Research Center). 3. The Temple of Quantum Computing by Riley T. Perry Version 1:1. 4. http://www.i-sis.org.uk/QuantumComputing.php 5. http://en.wikipedia.org/wiki/Quantum_computer 6. Quantum computation Samuel L. Braunstein Computer Science, University of York, York