Runtime complexity of optimization algorithms on D-wave Quantum Annealer

Consider a classical algorithm which has O(n^2) time complexity for problem statement X. If we can solve the same problem(X) using D-wave QPU , then how to calculate the time complexity for this method?



1 comment

Please sign in to leave a comment.

Didn't find what you were looking for?

New post