Improved Algorithm and Lower Bound for Variable Time Quantum Search
Squid: Schools for Quantum Information Development via YouTube
Overview
Watch a 24-minute conference talk from TQC 2023 (Theory of Quantum Computation, Communication and Cryptography Conference) where Martins Kokainis presents groundbreaking research on variable time quantum search algorithms. Learn about a novel quantum algorithm that achieves O(√T log n) complexity for variable time search, where different items require varying query times. Explore both the improved algorithm and a quantum lower bound of Ω(√T log T), which enhance previous results by a factor of √log T while offering a simpler implementation. Delivered at the University of Aveiro during the 18th TQC conference, this presentation delves into theoretical quantum information science and is based on research available on arXiv (2302.06749).
Syllabus
Improved Algorithm and Lower Bound for Variable Time Quantum Search - Martins Kokainis | TQC 2023
Taught by
Squid: Schools for Quantum Information Development