Embedding Logical Qubits into the D-Wave Hardware Graph Keith Britt February 26 th, 2014.

Slides:



Advertisements
Similar presentations
What Have I Learned From Scott AaronsonDave Bacon PhysicistsComputer Scientists and What Else Would I Like to Learn from Them?
Advertisements

Quantum Computing : Security Implications Robert M. Slade, MSc, CISSP
Quantum walks: Definition and applications
Quantum Computation and Quantum Information – Lecture 3
Quantum Parallel Computing BY NIC & TIM: GUARDIANS OF THE HOOD.
Sergey Bravyi, IBM Watson Center Robert Raussendorf, Perimeter Institute Perugia July 16, 2007 Exactly solvable models of statistical physics: applications.
U of Houston – Clear Lake
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
Quantum Theory Made Easy 0 1 Classical p0p0 p1p1 probabilities Quantum a0a0 a1a1 0 1 amplitudes p 0 +p 1 =1|a 0 | 2 +|a 1 | 2 =1 bit qubit p i is a real.
An Algebraic Foundation for Quantum Programming Languages Andrew Petersen & Mark Oskin Department of Computer Science The University of Washington.
EPR – pair usage in the quantum teleportation The Question was: Is the Quantum Mechanical Description of Reality Actually Complete?
Quantum information: the new frontier Karl Svozil TU Wien/Theoretical Physics
On the Task Assignment Problem : Two New Efficient Heuristic Algorithms.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
Chapter 4 Graphs.
Future Computers CSCI 107, Spring When Moore’s law runs out of room When transistors become only tens of atoms thick –Quantum mechanics applies.
By: Mike Neumiller & Brian Yarbrough
1 Bob Lucas Federico Spedalieri Information Sciences Institute Viterbi School of Engineering USC Adiabatic Quantum Computing with the D-Wave One.
Physics is becoming too difficult for physicists. — David Hilbert (mathematician)
From Bits to Qubits Wayne Viers and Josh Lamkins
Quantum Computing Presented by: Don Davis PHYS
Computer Science 112 Fundamentals of Programming II Introduction to Graphs.
Quantum Computing BCS Belgium Branch.
Limits and Horizon of Computing Post silicon computing.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Quantum Computing Basic Concepts and Applications.
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
Facts about quantum computation & speculation about the human brain Tim Hugo Taminiau Kavli Institute of Nanoscience, Delft University Quantum superposition.
Quantum Computing Paola Cappellaro
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.
Build Your Own Quantum Computer for Fun and Profit!
Wednesday, October 31 Ford Final Chapter (10). Agenda Announce: –Test Wednesday –Office Hours probably busy…better book appt. –Read Chs. 1-3 of Vilekin.
Nawaf M Albadia
Quantum Mechanics(14/2) Hongki Lee BIOPHOTONICS ENGINEERING LABORATORY School of Electrical and Electronic Engineering, Yonsei University Quantum Computing.
Introduction to Quantum Computing
Quantum Computing Michael Larson. The Quantum Computer Quantum computers, like all computers, are machines that perform calculations upon data. Quantum.
Discrete optimisation problems on an adiabatic quantum computer
Basic Q.C. One moose, two moose Red moose, blue moose Live moose, dead moose.
As if computers weren’t fast enough already…
Quantum Computing: An Introduction Khalid Muhammad 1 History of Quantum Computing Bits and Qubits Problems with the Quantum Machine.
Quantum Cryptography and Quantum Computing. Cryptography is about a)manipulating information b)transmitting information c)storing information.
Quantum Computing Charles Bloomquist CS147 Fall 2009.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Computation on Graphs. Graphs and Sparse Matrices Sparse matrix is a representation of.
Norman Littlejohn COSC480.  Quantum Computing  History  How it works  Usage.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Quantum Computers TAUKI TAHMID BRAC UNIVERSITY ID:
Prabhas Chongstitvatana Chulalongkorn University
Graph Representations
Quantum Circuit Visualization
the illusion of the Heisenberg scaling
Robert Spekkens DAMTP, Cambridge
Approximating Euler Paths
Lesson 10-9 Pages Reflections.
Quantum Computers Superposition Interference Entanglement and Quantum Error Correction Lesson 1 By: Professor Lili Saghafi
Limits and Horizon of Computing
Quantum Computing: an introduction
Operating Systems for Quantum Computing
GreedyMaxCut a b w c d e 1.
Lev Vaidman 23 August 2004, Cambridge Zion Mitrani Amir Kalev
Quantum Computing and the Quest for Quantum Computational Supremacy
Quantum Computing Prabhas Chongstitvatana Faculty of Engineering
CS 584 Project Write up Poster session for final Due on day of final
COT 6200 Quantum Computing Fall 2010
Graphs G = (V, E) V are the vertices; E are the edges.
GRAPHS G=<V,E> Adjacent vertices Undirected graph
For Friday Read chapter 9, sections 2-3 No homework
Presentation transcript:

Embedding Logical Qubits into the D-Wave Hardware Graph Keith Britt February 26 th, 2014

Agenda A Little Bit About Quantum Computing A Little Bit About D-Wave The D-Wave Hardware Transforming the Hardware into a Graph Embedding Literature “Review” Embedding Limits Example Embedding(s) Homework Problems

Quantum Computing In the Quantum World, classical physics give way to 2 phenomena: – Superposition – Entanglement We can use these phenomena to massively parallelize computation and also do some crazy stuff that is otherwise impossible (truly random numbers, data teleportation, etc.)

Quantum Computing

D-Wave Canadian Company Founded by Physicists and Material Scientists Created a Quantum Chip Using Adiabatic Model Running at Extremely Cold Temperatures and Minimal Interference Very Controversial… Is the Computer Really Quantum? Is It Worth It? – Simulations Beat It – Classical Adiabatic Computer Matched It

Ising Model

D-Wave Hardware

So is Hardware Just a Line Graph? Not Valid

Unit Cell Graph Representation Each Qubit Becomes a Vertex Each Coupler Becomes an Edge Between Vertices Valid

Ising Model Edge Weights Vertex Weights

Linking Unit Cells

Not Valid

Linking Unit Cells Valid

512 Vertices (Qubits) 16 Intra Unit Cell Edges per Unit Cell 8 – 16 Inter Unit Cell Edges per Unit Cell

Literature Review Choi, Vicky. Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem. Quantum Information Processing, 7, pp 193 – 209, arXiv: v1 [quant-ph]. Choi, Vicky. Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design. Quantum Information Processing: Volume 10, Issue 3 (2011), Page 343. arXiv: v2 [quant-ph]. Klymko, C., Sullivan, B., Humble, T. Adiabatic quantum programming: minor embedding with hard faults. Quantum Information Processing: Volume 13, Issue 3 (2014), pp 709 – 729. arXiv: v2 [quant-ph].

D-Wave Embedding Limits

Logical to Physical A Logical Qubit can be Spread Over Multiple Physical Qubits as Long as There is a Common Path Between All The Physical Qubits NOT VALID VALID

Something We’re Not Going Over Edge Weights Vertex Weights

An Example

Homework Questions

Embed the Peterson Graph into the D-Wave Hardware Graph (Diamond Isomorphism) in 6 or Fewer Unit Cells.