ECE 497NC: Unconventional Computer Architecture Lecture 12: Quantum Computers II – Implementation Issues Nicholas Carter.

Slides:



Advertisements
Similar presentations
Computer Architecture
Advertisements

System Integration and Performance
University of Queensland
Quantum Parallel Computing BY NIC & TIM: GUARDIANS OF THE HOOD.
Quantum Computing Uf H Nick Bonesteel
NMR SPECTROSCOPY.
Quantum Error Correction SOURCES: Michele Mosca Daniel Gottesman Richard Spillman Andrew Landahl.
Chien Hsing James Wu David Gottesman Andrew Landahl.
Quantum Computing Lecture 19 Robert Mann. Nuclear Magnetic Resonance Quantum Computers Qubit representation: spin of an atomic nucleus Unitary evolution:
Ion Trap Quantum Computer. Two Level Atom as a qubit Electron on lower orbit Electron on higher orbit.
Quantum Computing Ambarish Roy Presentation Flow.
Quantum Computation and Error Correction Ali Soleimani.
University of Queensland
Beyond the DiVincenzo Criteria: Requirements and Desiderata for Fault-Tolerance Daniel Gottesman.
Review from last lecture: A Simple Quantum (3,1) Repetition Code
The Integration Algorithm A quantum computer could integrate a function in less computational time then a classical computer... The integral of a one dimensional.
Quantum Computing Joseph Stelmach.
Memory Hierarchies for Quantum Data Dean Copsey, Mark Oskin, Frederic T. Chong, Isaac Chaung and Khaled Abdel-Ghaffar Presented by Greg Gerou.
Main ideas of a NMR quantum computer Advantages of NMR Nucleus is naturally protected from outside interference.Nucleus is naturally protected.
Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005.
Real Quantum Computers Sources Richard Spillman Mike Frank Mike Frank Julian Miller Isaac Chuang, M. Steffen, L.M.K. Vandersypen, G. Breyta, C.S. Yannoni,
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
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
Autonomous Quantum Error Correction Joachim Cohen QUANTIC.
Tallinn University of Technology Quantum computer impact on public key cryptography Roman Stepanenko.
Quantum Devices (or, How to Build Your Own Quantum Computer)
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
Quantum Computing David Dvorak CIS 492. Quantum Computing Overview What is it? How does it work? –The basics –Clarifying with examples Factoring Quantum.
Quantum Information Jan Guzowski. Universal Quantum Computers are Only Years Away From David’s Deutsch weblog: „For a long time my standard answer to.
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.
ECS 152A 4. Communications Techniques. Asynchronous and Synchronous Transmission Timing problems require a mechanism to synchronize the transmitter and.
Data and Computer Communications Eighth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 6 – Digital Data Communications Techniques.
Data and Computer Communications Chapter 6 – Digital Data Communications Techniques.
Physics of Computing and the Promise and Limitations of Quantum Computing Charles H. Bennett IBM Research Yorktown Santa Cruz, 24 Oct 2005.
Quantum Computing – Part 2 Amanda Denton – Evil Dictator Jesse Millikan – Mad Scientist Lee Ballard – Some Guy With A Beard September 30, 2001.
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
A Study of Error-Correcting Codes for Quantum Adiabatic Computing Omid Etesami Daniel Preda CS252 – Spring 2007.
Quantum Computers by Ran Li.
Nawaf M Albadia
Cove: A Practical Quantum Computer Programming Framework Summer 2008 Status Matt Purkeypile.
Quantum computing, teleportation, cryptography Computing Teleportation Cryptography.
Quantum Computing and Quantum Programming Language
Quantum Computing and Nuclear Magnetic Resonance Jonathan Jones EPS-12, Budapest, August Oxford Centre for Quantum Computation
Introduction to Quantum Computing
Quantum Computing Michael Larson. The Quantum Computer Quantum computers, like all computers, are machines that perform calculations upon data. Quantum.
FUNDAMENTALS OF NETWORKING
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.
1/30/ :20 PM1 Chapter 6 ─ Digital Data Communication Techniques CSE 3213 Fall 2011.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
As if computers weren’t fast enough already…
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
Quantum Computing: An Introduction Khalid Muhammad 1 History of Quantum Computing Bits and Qubits Problems with the Quantum Machine.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Data and Computer Communications Eighth & Ninth Edition by William Stallings Chapter 6 – Digital Data Communications Techniques.
 This depends on a property of nuclei called spin.  Gyroscope: Principle: As long as its disc remains spinning rapidly the direction of the spin axis.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Quantum Computing: An Introduction
