New answers tagged


There is a fully solvable model of quantum annealing with arbitrary target spin Hamiltonian: It shows that generally the computation time depends on the number of qubits exponentially. However, it can be considerably smaller for specially structured spin Hamiltonians, for example, when the ground state is degenerate.

Top 50 recent answers are included