a tale of quantum computers
play

A tale of quantum computers Alexandru Gheorghiu - PowerPoint PPT Presentation

A tale of quantum computers Alexandru Gheorghiu gheorghiuandru@gmail.com The University of Edinburgh I V N E U R S E I H T Y T O H F G R E U D B I N A long time ago in a galaxy not so far away... Quantum Mechanics


  1. State of the art • 2001 Shor’s algorithm factors 15 on 7 qubits • 2011 Shor’s algorithm factors 21 • 2012 Universal quantum computation on 2 fault tolerant qubits

  2. State of the art • 2001 Shor’s algorithm factors 15 on 7 qubits • 2011 Shor’s algorithm factors 21 • 2012 Universal quantum computation on 2 fault tolerant qubits • 2014-2015 Qubits and gates in silicon chips

  3. State of the art • 2001 Shor’s algorithm factors 15 on 7 qubits • 2011 Shor’s algorithm factors 21 • 2012 Universal quantum computation on 2 fault tolerant qubits • 2014-2015 Qubits and gates in silicon chips • 2015 D-Wave 2X, 1000 qubits, optimization problems, no fault tolerance

  4. State of the art • 2001 Shor’s algorithm factors 15 on 7 qubits • 2011 Shor’s algorithm factors 21 • 2012 Universal quantum computation on 2 fault tolerant qubits • 2014-2015 Qubits and gates in silicon chips • 2015 D-Wave 2X, 1000 qubits, optimization problems, no fault tolerance • 2020 NQIT, Q20:20, fault tolerant (20 qubits), scalable

  5. State of the art • 2001 Shor’s algorithm factors 15 on 7 qubits • 2011 Shor’s algorithm factors 21 • 2012 Universal quantum computation on 2 fault tolerant qubits • 2014-2015 Qubits and gates in silicon chips • 2015 D-Wave 2X, 1000 qubits, optimization problems, no fault tolerance • 2020 NQIT, Q20:20, fault tolerant (20 qubits), scalable • And others...

  6. Towards quantum secure cryptography

  7. Towards quantum secure cryptography Will quantum computers pose a threat to cryptography?

  8. Towards quantum secure cryptography Will quantum computers pose a threat to cryptography? Existing crypto based on unproven hard problems (factoring, discrete log etc)

  9. Towards quantum secure cryptography Will quantum computers pose a threat to cryptography? Existing crypto based on unproven hard problems (factoring, discrete log etc) How long do you want your data to stay secure? ( ∼ 20 years)

  10. Towards quantum secure cryptography Will quantum computers pose a threat to cryptography? Existing crypto based on unproven hard problems (factoring, discrete log etc) How long do you want your data to stay secure? ( ∼ 20 years) How long to make the Internet quantum secure? ( ∼ 20 years)

  11. Towards quantum secure cryptography Will quantum computers pose a threat to cryptography? Existing crypto based on unproven hard problems (factoring, discrete log etc) How long do you want your data to stay secure? ( ∼ 20 years) How long to make the Internet quantum secure? ( ∼ 20 years) What about problems that are hard for quantum computers?

  12. Towards quantum secure cryptography Will quantum computers pose a threat to cryptography? Existing crypto based on unproven hard problems (factoring, discrete log etc) How long do you want your data to stay secure? ( ∼ 20 years) How long to make the Internet quantum secure? ( ∼ 20 years) What about problems that are hard for quantum computers? “ Even if a classical protocol is proven secure based on the hardness of some problem, and that problem is hard even for quantum computers, we have no guarantee that the protocol is secure against quantum computers. ” Dominique Unruh

  13. Quantum Cryptography

  14. Quantum Cryptography • Idea: do not base security on computational problems, but on the laws of physics

  15. Quantum Cryptography • Idea: do not base security on computational problems, but on the laws of physics • Assuming quantum mechanics is correct, unconditional security

  16. Quantum Cryptography • Idea: do not base security on computational problems, but on the laws of physics • Assuming quantum mechanics is correct, unconditional security • Adversary with unlimited power cannot break the encryption

  17. Quantum Cryptography • Idea: do not base security on computational problems, but on the laws of physics • Assuming quantum mechanics is correct, unconditional security • Adversary with unlimited power cannot break the encryption • First development: quantum money scheme

  18. Quantum Cryptography • Idea: do not base security on computational problems, but on the laws of physics • Assuming quantum mechanics is correct, unconditional security • Adversary with unlimited power cannot break the encryption • First development: quantum money scheme • Quantum key distribution

  19. Quantum Cryptography • Idea: do not base security on computational problems, but on the laws of physics • Assuming quantum mechanics is correct, unconditional security • Adversary with unlimited power cannot break the encryption • First development: quantum money scheme • Quantum key distribution • Uses one-time pad

  20. One-time pad

  21. One-time pad M 1

  22. One-time pad ⊕ M 1 Key

  23. One-time pad ⊕ = M 1 Key C 1

  24. One-time pad ⊕ = M 1 Key C 1 C 1 ⊕ Key = M 1

  25. One-time pad

  26. One-time pad M 2 ⊕ Key = C 2

  27. One-time pad M 2 ⊕ Key = C 2 ⊕ = M 1 ⊕ M 2 C 1 C 2

  28. Quantum Key Distribution (QKD)

  29. Quantum Key Distribution (QKD) Make two parties share a random secret key

  30. Quantum Key Distribution (QKD) Make two parties share a random secret key Arbitrary size key → arbitrary number of messages

  31. Quantum Key Distribution (QKD) Make two parties share a random secret key Arbitrary size key → arbitrary number of messages Communication bandwidth limited by key rate

  32. Quantum Key Distribution (QKD) Make two parties share a random secret key Arbitrary size key → arbitrary number of messages Communication bandwidth limited by key rate • BB84

  33. Quantum Key Distribution (QKD) Make two parties share a random secret key Arbitrary size key → arbitrary number of messages Communication bandwidth limited by key rate • BB84 • Uncertainty principle

  34. Quantum Key Distribution (QKD) Make two parties share a random secret key Arbitrary size key → arbitrary number of messages Communication bandwidth limited by key rate • BB84 • Uncertainty principle • No cloning

  35. Quantum Key Distribution (QKD) Make two parties share a random secret key Arbitrary size key → arbitrary number of messages Communication bandwidth limited by key rate • BB84 • Uncertainty principle • No cloning • Unconditional security (based on QM)

  36. Quantum Key Distribution (QKD)

  37. Quantum Key Distribution (QKD) What about exploiting the implementation?

  38. Quantum Key Distribution (QKD) What about exploiting the implementation? Not a problem!

Recommend


More recommend