Skip to main content
Quantum Computing

Return to Question

Became Hot Network Question
edited tags
Link
Martin Vesely
Martin Vesely
  • 14.9k
  • 4
  • 31
  • 73
added 65 characters in body
Source Link
Ethan Davies
Ethan Davies
  • 556
  • 1
  • 7

I'm trying to find out, if there is a simplified concept to understand what is occuring during quantum annealing/ Falqon/ Hamiltonian evolution like algorithms.

During classical gradient descent algorithms, one can imagine a marble that rolls along a surface downhill that will eventually end up in a local minima.

Is there a similar analogy to what is happening during Hamiltonian evolution. We start in a global minima of an initial Hamiltonian $H_0$, perturb the energy landscape by some amount and then wait for quantum tunnelling to occur and repeat until we reach the desired minimum of a different hamiltonian $H_1$?

I'm trying to find out, if there is a simplified concept to understand what is occuring during quantum annealing/ Falqon/ Hamiltonian evolution like algorithms.

During classical gradient descent algorithms, one can imagine a marble that rolls along a surface downhill that will eventually end up in a local minima.

Is there a similar analogy to what is happening during Hamiltonian evolution. We start in a global minima, perturb the energy landscape by some amount and then wait for quantum tunnelling to occur and repeat until we reach the desired minimum?

I'm trying to find out, if there is a simplified concept to understand what is occuring during quantum annealing/ Falqon/ Hamiltonian evolution like algorithms.

During classical gradient descent algorithms, one can imagine a marble that rolls along a surface downhill that will eventually end up in a local minima.

Is there a similar analogy to what is happening during Hamiltonian evolution. We start in a global minima of an initial Hamiltonian $H_0$, perturb the energy landscape by some amount and then wait for quantum tunnelling to occur and repeat until we reach the desired minimum of a different hamiltonian $H_1$?

Source Link
Ethan Davies
Ethan Davies
  • 556
  • 1
  • 7

Does optimization via Hamiltonian evolution have an analogy like gradient descent?

I'm trying to find out, if there is a simplified concept to understand what is occuring during quantum annealing/ Falqon/ Hamiltonian evolution like algorithms.

During classical gradient descent algorithms, one can imagine a marble that rolls along a surface downhill that will eventually end up in a local minima.

Is there a similar analogy to what is happening during Hamiltonian evolution. We start in a global minima, perturb the energy landscape by some amount and then wait for quantum tunnelling to occur and repeat until we reach the desired minimum?