Join us to learn more about quantum algorithms.
We will go over how quantum states are modeled for computation and explain a specific algorithm as an example (Grover) that allows search in list in sqrt(N) worst case (impossible in classical computer)
6:00pm: Doors open
6:00pm - 6:30pm: Pizza, Drinks and Networking
6:30pm - 7:45pm: Idan Zalzberg, VP Data Engineering at Agoda
7:45pm - 8:30pm: Additional Q&A & Networking