Introduction Quantum Computers and their Basic Architecture
-
Upload
hrisheekesh-raveendranath -
Category
Documents
-
view
252 -
download
5
Transcript of Introduction Quantum Computers and their Basic Architecture
1
Introduction Quantum Computers and their Basic
Architecture
Guided by: Presented by:Prasanth P Menon Hrisheekesh RAsst. Professor S7 EC-ADept. of ECE Roll No : 62
2
Overview
• Classical Computers
• Introduction to Quantum Computers
• Elements of Quantum Computation
• Basic Architecture
• Conclusion
• References
3
Classical Computers
• Very simple logic; an array of 0s and 1s represents a number.
• Easy to store, manipulate and to handle, Implemented using
transistors.
• Much time and money is being invested in developing new,
powerful and smaller ones.
• Primary approach being reducing the size of the transistors used in
the systems.
4
Moore’s Law
Fig.1: Plot of Moore’s Law
5
Present Day Transistor
Fig 2. The Size of a Transistor
6
Motivation
7
Fig. 3 Travelling Salesman Problem
8
Introduction
• Quantum Computation was first thought of by Richard Feynman
who said that
“By using the quantum mechanical effects, faster computation can
be achieved.”
• This was found when scientists tried simulating these effects on a
computer.
9
How Does it Look Like.?
Fig 4. Quantum Computer Situated at Google.
Fig 5. Commercially Available D-Wave Quantum Computer
10
Quantum Parallelism
• The speed of Classical computers can be improved by using
parallelism.
• In contrasted with quantum systems, parallelism is exponentially
increased with the linear increase in the size of the system
• Because of it’s inheritance. Parallelism is inbuilt in quantum
systems
11
Qubits
• A bit of data is represented by a single atom that is in one of two
states is known as a qubit,
• Physical implementation of a qubit uses the two energy levels of
an atom.
• Excited state representing |1> and a ground state representing |0>.
12
Qubits contd..
• A single qubit can be forced into a superposition of the two states
denoted by the addition of the state vectors:
|> = 1 |0> + 2 |1>
• Where 1 and 2 are complex numbers and | 1 | + | 2 | = 1
• A qubit in superposition is in both of the states |1> and |0 at the
same time
13
Qubits contd...
Excited State
Ground State
Nucleus
Light pulse of frequency for time interval t
Electron
State |0> State |1>
Light pulse of frequency for time
interval t/2
State |0> State |0> + |1>
Fig 6. Representation of Qbits
14
Data Retrieval
• In general, an n qubit register can represent the numbers 0 through
2n-1 simultaneously.
• If we attempt to retrieve the values represented within a
superposition, it randomly collapses to represent just one of the
original values.
15
Quantum Entanglement
• It is the ability of quantum systems to exhibit correlations between
states within a superposition.
• We can entangle the two qubits such that the measurement of one
qubit is always correlated to the measurement of the other qubit.
16
Basic Architectural Designs
• There are three chief components –
• Quantum ALU,
• Quantum memory, and a
• Dynamic scheduler.
• This architecture also uses teleportation by the way the
components are wired together.
17
Basic Architectural Designs contd..
• Generally, the architectures developed are built using solid-state
technology such as quantum dots or other molecules.
• For a universal architecture, general-purpose hardware is
considered.
• It is noticed that when the qubits that interact are near to each
other, it is the least error-prone.
18
Layered Architecture
• Layered architecture supports the development of a
framework in a systematic and a hierarchical manner
• Every layer has a set of related responsibilities assigned. Each
lower layer provides services to the layer above it.
• Interfaces are defined between two interacting layers. A complex
system is divided into small and controllable sets of procedures.
19
Layered Architecture contd..
Fig. 7 Layered Architecture of Quantum Computing
Application : RSA Algorithm Cracking
20
165181 417953 69037894493
Easy
Hard
Fig. 8. RSA Algorithm Implementation
21
Conclusion
• Advantages over classical computing due to entanglement and
superposition.
• Quantum computers are not a replacement for classical computers.
• The algorithms don’t prove to be that effective when they are run
on classical processors
22
References
1. Jain, S. ; Georgia State Univ., Atlanta, GA, USA Quantum computer architectures:
A survey, Computing for Sustainable Global Development (INDIACom), 2015
2nd International Conference.
2. Vasil S. Denchev and Gopal Pandurangan. 2008. Distributed Quantum
Computing: A New Frontier in Distributed Systems or Science Fiction? Purdue
University 5 June 2009
3. A Layered Architecture for Quantum Computing N. Cody Jones Edward L.
Ginzton Laboratory, Stanford University, Stanford, California 94305-4088, USA
23
Thank You…