Optimizing Hamiltonian Cycle Searching using Quantum Approximation Optimization Algorithms
By Michael
Hamiltonian cycles are a cycle in a graph where each vertex is visited only once. Similar to the travelling salesman problem, the aim of finding hamiltonian cycles is to reduce the number of edges traversed while still visiting every vertex. As the graph size gets bigger, it becomes exponentially more difficult to find a cycle. Using Quantum Approximation Optimization Algorithms (QAOA), it becomes possible to turn a single hamiltonian cycle to two smaller problems, with the potential to beat the speed of classical algorithms.