Quantum Bits (qubit) 1 qubit probabilistically represents 2 states
QUANTUM COMPUTING: Quantum computing is an attempt to unite Quantum mechanics and information science together to achieve next generation computation.
Architecture & Organization 1
Architecture & Organization 1
Simulation of computer system
Cryptography and Quantum Computing
OSU Quantum Information Seminar
Improving Quantum Circuit Dependability
Quantum Computing Joseph Stelmach.
(4)ELECTRONIC SUPPORT SYSTEM
Presentation transcript:

ECE 497NC: Unconventional Computer Architecture Lecture 12: Quantum Computers II – Implementation Issues Nicholas Carter

Outline Hurdles to building quantum computers –Decoherence –Error Correction Requirements for workable quantum computers NMR quantum computers Complete architecture proposal

Decoherence Quantum computations rely on being able to operate on a set of qubits in an entangled/superimposed state –Allows computation on all possible inputs to a computation in parallel Problem: Interaction of qubits with environment affects their state, causing them to not be entangled/superimposed –Can partially address this by designing computer to reduce interaction with environment, but this may make it impractical (for example, running at very low temperatures) General result: a quantum computation can only proceed for a limited period of time before a measurement must be performed –Measurement forces the system into a more-stable classical state –Measurement destroys superposition –System limited by ratio of decoherence time to operation latency

Quantum Errors Digital systems provide noise protection by mapping an analog signal onto two discrete states –Any error/noise that doesn’t cause the system to mis-interpret a signal gets corrected by the next circuit that reads the signal Problem: qubits are analog –Need to be able to operate on qubits that are superpositions of multiple states –Observation of qubits collapses them into one state or another –Also, operations on qubits are unlikely to be perfect, another source of error Need error correction

Classic Error Correction Basic idea: encode n bits of data as n + m bits of error- detecting data. –For codes where the original n bits remain unchanged, the m bits are called the syndrome. –Example: Hamming codes –Well-understood trade-off between m and number of errors that can be corrected/detected Whenever data is read, regenerate the m syndrome bits –Compare to syndrome from data to determine if error has occurred –Depending on the code, may be able to correct errors as well as just detect

Quantum Error Correction Problem: reading qubits in a superimposed state collapses them to one state or the other. –Can’t use coding algorithms that require examining the data bits to detect errors Solution: use codes based on measurements that only determine information about errors, not about data –Theoretical best code uses 5 qubits to encode 1 –Commonly-used code uses 7 qubits for each data qubit. –Can recursively apply encoding technique to tolerate higher error probabilities –For some codes, can build gates that operate on encoded data directly, without decoding Code used in paper requires “about 153” physical gates to implement a fault-tolerant operation Implementation parameter: error rate of technology determines how much logic can be done between error corrections, and thus overhead of error correction.

Requirements for Quantum Computer Need to have something to represent qubits –Lots of physical phenomena that have two states Must be able to address individual qubits, and qubits must be able to interact –Must be able to apply individual qubits as inputs to gates –Need to have gates with >1 input Must be able to initialize qubits to a known state –Hard to write programs if you can’t set inputs Must be able to observe/extract result from system –Yep, the answer’s in there somewhere, just can’t get it out Coherence time must be long compared to gate delay –This basically determines how many operations we can do on a superposition before we have to do an observation –Implementation detail visible to programmer

