Rolf huisman programming quantum computers in dot net using q#
- 2. Agenda
- 8. Internet Of Stuffed Animals (IOSA)
- 9. Living Room Attic Bedroom Stuffed animal problem
- 10. Living Room Attic Bedroom Stuffed animal problem
- 11. Living Room Attic Bedroom Stuffed animal problem
- 12. Living Room Attic Bedroom Stuffed animal problem
- 13. Living Room Attic Bedroom Stuffed animal problem
- 14. Living Room Attic Bedroom Stuffed animal problem Search Path Optimization
- 15. Same problem as other fields
- 17. Add more hardware Right ?
- 18. The power of exponents 2n*
- 19. And there are more fields that have this issue
- 20. New plan
- 21. New plan Qubit can take value |0>, |1>, or both at once, a phenomenon known as superposition
- 22. Speed
- 23. Speed
- 26. Pictures by Lars Plougmann / CC BY-SA 2.0
- 28. “Quantum Accelerator card” by Lars Plougmann / CC BY-SA 2.0
- 32. Quantum Computing Workflow Traditional Computer Quantum Circuit Measurements 11 10 01 00
- 33. Quantum Computing Workflow Traditional Computer Quantum Circuit Measurements 11 10 01 00 3 2
- 34. The Qubit in more detail
- 35. The Qubit in more detail Angle Θ
- 37. X Gate (Not)
- 39. One Qubit Gates
- 43. Multiple Qubit Gates |0> |0> |1> |0> |1> |1> |0> |1> |1> |0> |0> 50% |1> 50% Q1 Q2 |0> 100%
- 44. Multiple Qubit Gates |0> |0> |1> |0> |1> |1> |0> |1> |1> |0> |0> 50% |1> 50% Q1 Q2 |0> 100% Q1 |0> |1> Q2 |0> 50% 0% |1> 0% 50%
- 46. Microsoft Q#
- 47. Microsoft Q#
- 49. Grover (and other amplifications) Original Amplitudes Negate Amplitude Average of all Amplitudes Flip all Amplitudes around Avg Grover execution: informally 𝑠𝑡𝑎𝑡𝑒𝑠
- 50. Q# Functions
- 51. Reversing on the real device
- 52. Living Room Attic Bedroom Stuffed animal problem
- 53. Using the gates to describe Phys. Rev. A 95, 032323 – Published 22 March 2017
- 54. Oracle Function One Stair Two Stairs Oracle (State)
- 55. Many hours and code lines later Traditional Quantum Naive O(𝑛!) O( 𝑛!) With effort O(2n*2n) O(( 𝑛)!)
- 56. Living Room Attic Bedroom Stuffed animal solution
- 58. Conclusions
- 59. So be part of the quantum future ! Questions ?
- 62. Microsoft Q# (Emulated Run)
- 63. Microsoft Q# (Unit Test)
- 64. Microsoft Q# (VSTS Build)
- 65. Microsoft Q# (VSTS Test)
- 67. Production (Work in progress)
- 68. Production (Work in progress)
- 69. Bitcoin Mining 101 SHA 256 SHA 256 Data NONCE 00000000000101001001010010010101..
- 70. Bitcoin Mining 101 SHA 256 SHA 256 Data NONCE + 1 00000000000101001001010010010101..OOOOOOOOOOOOO
- 71. SHA 256 A B C D E F G H KT WT CH ∑1 E Maj A ∑2 A => B, C => D, F => G, G => H x64 32 bits
- 72. Reduced Adder A B 𝑋𝑜𝑟𝐴𝑛𝑑 Carry Sum x1 1 bit
- 73. Quantum Adder A B 𝑋𝑜𝑟𝐴𝑛𝑑 Carry Sum Waste
- 74. Quantum Adder
- 75. Adder Algorithm A B 𝑋𝑜𝑟𝐴𝑛𝑑 0 ? 0 ? Waste |0>
- 76. Inverted Adder Algorithm A B 𝑋𝑜𝑟𝐴𝑛𝑑 0 ? 0 ? Waste |0> |0> 𝑋𝑜𝑟𝐴𝑛𝑑 Super Position A B |0> Waste SHOR
- 77. Reverse Adder
- 78. Reverse Adder
- 79. Reverse Adder This is why you need to add Grover
- 80. SHA 256 A B C D E F G H KT WT CH ∑1 E Maj A ∑2 A => B, C => D, F => G, G => H x64 32 bits
- 81. Dirty Adder (Not Reduced)
- 82. Tolifo Gate