  Gaitan and Clark [Phys. Rev. Lett. 108, 010501 (2012)] have recently
presented a quantum algorithm for the computation of the Ramsey numbers R(m, n)
using adiabatic quantum evolution. We consider that the two-color Ramsey
numbers R(m, n; r) for r-uniform hypergraphs can be computed by using the
similar ways in [Phys. Rev. Lett. 108, 010501 (2012)]. In this comment, we show
how the computation of R(m, n; r) can be mapped to a combinatorial optimization
problem whose solution be found using adiabatic quantum evolution.