NMR-Based Quantum Computers Most advanced demonstrated technology for quantum computation Use nuclei with spin ½ as qubits –Spin straight up = |0> –Spin straight down = |1> –Other directions indicate superpositions of |0> and |1> –Long coherence times (seconds) Electron spins (alternate technology) have coherence times of nanoseconds –In a magnetic field, spin direction precesses about the field’s axis at a rate that is proportional to the field strength

NMR-Based Computers II Bond atoms that represent qubits into molecules –Inter-atomic bonds provide mechanism for different qubits to interact. –Each molecule becomes an n-qubit computing system Can operate on multiple molecules in parallel to reduce errors –Asymmetry of molecule causes different atoms to precess at different frequencies Individual addressability

Structure of System Tube Static field coils RF Coils

Implementing Operations Key ideas: –Radio energy applied perpendicular to magnetic field causes spins to rotate around axis of RF field if RF frequency is a resonant frequency of the precession frequency Pulses of different durations cause different amounts of rotation –Position of spin of atom A affects precession rate of nearby atom B by altering the magnetic field seen by B –Differences between precession frequencies of different atoms in the molecule >> effect of nearby atom spins

Implementing Operations I Can flip state of bit with appropriately-timed RF pulse, or set into superposition with shorter pulse Can create multi-input gates by sending pulses at the frequency that the atom will precess at if appropriate other bits are in a given state. –CNOT operation CNOT operation + set of operations on individual qubits = universal set of gates “Machine language” is now set of frequency of RF pulses, duration of pulses, and time between pulses Read state out by rotating qubit spins into horizontal plane, sensing the time-varying magnetic field they create as they precess

Results Used NMR technology to implement the core of Shor’s algorithm on permutations of a four-element set. Duration: ms, depending on permutation

Full System Architecture Goal: extend thoughts on ways to do computation with quantum to something like a full system Issues –Data storage –Communication/signalling –Error correction overhead Basic idea: Couple quantum computing system with classical computer –Classical computer sequences operations through quantum computer, does dynamic compilation –Classical computer also does checking of results for probabilistic computations System aimed at NP-complete problems where computing answer is hard but checking answer is easy.

Programming/Compiling Two-phase process Pre-compiler generates code that executes the algorithm with a specified error probability on an ideal quantum computer Dynamic compiler creates instruction stream to meet the error probability on the actual computer –This compiler needs to know about the technology –Also needs estimate of program run time #errors is proportional to run time. Estimate either provided by user or generated using profiling –For example, can start with very conservative (strong) error correction and use lower levels once the running time is known

Error Correction Problem: 7-bit codes only tolerate certain amounts of error –Can tolerate greater errors by recursive coding, at greatly increased cost –“Sawtooth” overhead as error rates cross critical thresholds Solution: Cluster operations –Rather than performing error correction on each operation, group operations into clusters and only do error correction after each cluster. –Allows “fractional” levels of recursion, bringing error correction cost much closer to ideal.

Architecture Quantum ALU/Ancilla generator –Performs actual computations and error correction –Implements set of universal quantum operations Quantum Memories –Storage locations for qubits –Assumed to have 2 orders of magnitude lower error rates than CPU Entropy Exchange Unit –Source of qubits in |0> or CAT state –Important, because many algorithms require many qubits in one of these states or the other Inter-unit communication via quantum teleportation –Allows exact state of qubits to be transmitted –Extension to quantum teleportation allows conversion from one error- correcting code to another as part of teleportation

Conclusions/Thoughts Quantum computing is still way out there, though people are starting to demonstrate actual systems One issue: current designs expose implementation issues to programmer –Time that computation can run before decoherence becomes an issue –Number of steps that can be performed before need to do a measurement Still big gaps between demonstrated results and the theoretical predictions people are using to do designs My gut feelings: –We’ll see quantum computers being built for specific problems in the next decade or two –Quantum computing won’t move into the mainstream unless a vastly better implementation technology is developed and a much larger set of problems that are good for quantum are discovered