QUANTUM COMPUTING: Quantum computing is an attempt to unite Quantum mechanics and information science together to achieve next generation computation.

Slides:



Advertisements
Similar presentations
FUTURE TECHNOLOGIES Lecture 13.  In this lecture we will discuss some of the important technologies of the future  Autonomic Computing  Cloud Computing.
Advertisements

Quantum Computing. Introduction to Computing Is currently done on your laptop today Numbers as we commonly use them are in decimal (base 10) format. Computers.
Chapter 5: Computer Systems Organization Invitation to Computer Science, Java Version, Third Edition.
Computational Astrophysics: Methodology 1.Identify astrophysical problem 2.Write down corresponding equations 3.Identify numerical algorithm 4.Find a computer.
Quantum Computing Ambarish Roy Presentation Flow.
Quantum Computation and Error Correction Ali Soleimani.
Quantum Computing Joseph Stelmach.
Ana Maria Rey Saturday Physics Series, Nov 14/ 2009.
Memory Hierarchies for Quantum Data Dean Copsey, Mark Oskin, Frederic T. Chong, Isaac Chaung and Khaled Abdel-Ghaffar Presented by Greg Gerou.
In Search of a Magic Bottle of Error-Be-Gone Dave Bacon Caltech Department of Physics Institute for Quantum Information Decoherence errosol.
3.1Introduction to CPU Central processing unit etched on silicon chip called microprocessor Contain tens of millions of tiny transistors Key components:
By: Mike Neumiller & Brian Yarbrough
Moore’s Law the number of circuits on a single silicon chip doubles every 18 to 24 months.
CPU Performance Assessment As-Bahiya Abu-Samra *Moore’s Law *Clock Speed *Instruction Execution Rate - MIPS - MFLOPS *SPEC Speed Metric *Amdahl’s.
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
Lecture#14. Last Lecture Summary Memory Address, size What memory stores OS, Application programs, Data, Instructions Types of Memory Non Volatile and.
3 1 3 C H A P T E R Hardware: Input, Processing, and Output Devices.
Quantum Computing David Dvorak CIS 492. Quantum Computing Overview What is it? How does it work? –The basics –Clarifying with examples Factoring Quantum.
Quantum Computing The Next Generation of Computing Devices? by Heiko Frost, Seth Herve and Daniel Matthews.
Quantum Computing Presented by: Don Davis PHYS
Chapter 5: Computer Systems Organization Invitation to Computer Science, Java Version, Third Edition.
Quantum Information Jan Guzowski. Universal Quantum Computers are Only Years Away From David’s Deutsch weblog: „For a long time my standard answer to.
Limits and Horizon of Computing Post silicon computing.
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy’s National Nuclear.
An Introduction to Quantum Phenomena and their Effect on Computing Peter Shoemaker MSCS Candidate March 7 th, 2003.
Advanced Computer Architecture 0 Lecture # 1 Introduction by Husnain Sherazi.
1 Memory Hierarchy The main memory occupies a central position by being able to communicate directly with the CPU and with auxiliary memory devices through.
Super computers Parallel Processing By Lecturer: Aisha Dawood.
Quantum Computing Paola Cappellaro
Quantum Computers by Ran Li.
Computer Architecture Lecture 32 Fasih ur Rehman.
CS 1308 Computer Literacy and the Internet. Objectives In this chapter, you will learn about:  The components of a computer system  Putting all the.
Quantum Mechanics(14/2) Hongki Lee BIOPHOTONICS ENGINEERING LABORATORY School of Electrical and Electronic Engineering, Yonsei University Quantum Computing.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 4 Computer Systems Review.
Introduction to Quantum Computing
3/12/2013Computer Engg, IIT(BHU)1 INTRODUCTION-1.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Chapter 11 System Performance Enhancement. Basic Operation of a Computer l Program is loaded into memory l Instruction is fetched from memory l Operands.
Computer Organization IS F242. Course Objective It aims at understanding and appreciating the computing system’s functional components, their characteristics,
Alternative Parallel Processing Approaches
William Stallings Computer Organization and Architecture 6th Edition
Computer Organization and Architecture Lecture 1 : Introduction
What is a computer? Simply put, a computer is a sophisticated electronic calculating machine that: Accepts input information, Processes the information.
The Goal: illusion of large, fast, cheap memory
What is a computer? Simply put, a computer is a sophisticated electronic calculating machine that: Accepts input information, Processes the information.
Poomipat Phusayangkul
Chapter 1: Introduction
The Central Processing Unit
Architecture & Organization 1
Quantum Computers Superposition Interference Entanglement and Quantum Error Correction Lesson 1 By: Professor Lili Saghafi
Limits and Horizon of Computing
Architecture & Organization 1
Computer-System Architecture
Module 2: Computer-System Structures
3.1 Introduction to CPU Central processing unit etched on silicon chip called microprocessor Contain tens of millions of tiny transistors Key components:
Quantum Computing Dorca Lee.
Chapter 5: Computer Systems Organization
Memory Organization.
Saturday Physics Series, Nov 14/ 2009
Module 2: Computer-System Structures
What is Computer Architecture?
Introduction to Computer Architecture
Computer Organization & Architecture 3416
Quantum Computing Hakem Alazmi Jhilakshi Sharma Linda Vu.
Chapter 2: Computer-System Structures
Quantum Computing Joseph Stelmach.
Chapter 2: Computer-System Structures
Module 2: Computer-System Structures
The Future is Quantum Computing
Presentation transcript:

QUANTUM COMPUTING: Quantum computing is an attempt to unite Quantum mechanics and information science together to achieve next generation computation. A Quantum computer is a machine that performs calculations based on the laws of quantum mechanics which is the behaviour of particles at the sub-atomic level. Quantum computers have simultaneity and parallelism built inherently.

Moore’s law states that transistors doubles every 18 months in a microprocessor. Transistor size should reduce proportionally. CMOS-size-5nm In other few years the transistor size reaches sub-atomic scale i.e in the range of 0.1A

Classical Computers: Use bits which contain either zero or a one. Operate on these bits using a series of binary logic gates. Components have been decreasing in size. Classical designs are reaching the theoretical limit of miniaturization.(only a few atoms) On the atomic scale matter obeys the rules of quantum not classical physics. Quantum technology could not only further reduce the size of components , but could allow for development of new algorithms based on quantum concepts.

Qubit(Quantum bit) A bit of data is represented by a single atom that is in one of two states is known as qubit. Physical implementation of a qubit uses the two energy levels of an atom. Excited state representing |1> and a ground state representing |0>. Spin up-state represents a 1,spin-down a 0. A single bit can be forced into a superposition of the two states.

So What’s the Point? While a single classical bit can store either 0 or 1,a single qubit can simultaneously store both 0 and 1. Two qubits can store four states simultaneously while two classical bits can store one of four bits. In general if L is the number of qubits in a quantum register, that register can store 2^L different states simultaneously. Classical registers store only one state.

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 system. Because of its inheritance. Parallelism is inbuilt in quantum systems.

Quantum error detection: . The qubits are highly unstable and they keep their state which is termed as ‘decoherence’. This requires constant error correction for building a fault tolerant system. Quantum error correction is very expensive because arbitrary reliability is achieved by recursively encoding physical qubits numerous times and is achieved at the expense of speed. It is the most basic operation of a quantum computer.

Parallelism Exploitable parallelism is limited by resource and application structure. Now specialize into memory and computing blocks. Encode them differently. High processing speed and slow memory. The problem of stalls. Now,

Memory hierarchy Reliability can be increased by recursive encoding. When level 1 encoding creates N bits, Level 2 encoding creates N^2 logical bits. Qubits in ion trap quantum processor have large life times when left idle. Volatility increases with interactions.

Error correction procedure for every gate. Processor spends most of its time on ECP. So design should enable fast error correction. Increase the number of the cloned/ancillary qubits. For each level of concatenation error correction time and error increase exponentially. But reliability increases double exponentially 

Revised architecture Data locality is a common phenomenon. The logical qubit can start at level 2, go to level 1 in peak and return to level 2 when idle. Memory at level 2 is for area and reliability. It is slower than level 1 structure designed for gate execution. So what do we do for optimisation?

Cache Alleviate the need for constant communication. Memory at level 2 encoding (slow and reliable). Cache at level 1 (faster and less reliable). Compute region is fastest and as reliable as cache. But they differ in speed due to the number of ancilla bits in compute region.

(a) Memory is denser. The figure shows 3 data qubits in the compute block which take the same area as 8 data qubits in memory. (b) Memory is at level 2 encoding, while the compute and cache are at level 1 encoding. The revised architecture consists of memory at level 2, compute regions at level 2 and also a cache and compute region at level 1.

Changed the ratio of logical to ancillary bits. Earlier it was 1:2 entirely. Now 8:1 and 1:2. Eg: adder The cache hit rate was around 20%. Static scheduling is done and the dependency is calculated. The optimised approach fetches hit rate up to 85% irrespective of the cache and adder size. Now, we have seen that balanced design with architectural techniques shows 13X improvement in speed and 8X in performance.

THANK YOU