The Short-path Algorithm for Combinatorial Optimization

Matthew Hastings, Microsoft Research
Challenges in Quantum Computation

[AhmedAbdelrahmanAtbara]

Your title kinda confusing me, all what I learned is the 'speed up' of Grover algorithm with some special assumption (i.e., the excited state Hamiltonian Hs). He call it a 'short-path' !! Also noticed audience got lost when he explained the perturbation theory part for this 'speed up' to work, it was kinda straight forward, don't you guys have a coffee machine? :). Last thing, I feel like this will need very large number of qubits, because of that term <Xi|(x/N)|Xi>^k, which has to be very large! Cool talk!