(#010) Quantum Walks and its Applications - Subhasree Patro
Date & Time: 24-10-2020, 22:15 IST
Abstract
We will first discuss the basic quantum walk algorithm and we will see how, in the query complexity model, quantum walks can be applied to achieve better than classical query algorithms for the Element Distinctness problem and (if time permits) the Triangle Finding problem.
Prerequisites
Basics of Quantum Computing, Grover’s algorithm, Query complexity.
Resources
Reference: Chapter 8 of Ronald de Wolf’s lecture notes
About the Speaker
Subhasree Patro is a PhD student at the Algorithms and Complexity Group at CWI, Amsterdam and QuSoft. She currently works on Conditional Quantum Time Lower Bounds under the guidance of Harry Buhrman. She has made impactful contributions to the field, including her recent paper titled The Quantum Strong Exponential-Time Hypothesis. She had previously done her masters at IIIT-H on Quantum Information Theory.