We consider a graph labeling problem, i.e., the cyclic bandwidth problem, and its formulation in QUBO, the input language for quantum computers based on quantum annealing. To this end, we first consider a constraint programming model based on table constraints and then we derive from this model the QUBO formulation and its penalty matrix. We also detail an analysis of this QUBO model in terms of number of qubits and their required inter-qubit connections in order to estimate the suitability of implementing such a solution on quantum annealers, i.e., the D-Wave Advantage system with a specific graph topology for qubit couplers.