Quantum algorithm comparison

This compares a few key algorithms

1. Variational Quantum Eigensolver
   1. Allows us to find ground state for an Hamiltonian $\mathcal{H}$
   2. Works for parameterised Hamiltonians
2. Quantum Annealing
   1. Requires us to convert hte initial problem into a “spin” version, such that we can use an Ising Model and it’s Hamiltonian.
3. Grover’s Algorithm
   1. It only works if we can implement the oracle as a quantum circuit, $f(v)=1_{v=v_0}$
4. Phase estimation
   1. Often used in interferometers to obtain the relative phase of a qubit.