Speaker
Description
The design of new quantum algorithms remains an unintuitive and elusive area that has lagged behind the rest of the developments of quantum computing. Despite decades of research, we have developed very few quantum techniques, in part due to the lack of a unifying framework to aid our understanding of existing ones and to facilitate the design of new ones. A promising route, particularly beneficial for quantum search algorithms, such as Grover's, is optimisation on Riemannian manifolds. Studying optimisation flows on the unitary manifold has recently been established to be directly linked to Grover's algorithm, providing key insights into its quadratic speed-up relative to its classical counterpart. During my talk, I will show how this link arises and present the direction of current work.
