Architectural Components for a Practical Quantum Computer: John Kubiatowicz University of California at Berkeley.

Slides:



Advertisements
Similar presentations
TO COMPUTERS WITH BASIC CONCEPTS Lecturer: Mohamed-Nur Hussein Abdullahi Hame WEEK 1 M. Sc in CSE (Daffodil International University)
Advertisements

EEE226 MICROPROCESSORBY DR. ZAINI ABDUL HALIM School of Electrical & Electronic Engineering USM.
Microprocessors VLIW Very Long Instruction Word Computing April 18th, 2002.
© 2008 Wayne Wolf Overheads for Computers as Components 2nd ed. Instruction sets Computer architecture taxonomy. Assembly language. 1.
Fall 2001CS 4471 CS 447: Fall 2001 Chapter 1: Computer Abstraction and Technology (Introduction to the course)
Chapter 5: Computer Systems Organization Invitation to Computer Science, Java Version, Third Edition.
The Logic Machine We looked at programming at the high level and at the low level. The question now is: How can a physical computer be built to run a program?
Computational Astrophysics: Methodology 1.Identify astrophysical problem 2.Write down corresponding equations 3.Identify numerical algorithm 4.Find a computer.
Data Manipulation Computer System consists of the following parts:
Microprocessors Introduction to ia64 Architecture Jan 31st, 2002 General Principles.
Lab for Reliable Computing Generalized Latency-Insensitive Systems for Single-Clock and Multi-Clock Architectures Singh, M.; Theobald, M.; Design, Automation.
Automated Generation of Layout and Control for Quantum Circuits Mark Whitney, Nemanja Isailovic, Yatish Patel, John Kubiatowicz University of California,
Architectural Components for a Practical Quantum Computer: John Kubiatowicz University of California at Berkeley Cohorts in Crime: Fred Chong (UC Davis),
Alpha Goal: very fast multiprocessor systems, highly scalable Main trick is high-bandwidth, low-latency data access. How to do it, how to do it?
Memory Hierarchies for Quantum Data Dean Copsey, Mark Oskin, Frederic T. Chong, Isaac Chaung and Khaled Abdel-Ghaffar Presented by Greg Gerou.
Quantum Architecture more unknowns than knowns Mark Oskin University of Washington.
I/O Tanenbaum, ch. 5 p. 329 – 427 Silberschatz, ch. 13 p
CHAPTER 4: INTRODUCTION TO COMPUTER ORGANIZATION AND PROGRAMMING DESIGN Lec. Ghader Kurdi.
EKT303/4 PRINCIPLES OF PRINCIPLES OF COMPUTER ARCHITECTURE (PoCA)
Computer Architecture ECE 4801 Berk Sunar Erkay Savas.
1/19 Component Design On-demand Learning Series Software Engineering of Web Application - Principles of Good Component Design Hunan University, Software.
Invitation to Computer Science 5th Edition
Cove: A Practical Quantum Computer Programming Framework Matt Purkeypile Doctorate of Computer Science Dissertation Defense June 26, 2009.
Chapter 5: Computer Systems Organization Invitation to Computer Science, Java Version, Third Edition.
Abstraction IS 101Y/CMSC 101 Computational Thinking and Design Tuesday, September 17, 2013 Marie desJardins University of Maryland, Baltimore County.
Limitations of Digital Computation William Trapanese Richard Wong.
Advanced Computer Architecture 0 Lecture # 1 Introduction by Husnain Sherazi.
Implementation of Quantum Computing Ethan Brown Devin Harper With emphasis on the Kane quantum computer.
Frank Casilio Computer Engineering May 15, 1997 Multithreaded Processors.
(Building the Presentation Layer - KISS). Figuring out what to do! Every was not learnt over night and certainly not without proper help and support.
VIRTUAL MEMORY By Thi Nguyen. Motivation  In early time, the main memory was not large enough to store and execute complex program as higher level languages.
CSCI-100 Introduction to Computing Hardware Design Part I.
Bell Measurements and Teleportation. Overview Entanglement Bell states and Bell measurements Limitations on Bell measurements using linear devices Teleportation.
Fall 2004EE 3563 Digital Systems Design EE 3563 VHSIC Hardware Description Language  Required Reading: –These Slides –VHDL Tutorial  Very High Speed.
Architectural Components for a Practical Quantum Computer: John Kubiatowicz University of California at Berkeley Berkeley IAB March 19, 2003.
CS 3500 L Performance l Code Complete 2 – Chapters 25/26 and Chapter 7 of K&P l Compare today to 44 years ago – The Burroughs B1700 – circa 1974.
Copyright © 2006 Keio University Applications of an Entangled Quantum Internet Conference on Future Internet Technologies Seoul, Korea June 20, 2008 Rodney.
Classical Control for Quantum Computers Mark Whitney, Nemanja Isailovic, Yatish Patel, John Kubiatowicz U.C. Berkeley.
Cove: A Practical Quantum Computer Programming Framework Summer 2008 Status Matt Purkeypile.
“Education is a Treasure that follows you everywhere.” – Chines Proverb Methods and Functions.
CENTER FOR EXOTIC QUANTUM SYSTEMS CEQS Preskill 1983 Kitaev 2002 Refael 2005 Motrunich 2006 Fisher 2009 Historically, Caltech physics has focused on the.
Stored Programs In today’s lesson, we will look at: what we mean by a stored program computer how computers store and run programs what we mean by the.
May University of Glasgow Generalising Feature Interactions in Muffy Calder, Alice Miller Dept. of Computing Science University of Glasgow.
Design Reuse Earlier we have covered the re-usable Architectural Styles as design patterns for High-Level Design. At mid-level and low-level, design patterns.
Stored Program A stored-program digital computer is one that keeps its programmed instructions, as well as its data, in read-write,
Von Neumann Computers Article Authors: Rudolf Eigenman & David Lilja
IT3002 Computer Architecture
Silicon Design Page 1 The Creation of a New Computer Chip.
Cray XD1 Reconfigurable Computing for Application Acceleration.
CMSC 104, Lecture 061 Stored Programs A look at how programs are executed.
CSCI-235 Micro-Computers in Science Algorithms Part II.
Lecture 4 Page 1 CS 111 Online Modularity and Memory Clearly, programs must have access to memory We need abstractions that give them the required access.
Course Book Course Objective - The student will be able to describe various operating system concepts as they are applied to memory, process, file system.
WELCOME TO OUR PRESENTATION UNIFIED MODELING LANGUAGE (UML)
Gujarat technological university active learning assignment ON ARCHITECTURE OF AVR MICROCONTROLLER at c. K. pithawala college of engineering and technology.
1 The user’s view  A user is a person employing the computer to do useful work  Examples of useful work include spreadsheets word processing developing.
What’s going on here? Can you think of a generic way to describe both of these?
Quantum Bits (qubit) 1 qubit probabilistically represents 2 states
CPU Lesson 2.
Computer Organization and Architecture Lecture 1 : Introduction
Computers’ Basic Organization
Modularity Most useful abstractions an OS wants to offer can’t be directly realized by hardware Modularity is one technique the OS uses to provide better.
Overview Introduction General Register Organization Stack Organization
Modularity and Memory Clearly, programs must have access to memory
Quantum Computers Superposition Interference Entanglement and Quantum Error Correction Lesson 1 By: Professor Lili Saghafi
Operating Systems Chapter 5: Input/Output Management
Chapter 5: Computer Systems Organization
Outline Chapter 2 (cont) OS Design OS structure
Introduction to Microprocessor Programming
ECE 352 Digital System Fundamentals
Presentation transcript:

