Quantum Algorithms, Quantum Computing.
Gilyén et al. were able to demonstrate a sub-exponential speedup for a stoquastic AQC algorithm that searches an undirected graph with vertices labeled by n-bit strings to find a specific “Exit” vertex given the “Entrance” vertex. That’s a significant achievement, but Aharonov notes that it comes