Is there any rigorous proof that Quantum Annealing (QA) is of any benefit (e.g. in terms of time to optimal solution, convergence rate, etc.) for a specific problem? Or any empirical evidence for the same?
I can find QUBO-based QA implementation for basically every computational problem from all of the major complexity classes, but what I can’t find is any scientifically reliable and peer-reviewed publication where state-of-the-art classical algorithms are outperformed (theoretically or empirically).
Is this due to me or is there simply none?