Architectural Components for a Practical Quantum Computer: John Kubiatowicz University of California at Berkeley

QARCH:2IBM/Berkeley Day QARC: The Quantum Architecture Research Center Four Researchers: –Fred Chong (UC Davis) –Isaac Chuang (MIT) –Mark Oskin (U Washington) –John Kubiatowicz (UC Berkeley) Funny quote on someone’s web site: –“Perhaps appropriately, given the uncertainty principle that underpins quantum mechanics, this ‘center’ does not have a specific physical location, but is rather a community of several research labs led by Fred Chong, Isaac Chuang, and John Kubiatowicz.”

QARCH:3IBM/Berkeley Day What does an architect (i.e. me) Think about? Big systems: –Millions or Billions of interacting elements –Not 7-10 bits Buildable systems: –Constructed from smaller, easily composed elements –Possible to verify functionality Over 50% of modern design teams for verification Verifying a quantum bit -- harder than asynchronous logic??? –Easy to fabricate Programmablesystems: –Can be directed to do some desired task Easy use of abstraction, high-level languages, compilers Could use automated programming techniques, but still need some human-specified goal set –Can be debugged

QARCH:4IBM/Berkeley Day Does this have any relevance to Quantum Computing? Big/Scalable? –Has to be something with easily repeatable units –Given current sophistication of fab technology: This probably means silicon-based…? Buildable? –Components that we understand means: That are bigger than a bit! –It also means that we can multiplex/reuse pieces –Possibly with CAD tools? Programmable? –Yeah, well

