Dr. Prasanna Date
  • Member for 1 year, 6 months
  • Last seen more than a month ago
What is the computational complexity of quantum annealing?
Accepted answer
3 votes

For a problem of size $N$, computational complexity of quantum annealing is $\mathcal{O}(e^{\sqrt{N}})$. This is better than simulated annealing, which has a complexity of $\mathcal{O}(e^{N})$. Both ...

View answer