Required sampling budget for complete maximum-weight-clique enumeration

Determine how many repeated measurements, or shots, are required for a sampling-based quantum approach to recover all maximum-weight cliques of a graph, particularly when the optimum solutions are not sampled with equal probability.

Background

The paper formulates maximum-weight-clique enumeration as maximum-weight-independent-set enumeration on the complement graph and uses QAOA measurements to sample candidate bit strings. Because the desired output is the complete set of optimal solutions rather than a single optimum, repeated circuit measurements are required to observe distinct maximum-weight cliques.

The authors note that if every maximum-weight clique were sampled with equal probability, the problem would reduce to the Coupon Collection Problem, with an expected sample count of order N log N for N optima. However, the actual sampling distribution of quantum or heuristic procedures may be highly nonuniform, leaving the required number of shots for complete recovery unresolved.

References

An important question of this approach is how many shots are required to find all of these cliques?

— Lossless Reductions and Hybrid Sampling for Phylogeny Using the Maximum Compatibility Criterion  (2610.18029 - Ye et al., 13 Oct 2026) in Section 4, Quantum Formulation, paragraph discussing QAOA shots and the Coupon Collection Problem