Hamilton Cycles

'Hamilton Cycles' refers to a combinatorial optimization problem involving the determination of a cycle in a graph that visits each vertex exactly once, and it is used to evaluate the effectiveness of algorithms like QAOA and Quantum Annealing in solving such optimization challenges.

Papers using Hamilton Cycles (2)

Reducing QAOA Circuit Depth by Factoring out Semi-Symmetries2024Reducing QUBO Density by Factoring Out Semi-Symmetries2024