Architectural Components for a Practical Quantum Computer: John Kubiatowicz University of California at Berkeley Berkeley IAB March 19, 2003.

Slides:



Advertisements
Similar presentations
Quantum Computation and Quantum Information – Lecture 3
Advertisements

Quantum Information Processing with Semiconductors Martin Eberl, TU Munich JASS 2008, St. Petersburg.
Quantum Error Correction Daniel Gottesman Perimeter Institute.
Quantum Computing Ambarish Roy Presentation Flow.
Superposition, Entanglement, and Quantum Computation Aditya Prasad 3/31/02.
Automated Generation of Layout and Control for Quantum Circuits Mark Whitney, Nemanja Isailovic, Yatish Patel, John Kubiatowicz University of California,
Quantum Computing Joseph Stelmach.
Architectural Components for a Practical Quantum Computer: John Kubiatowicz University of California at Berkeley.
Architectural Components for a Practical Quantum Computer: John Kubiatowicz University of California at Berkeley Cohorts in Crime: Fred Chong (UC Davis),
Memory Hierarchies for Quantum Data Dean Copsey, Mark Oskin, Frederic T. Chong, Isaac Chaung and Khaled Abdel-Ghaffar Presented by Greg Gerou.
Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
Quantum Architecture more unknowns than knowns Mark Oskin University of Washington.
Quantum Communication, Quantum Entanglement and All That Jazz Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering,
Quantum computing Alex Karassev. Quantum Computer Quantum computer uses properties of elementary particle that are predicted by quantum mechanics Usual.
By: Mike Neumiller & Brian Yarbrough
Moore’s Law the number of circuits on a single silicon chip doubles every 18 to 24 months.
A Quantum of Computing …using the Incomprehensible to solve the Intractable … Dave
Physics is becoming too difficult for physicists. — David Hilbert (mathematician)
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
Alice and Bob’s Excellent Adventure
Quantum Computing The Next Generation of Computing Devices? by Heiko Frost, Seth Herve and Daniel Matthews.
From Bits to Qubits Wayne Viers and Josh Lamkins
Cove: A Practical Quantum Computer Programming Framework Matt Purkeypile Doctorate of Computer Science Dissertation Defense June 26, 2009.
Quantum Information Jan Guzowski. Universal Quantum Computers are Only Years Away From David’s Deutsch weblog: „For a long time my standard answer to.
An Introduction to Quantum Phenomena and their Effect on Computing Peter Shoemaker MSCS Candidate March 7 th, 2003.
IIS 2004, CroatiaSeptember 22, 2004 Quantum Cryptography and Security of Information Systems 1 2
Quantum Computing Basic Concepts and Applications.
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
By Joseph Szatkowski and Cody Borgschulte. ● Uses phenomenon associated with quantum mechanics instead of electrical circuitry ● Quantum mechanics explains.
Quantum Computing Paola Cappellaro
CS555Topic 251 Cryptography CS 555 Topic 25: Quantum Crpytography.
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.
Copyright © 2006 Keio University Applications of an Entangled Quantum Internet Conference on Future Internet Technologies Seoul, Korea June 20, 2008 Rodney.
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
Classical Control for Quantum Computers Mark Whitney, Nemanja Isailovic, Yatish Patel, John Kubiatowicz U.C. Berkeley.
A Study of Error-Correcting Codes for Quantum Adiabatic Computing Omid Etesami Daniel Preda CS252 – Spring 2007.
Quantum Computers by Ran Li.
Quantum Mechanics1 Schrodinger’s Cat. Quantum Mechanics2 A particular quantum state, completely described by enough quantum numbers, is called a state.
Quantum Processing Simulation
Nawaf M Albadia
Cove: A Practical Quantum Computer Programming Framework Summer 2008 Status Matt Purkeypile.
Quantum and classical computing Dalibor HRG EECS FER
Quantum computing, teleportation, cryptography Computing Teleportation Cryptography.
Quantum Convolutional Coding Techniques Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering, University of.
Quantum Mechanics(14/2) Hongki Lee BIOPHOTONICS ENGINEERING LABORATORY School of Electrical and Electronic Engineering, Yonsei University Quantum Computing.
Quantum Computing Michael Larson. The Quantum Computer Quantum computers, like all computers, are machines that perform calculations upon data. Quantum.
FNI 1H Quantum Mechanics 1 Quantum Mechanics I don't like it, and I'm sorry I ever had anything to do with it. -- Erwin Schrodinger talking about Quantum.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
A Quantum Computer in a Diamond Grant Riley. Outline Requirements for a quantum computer Chemical Vapor Deposition Diamonds – Properties – Impurities.
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
1 Transactional Nature of Quantum Information Subhash Kak Computer Science, Oklahoma State Univ © Subhash Kak, June 2009.
Our Proposed Technique
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Christopher Monroe Joint Quantum Institute and Department of Physics NIST and University of Maryland Quantum Computation and Simulation.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
15-853Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” Including Quantum Communication Quantum Computing.
Attendance Syllabus Textbook (hardcopy or electronics) Groups s First-time meeting.
Quantum Bits (qubit) 1 qubit probabilistically represents 2 states
COMPSCI 290.2: Computer Security
Quantum Circuit Visualization
A low cost quantum factoring algorithm
Quantum Cryptography Quantum Computing
Quantum Computers Superposition Interference Entanglement and Quantum Error Correction Lesson 1 By: Professor Lili Saghafi
Quantum Computing Dorca Lee.
Quantum Computing Hakem Alazmi Jhilakshi Sharma Linda Vu.
Quantum Computing Joseph Stelmach.
Presentation transcript:

