  In this paper we propose a R-step approximation to solve frequent itemset
mining on quantum hardware like quantum annealing or QAOA. The idea is to
search for the set of items where the minimal 2-item frequency is maximal. This
can be represented as a maximum clique problem.
