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.

翻译：在本文中,我们提出一个R步近似值,以解决量子射线或QAOA等量子硬件上经常的物品集开采问题。 其想法是搜索最小的2项频率为最大频度的一组物品。 这可以被描述为最大密类问题 。