QARCH:5IBM/Berkeley Day Classical Computer Components Von Neumann architecture has: –Memory, CPU, Registers, I/O –Very powerful abstraction/good building blocks Physical Extent of components (say on 2-d chip): –Means that we need WIRES Ground/VDD? –Nice source of 0 and 1 Signal preservation through coding –In principle could put ECC everywhere Extensive design flow: –CAD tools for producing circuits/laying them out/fabricating them, etc.

QARCH:6IBM/Berkeley Day Start with Scalable Technology: Big interest in Kane proposal, for instance Others certainly possible (No offense intended!)

QARCH:7IBM/Berkeley Day Interesting problem: Classical Interface to Quantum Domain? 5nm access points contain only a handful of quantum states at temp < 1K 20 nm

QARCH:8IBM/Berkeley Day As two physical dimensions of the access point exceed 100nm thousands of electron states are held. Classically, these states are restricted to the access point, however, quantum mechanically they tunnel downward, guided by the via, thus enabling control. Perhaps a solution?

QARCH:9IBM/Berkeley Day 100nm 5nm 20nm 100nm Classical access points Narrow tipped control 20nm 100nm Pitch-matching nightmare??

QARCH:10IBM/Berkeley Day Example of Components: The Entropy Exchange Unit Zeros Out #!$**# Garbage In “Vazirani-Schulman sorting” across boundary

QARCH:11IBM/Berkeley Day Why is this important? Initialized states (zeros, for instance) required for: –Initialization of Computation (not surprising) –Error correction (continuous consumption) –Long-distance quantum transport (wires) Entropy exchange probably needed everywhere!

QARCH:12IBM/Berkeley Day What is involved here? Substrate capable of quantum computation Possibilities for cooling: –Spin-polarized photons  spin-polarized electrons  spin-polarized nucleons –Simple thermal cooling of some sort Two material domains: –One material in contact with environment –One material isolated Quantum computing across boundary –Ack! Most basic operation requires some computing

QARCH:13IBM/Berkeley Day What about wires? A short quantum wire Key difference from classical: –quantum information must be protected/restored!! –Cannot copy information (no fanout) –Cannot (really) amplify this info Short wire constructed from swap gates –Each step requires 3 quantum-NOT ops (swap)

QARCH:14IBM/Berkeley Day Why short wires are short Limited by decoherence Threshold theorem => distance –For some assumptions  1.8mm (very rough) –Very coarse bounds so far Can make longer with “repeater”? –Essentially this is multiple short wires Separated by error correction blocks

QARCH:15IBM/Berkeley Day How to get longer wires?? Use “Quantum Teleportation” –Transfers EPR pairs to either end of “wire” –Measures state at source, transfers bits to dest –Source bit destroyed at source, reconstructed at dest Key insight: –EPR pairs are known states No need to protect them –Purify the good ones –Discard the bad

QARCH:16IBM/Berkeley Day Architecture of a long wire EPR Generator Teleporation Unit Entropy Exchange Purification Coded Tele- Portation Classical control channel Quantum EPR channel EPR channel

QARCH:17IBM/Berkeley Day Long wires COMPLEX!!! Much computation at either end –Need to purify EPR pairs –Need to measure Can be of “arbitrary” length –A 10mm wire sustains nearly peak bandwidth Latency matches classical latency –Pre-communicate EPR pairs/pipeline purification –Latency is constant: teleportation operation Code-conversation for “free” –Facilitates Processor Memory communication [COC+02]

QARCH:18IBM/Berkeley Day Conclusion Perhaps not too early for Architects to start thinking about quantum computing Important non-classical components: –Entropy exchange units/EPR generators –Wires: Multiple varieties Other things (I didn’t even bother to talk about): –Memory/CPUs, etc –CAD tools –Etc. Will we ever really have to worry about 1000s or millions of bits? –Hopefully