Quantum LeetCode
Abstract:
The popular LeetCode website features thousands of programming puzzles to prepare candidates for software engineering interviews. While a candidate is expected to be able to type out an optimal solution to one of these puzzles in half an hour, for many of them the best algorithm on a quantum computer remains an open problem.
In this talk we will discuss optimal quantum algorithms for two LeetCode problems, The Best Time To Buy and Sell Stock (Problem #121) and Longest Substring Without Repeating Characters (Problem #3). The talk will not assume a background in quantum algorithms; in both cases the algorithms can be described as classical divide and conquer algorithms that use quantum subroutines for things like search or maximisation as a black box.
Bio:
Troy Lee is an associate professor at the University of Technology Sydney where he works on classical and quantum algorithms. Troy earned his PhD at the University of Amsterdam, after which he pursued postdoctoral research at Paris Orsay, Rutgers University, Columbia University, and the Centre for Quantum Technologies in Singapore. He was awarded a Singapore National Research Fellowship in 2013 and became an Associate Professor at Nanyang Technological University, before moving to Australia in 2018.