Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Learn about cutting-edge quantum algorithm research in this 20-minute conference talk that presents novel theoretical results for the Hamiltonian locality testing problem. Explore how to determine whether a Hamiltonian is close to being k-local or far from any k-local Hamiltonian using minimal evolution time, with authors John Kallaugher and Daniel Liang presenting the tightest known bounds for this computational challenge. Discover their algorithm that achieves an O(√(ε₂/(ε₂-ε₁)⁵)) evolution time upper bound without requiring reverse time evolution or controlled application of the time evolution operator, along with a matching Ω(1/(ε₂-ε₁)) lower bound. Understand how the inclusion of reverse time evolution leads to a tight matching O(1/(ε₂-ε₁)) evolution time algorithm, advancing the theoretical foundations of quantum Hamiltonian analysis. Gain insights into sophisticated quantum computational techniques including Trotterized postselection methods and their applications in quantum machine learning contexts, as presented at the prestigious Quantum Techniques in Machine Learning (QTML) 2025 conference in Singapore.