Architectural Components for a Practical Quantum Computer: John Kubiatowicz University of California at Berkeley Berkeley IAB March 19, 2003

QARCH:2Berkeley IAB, March 19 Why Quantum Computers? Interesting potential? –Shor’s algorithm: factors in polynomial time! –Grover’s algorithm: Finds items in unsorted database in time proportional to square-root of n –Break homomorphic encryption algorithms –Verify results of computation faster than possible classically… Interesting architectural challenges! –Different from classical challenges Today: BABY STEPS

QARCH:3Berkeley IAB, March 19 Use of “Spin” for QuBits Quantum effect gives “1” and “0”: –Either spin is “UP” or “DOWN” nothing in between Superposition: Mix of “1” and “0”: –Written as:  = C 0 |0> + C 1 |1> –An n-bit register can have 2 n values simultaneously!  =C 000 |000>+C 001 |001>+C 010 |010>+C 011 |011> + C 100 |100>+C 101 |101>+C 110 |110>+C 111 |111> Spin ½ particle: (Proton/Electron) Representation: |0> or |1> North South North South

QARCH:4Berkeley IAB, March 19 Start with Scalable Technology: For instance Kane proposal Others certainly possible (No offense intended!)

QARCH:5Berkeley IAB, March nm 5nm 20nm 100nm Classical access points Narrow tipped control 20nm 100nm Interesting fact #1: Pitch-matching nightmare??

QARCH:6Berkeley IAB, March 19 Fabrication of possible Kane gates happening at LBL (Thomas Schenkel) Quantum bits: phosphorus nuclei for gates Single-Electron transistors for measurement Poly-Silicon control gates Question: –How to provide classical control at temperature < 1K –Circuits from single-electron transistors?

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

QARCH:8Berkeley IAB, March 19 Why are initialized states important? Initialized states (zeros, for instance) required for: –Initialization of Computation (not surprising) –Error correction (continuous consumption) –Long-distance quantum transport (wires) Paradox: –Insulate from environment for quantum computing –Tie to environment for initialization

QARCH:9Berkeley IAB, March 19 Interesting Ubiquitous Component: The Entropy Exchange Unit Possibilities for cooling: –Spin-polarized photons  spin-polarized electrons  spin-polarized nucleons –Simple thermal cooling of some sort Current efforts at Berkeley: –Understand entropy exchange in context of Kane scheme Zeros Out #!$**# Garbage In

QARCH:10Berkeley IAB, March 19 Interesting Fact #2: Wires are non-trivial No-cloning theorem: –Cannot copy quantum states –  = C 0 |0> + C 1 |1> –Can transport it… Classical Wires copy state!!! –Also: Repeaters/amplifiers: probably right out!  ?

QARCH:11Berkeley IAB, March 19 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:12Berkeley IAB, March 19 Why short wires are short Limited by decoherence Threshold theorem => distance –For some assumptions  1  (very rough) –Very coarse bounds so far Can make longer with “repeater”? –Essentially this is multiple short wires Separated by error correction blocks Berkeley Explorations: –Actual control mechanisms for self-contained swap gates (Build from SETs? Other control?) –Longer distance through ballistic electron transport?

QARCH:13Berkeley IAB, March 19  EPR Pair X Getting Longer Wires Use “Quantum Teleportation” –Transfers EPR pairs to either end of “wire” –Measures state at source, transfers bits to dest –Source bit destroyed, reconstructed at dest X Classical Info (2 bits) 

QARCH:14Berkeley IAB, March 19 A Long Quantum Wire: Use Quantum Teleportation EPR Generator Teleporation Unit Entropy Exchange Purification Coded Tele- Portation Classical control channel Quantum EPR channel EPR channel 

QARCH:15Berkeley IAB, March 19 Conclusion Perhaps not too early for Architects to start thinking about quantum computing Important non-classical components: –Wires: Multiple varieties –Entropy exchange units/EPR generators –CAD Tools? Quantum Architecture Research Center: –Studying Memory, CPUs, Wires, etc –Physics of components and classical/quantum interface –Exploring CAD tools: Fabrication “switch-level simulation”: evaluate algorithms Quantum VHDL –New ways of describing Quantum Computing Funding from DARPA, NSF