Taming Quantum Time Complexity

Watch a conference talk from TQC 2024 exploring advanced concepts in quantum time complexity theory. Learn how researchers achieve both exactness and thriftiness in quantum time complexity through novel approaches using transducers. Discover how quantum query algorithms can be composed without incurring log factors, and understand the implementation of quantum subroutine composition that eliminates the need for error reduction. Explore the relationship between quantum query complexity and time complexity, including the mathematical expression Q(f∘g)=O(Q(f)⋅Q(g)). Gain insights into transducers as a direct generalization of quantum algorithms, their characterization of state conversion, and their application in quantum walks. Presented by Aleksandrs Belovs, Stacey Jeffery, and Duyal Yolcu at the 19th Conference on the Theory of Quantum Computation, Communication and Cryptography, this 27-minute presentation advances theoretical quantum information science through innovative algorithmic approaches.