Technology
Frequent Itemset Mining with Quantum Computing
Key Points
Announce Type: new Abstract: Frequent Itemset Mining (FIM) is a foundational task in data analytics, but its candidate and conditional pattern spaces can grow rapidly, and maintaining support information becomes increasingly costly on dense datasets. These bottlenecks present a critical opportunity for quantum computing to redesign the way candidate representation and support verification are organized. Motivated by recent developments in quantum computing, we propose the...
arXiv:2606.09209v1 Announce Type: new
Abstract: Frequent Itemset Mining (FIM) is a foundational task in data analytics, but its candidate and conditional pattern spaces can grow rapidly, and maintaining support information becomes increasingly costly on dense datasets. These bottlenecks present a critical opportunity for quantum computing to redesign the way candidate representation and support verification are organized. Motivated by recent developments in quantum computing, we propose the \textit{QuantumFreqMine (QFM)} framework for FIM. QFM introduces three mechanisms: (1)~\textit{Bit-Vector Qubit Encoding}, (2)~\textit{Mining-Aware Candidate Superposition}, and (3)~\textit{Bit-Parallel Threshold Marking}. We provide a theoretical analysis in terms of time complexity, space comlexity, and logical resource usage. We implement QFM on IBM Qiskit and Amazon Braket. The experiments demonstrate that QFM outperforms representative baselines.