distributed quantum computing
play

Distributed Quantum Computing Using the most precise description of - PowerPoint PPT Presentation

Distributed Quantum Computing Using the most precise description of our world to solve some of the hardest problems by Matthias Egli Based on the paper Distributed Quantum Computing by Harry Buhrman and Hein Rhrig These slides are just


  1. Distributed Quantum Computing Using the most precise description of our world to solve some of the hardest problems by Matthias Egli Based on the paper „Distributed Quantum Computing“ by Harry Buhrman and Hein Röhrig

  2. These slides are just an addition to the math shown on the blackboard

  3. Motivation

  4. Communication Complexity n Alice Bob

  5. Communication Complexity ? Alice Bob

  6. Communication Complexity Classical Computer Quantum Computer Disjointness n Equality (Promise) n log(n)

  7. Speedup with Quantum Computers Classical Computer Quantum Computer Factorization Search n Deutsch-Jozsa n 1

  8. The qubit Superposition Quantum Gate Entanglement Basics

  9. Deutsch-Josza Algorithm Promise: Function is constant or balanced

  10. Deutsch-Josza Algorithm n Classcial Computer Classical randomized Quantum Computer 2 2 1 1 n n Log(n) 1

  11. Communication

  12. Communication Qubit Alice Bob

  13. Communication Entanglement Communication Types

  14. Communication Classical bits with EPR Pairs Alice Bob

  15. Communication Qubit with shared EPR Pairs Alice Bob Communication Types

  16. Deutsch-Jozsa Communication

  17. Alice Bob X: 00101100 Y: 00101100 Deutsch-Josza Communication

  18. Alice Bob X = Y ? Y: 00101100 X: 00101100 Deutsch-Josza Communication

  19. n Alice Bob X = Y ? X: 00101100 Y: 00101100 Deutsch-Josza Communication

  20. ? Alice Bob X = Y ? X: 00101100 Y: 00101100 Deutsch-Josza Communication

  21. Alice Bob X = Y ? X: 00101100 Y: 00101100 Promise: Hamming Distance = n/2 or 0 Deutsch-Josza Communication

  22. XOR Alice Bob X = Y ? X: 00101100 Y: 00101100 Promise: Hamming Distance = n/2 or 0 Deutsch-Josza Communication

  23. Alice Bob X = Y ? X: 00101100 Y: 00101100 Promise: Hamming Distance = n/2 or 0 Deutsch-Josza Communication

  24. Alice

  25. Alice log(n)+1 Bob

  26. Bob

  27. Bob

  28. Bob Deutsch-Jozsa Algorithm

  29. What else is possible? • Leader Election • Disjointness • […]

  30. Sources Caltech Introduction to Quantum Computing • http://www.theory.caltech.edu/people/preskill/ph229/notes/chap1.pdf Distributed Quantum Computing • Harry Buhrmann and Hein Röhrig Can quantum mechanics help distributed computing? • Anne Broadbent and Alain Tapp Distributed Quantum Computing: A New Frontier in Distributed Systems • or Science Fiction? Vasil S. Denchev and Gopal Pandurangan

  31. Questions?

Recommend


More recommend