Download presentation

Presentation is loading. Please wait.

Published byDestiny Glasper Modified over 2 years ago

1
Embedding Logical Qubits into the D-Wave Hardware Graph Keith Britt keithbritt@utk.edu February 26 th, 2014

4
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

5
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.)

6
Quantum Computing

7
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

8
Ising Model http://dwave.files.wordpress.com/2010/12/weightedmaxsat_v2.pdf

9
D-Wave Hardware http://dwave.wordpress.com/2011/12/01/vesuvius-a-closer-look-512-qubit-processor-gallery/

10
So is Hardware Just a Line Graph? Not Valid

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

12
Ising Model http://dwave.files.wordpress.com/2010/12/weightedmaxsat_v2.pdf Edge Weights Vertex Weights

13
Linking Unit Cells

14
Not Valid

15
Linking Unit Cells Valid

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

18
Literature Review Choi, Vicky. Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem. Quantum Information Processing, 7, pp 193 – 209, 2008. arXiv:0804.4884v1 [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:1001.3116v2 [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:1210.8395v2 [quant-ph].

19
D-Wave Embedding Limits

20
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

21
Something We’re Not Going Over Edge Weights Vertex Weights

22
An Example

23
http://arxiv.org/pdf/1001.3116v2.pdf

29
Homework Questions

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

Similar presentations

OK

Graph Algorithms: Minimum Spanning Tree 1 2 3 4 6 5 10 1 5 4 3 2 6 1 1 8 We are given a weighted, undirected graph G = (V, E), with weight function w:

Graph Algorithms: Minimum Spanning Tree 1 2 3 4 6 5 10 1 5 4 3 2 6 1 1 8 We are given a weighted, undirected graph G = (V, E), with weight function w:

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on cse related topics Ppt on teamviewer 6 Ppt on conservation of natural resources Ppt on disaster management in hindi Ppt on network switching system Doc convert to ppt online ticket Ppt on water pollution in delhi Ppt on water activity test Ppt on famous indian entrepreneurs in usa Ppt on power generation by speed breaker sign