A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles

Yimin Ge, Vedran Dunjko

Recent works have shown that quantum computers can polynomially speed up certain SAT-solving algorithms even when the number of available qubits is significantly smaller than the n…