Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Quantum Computing and Engineering (QCE)

A QAOA-Based Heuristic to Hide Sensitive Itemsets

Abhijeet Ghoshal, Yan Li, Syam Menon, Sumit Sarkar

Published Aug 30, 2025• 0 citations
Publisher

Abstract

The benefits of sharing transactional data with upstream supply chain partners has been known for a long time. However, many retailers are still reluctant to share, and there is evidence that the extent of sharing would be greater if information sensitive to retailers is concealed before data are shared. In transactional data, sensitive information are typically frequent itemsets that can be hidden by deleting items belonging to the sensitive itemsets from transactions that support the itemsets. The problem of identifying the smallest set of transactions from which to delete items such that sensitive itemsets will be hidden can be formulated as a generalized set covering problem. Numerous classical approaches have been developed for solving this problem. We propose a new approach to solve this optimization problem using QAOA. In our preliminary experiments, we find optimal solutions for small problems (that use up to 32 qubits) by using simulators and real quantum computers even when we use only one layer of QAOA. Identifying properties of the optimization problem should further help in faster convergence towards the optimal solutions of the optimization problem.

DOI
10.1109/qce65121.2025.00252

Related papers

Quantum Approaches to Hide Sensitive Itemsets: Domain-Inspired Warm Start

Abhijeet Ghoshal, Yan Li, Syam Menon +1 more

Sharing transactional data with upstream supply-chain partners has long been recognized as beneficial to all involved. Yet many retailers remain reluctant to share for fear of divulging sensitive information. Evidence suggests that more retailers would be willing to share if retailer-sensitive information is concealed prior to sharing. In transactional data, such sensitive information often takes the form of frequent itemsets (referred to as sensitive itemsets). Hiding is usually accomplished by removing appropriate items from selected transactions that support (contain) the sensitive itemsets. One well-studied question in this domain involves the identification of the minimum number of transactions from which items need to be removed to consider all sensitive itemsets hidden. This can be formulated as a generalized set covering problem and is known to be NP-hard. We propose a QAOA-based quantum algorithm to solve the sensitive itemset hiding problem. As QAOA targets quadratic unconstrained binary optimization (QUBO) problems, we first show how to convert our constrained formulation into an Ising representation that resembles a QUBO problem. We then exploit the polyhierarchical structure inherent in our problem to warm-start QAOA through biased superposition coupled with a new mixer as an alternative to uniform superposition. We further derive closed-form expressions for the weights of the terms in the Ising formulation; these can be coded directly, thereby saving substantial computational effort. We demonstrate the effectiveness of our heuristic through a series of experiments. We examine thirty-five problem instances and conduct twenty-five runs with different starting parameter values for each problem instance. At least two of the twenty-five runs for every problem instance result in the optimal solution when uniform superposition is used. The corresponding number for biased superposition is at least nine runs. Our findings demonstrate that quantum computers in general, and QAOA in particular, can be effectively applied to a long-studied problem in data privacy.

arXiv:2402.08055•IEEE Transactions on Quantum Engineering•Jan 1, 2026•0 citations

Quantum-Enhanced Blockchain for Optimized Supply Chain Management: Leveraging Qaoa and Secure Transaction Protocols

L. Sherin Beevi, Ponsy R. K. Sathia Bhama, P. M. Joe Prathap +1 more

A quantum-enabled blockchain architecture for secure and efficient supply chain management is created by combining quantum optimization, decentralized transaction control, and post-quantum security enforcement. Supply chain decision factors such as supplier allocation, routing optimization, and inventory coordination are framed as combinatorial optimization problems and solved using the Quantum Approximate Optimization Algorithm. The optimum decision outputs are carried out via blockchain-based smart contracts, which enable automatic validation, transparent processing, and immutable transaction storage. A quantum-resistant security layer allows for safe authentication, encrypted communication, and attackresistant transaction verification against both classical and quantum adversaries. A multi-tier simulated supply chain environment is used to evaluate system performance, which includes measures such as latency, throughput, optimization accuracy, security resilience, and operational cost. When compared to traditional supply chain and blockchain-based implementations, the results show faster convergence, lower transaction latency, more security, and greater transparency. The findings support the efficacy of combining quantum optimization, decentralized ledgers, and quantum-resilient encryption for next-generation intelligent supply chains.

International Conference on Air Defense and Security (ICADS)•Feb 12, 2026•1 citation

Frequent Itemset Mining using QUBO

Jonas Nüßlein

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.

arXiv:1904.07693•Apr 16, 2019•1 citation

Quantum algorithm for association rules mining

Chao‐Hua Yu, Fei Gao, Qing-Le Wang +1 more

Association rules mining (ARM) is one of the most important problems in knowledge discovery and data mining. Given a transaction database that has a large number of transactions and items, the task of ARM is to acquire consumption habits of customers by discovering the relationships between itemsets (sets of items). In this paper, we address ARM in the quantum settings and propose a quantum algorithm for the key part of ARM, finding frequent itemsets from the candidate itemsets and acquiring their supports. Specifically, for the case in which there are ${M}_{f}^{(k)}$ frequent $k$-itemsets in the ${M}_{c}^{(k)}$ candidate $k$-itemsets (${M}_{f}^{(k)}\ensuremath{\le}{M}_{c}^{(k)}$), our algorithm can efficiently mine these frequent $k$-itemsets and estimate their supports by using parallel amplitude estimation and amplitude amplification with complexity $O(\frac{k\sqrt{{M}_{c}^{(k)}{M}_{f}^{(k)}}}{\ensuremath{\epsilon}})$, where $\ensuremath{\epsilon}$ is the error for estimating the supports. Compared with the classical counterpart, i.e., the classical sampling-based algorithm, whose complexity is $O(\frac{k{M}_{c}^{(k)}}{{\ensuremath{\epsilon}}^{2}})$, our quantum algorithm quadratically improves the dependence on both $\ensuremath{\epsilon}$ and ${M}_{c}^{(k)}$ in the best case when ${M}_{f}^{(k)}\ensuremath{\ll}{M}_{c}^{(k)}$ and on $\ensuremath{\epsilon}$ alone in the worst case when ${M}_{f}^{(k)}\ensuremath{\approx}{M}_{c}^{(k)}$.

arXiv:1512.02420•Physical Review A•Oct 7, 2016•78 citations

Most Frequent Itemset Optimization.

Jonas Nüßlein

In this paper we are dealing with the frequent itemset mining. We concentrate on the special case that we only want to identify the most frequent itemset of length N. To do that, we present a pattern on how to consider this search as an optimization problem. First, we extract the frequency of all possible 2-item-sets. Then the optimization problem is to find the N objects, for which the minimal frequency of all containing 2-item-sets is maximal. This combinatorial optimization problem can be solved by any optimization algorithm. We will solve them with Quantum Annealing and QUBO with QbSolv by D-Wave. The advantages of MFIO in comparison to the state-of-the-art-approach are the enormous reduction of time need, reduction of memory need and the omission of a threshold. The disadvantage is that there is no guaranty for accuracy of the result. The evaluation indicates good results.

•Apr 16, 2019•1 citation

Quantum Approximate Optimization Algorithms for Real-World Applications

Erik Lindberg, Ivan Lindberg

The Quantum Approximate Optimisation Algorithm (QAOA) has emerged as a leading candidate for near-term quantum advantage in combinatorial optimisation, but most evaluations remain confined to synthetic benchmarks such as random MaxCut instances. Translating QAOA to real-world problem instances -- with irregular graph structures, heterogeneous constraint types, and practical scale requirements -- introduces additional challenges including QUBO formulation overhead, hardware embedding costs, and the performance gap between QAOA on structured real instances vs. random benchmarks. This paper presents the Real-World QAOA (RW-QAOA) framework, a systematic methodology for applying QAOA to four real-world application domains: supply chain network optimisation, financial portfolio rebalancing, telecommunications frequency assignment, and traffic signal timing optimisation. RW-QAOA introduces three methodological contributions: a domain-adaptive QUBO formulator (DAQF) encoding real-world constraints as penalised QUBO terms with penalty coefficient auto-tuning; a warm-start initialisation strategy (WSIS) using classical heuristic solutions to seed QAOA parameter search; and a layered noise adaptation protocol (LNAP) adjusting circuit depth based on real-time device calibration data. RW-QAOA is evaluated on real problem instances from industry partners across all four domains on IBM Quantum Eagle (127-qubit). RW-QAOA achieves solution quality within 4.2% of classical exact solvers across all four domains, outperforming classical greedy heuristics by 12.4% (SD = 3.8%) on average. WSIS reduces QAOA parameter convergence iterations by 48.4%. LNAP improves approximation ratio by 8.4pp vs. fixed-depth QAOA under device noise variation.

Quantum Frontiers Journal•Mar 28, 2024•0 citations
The benefits of sharing transactional data with upstream supply chain partners has been known for a long time. However, many retailers are still reluctant to share, and there is evidence that the extent of sharing would be greater if information sensitive to retailers is concealed before data are shared. In transactional data, sensitive information are typically frequent itemsets that can be hidden by deleting items belonging to the sensitive itemsets from transactions that support the itemsets. The problem of identifying the smallest set of transactions from which to delete items such that sensitive itemsets will be hidden can be formulated as a generalized set covering problem. Numerous classical approaches have been developed for solving this problem. We propose a new approach to solve this optimization problem using QAOA. In our preliminary experiments, we find optimal solutions for small problems (that use up to 32 qubits) by using simulators and real quantum computers even when we use only one layer of QAOA. Identifying properties of the optimization problem should further help in faster convergence towards the optimal solutions of the optimization problem.
Sharing transactional data with upstream supply-chain partners has long been recognized as beneficial to all involved. Yet many retailers remain reluctant to share for fear of divulging sensitive information. Evidence suggests that more retailers would be willing to share if retailer-sensitive information is concealed prior to sharing. In transactional data, such sensitive information often takes the form of frequent itemsets (referred to as sensitive itemsets). Hiding is usually accomplished by removing appropriate items from selected transactions that support (contain) the sensitive itemsets. One well-studied question in this domain involves the identification of the minimum number of transactions from which items need to be removed to consider all sensitive itemsets hidden. This can be formulated as a generalized set covering problem and is known to be NP-hard. We propose a QAOA-based quantum algorithm to solve the sensitive itemset hiding problem. As QAOA targets quadratic unconstrained binary optimization (QUBO) problems, we first show how to convert our constrained formulation into an Ising representation that resembles a QUBO problem. We then exploit the polyhierarchical structure inherent in our problem to warm-start QAOA through biased superposition coupled with a new mixer as an alternative to uniform superposition. We further derive closed-form expressions for the weights of the terms in the Ising formulation; these can be coded directly, thereby saving substantial computational effort. We demonstrate the effectiveness of our heuristic through a series of experiments. We examine thirty-five problem instances and conduct twenty-five runs with different starting parameter values for each problem instance. At least two of the twenty-five runs for every problem instance result in the optimal solution when uniform superposition is used. The corresponding number for biased superposition is at least nine runs. Our findings demonstrate that quantum computers in general, and QAOA in particular, can be effectively applied to a long-studied problem in data privacy.
A quantum-enabled blockchain architecture for secure and efficient supply chain management is created by combining quantum optimization, decentralized transaction control, and post-quantum security enforcement. Supply chain decision factors such as supplier allocation, routing optimization, and inventory coordination are framed as combinatorial optimization problems and solved using the Quantum Approximate Optimization Algorithm. The optimum decision outputs are carried out via blockchain-based smart contracts, which enable automatic validation, transparent processing, and immutable transaction storage. A quantum-resistant security layer allows for safe authentication, encrypted communication, and attackresistant transaction verification against both classical and quantum adversaries. A multi-tier simulated supply chain environment is used to evaluate system performance, which includes measures such as latency, throughput, optimization accuracy, security resilience, and operational cost. When compared to traditional supply chain and blockchain-based implementations, the results show faster convergence, lower transaction latency, more security, and greater transparency. The findings support the efficacy of combining quantum optimization, decentralized ledgers, and quantum-resilient encryption for next-generation intelligent supply chains.
Association rules mining (ARM) is one of the most important problems in knowledge discovery and data mining. Given a transaction database that has a large number of transactions and items, the task of ARM is to acquire consumption habits of customers by discovering the relationships between itemsets (sets of items). In this paper, we address ARM in the quantum settings and propose a quantum algorithm for the key part of ARM, finding frequent itemsets from the candidate itemsets and acquiring their supports. Specifically, for the case in which there are Mf(k){M}_{f}^{(k)}Mf(k)​ frequent kkk-itemsets in the Mc(k){M}_{c}^{(k)}Mc(k)​ candidate kkk-itemsets (${M}_{f}^{(k)}\ensuremath{\le}{M}_{c}^{(k)}$), our algorithm can efficiently mine these frequent kkk-itemsets and estimate their supports by using parallel amplitude estimation and amplitude amplification with complexity $O(\frac{k\sqrt{{M}_{c}^{(k)}{M}_{f}^{(k)}}}{\ensuremath{\epsilon}})$, where $\ensuremath{\epsilon}$ is the error for estimating the supports. Compared with the classical counterpart, i.e., the classical sampling-based algorithm, whose complexity is $O(\frac{k{M}_{c}^{(k)}}{{\ensuremath{\epsilon}}^{2}})$, our quantum algorithm quadratically improves the dependence on both $\ensuremath{\epsilon}$ and Mc(k){M}_{c}^{(k)}Mc(k)​ in the best case when ${M}_{f}^{(k)}\ensuremath{\ll}{M}_{c}^{(k)}$ and on $\ensuremath{\epsilon}$ alone in the worst case when ${M}_{f}^{(k)}\ensuremath{\approx}{M}_{c}^{(k)}$.
In this paper we are dealing with the frequent itemset mining. We concentrate on the special case that we only want to identify the most frequent itemset of length N. To do that, we present a pattern on how to consider this search as an optimization problem. First, we extract the frequency of all possible 2-item-sets. Then the optimization problem is to find the N objects, for which the minimal frequency of all containing 2-item-sets is maximal. This combinatorial optimization problem can be solved by any optimization algorithm. We will solve them with Quantum Annealing and QUBO with QbSolv by D-Wave. The advantages of MFIO in comparison to the state-of-the-art-approach are the enormous reduction of time need, reduction of memory need and the omission of a threshold. The disadvantage is that there is no guaranty for accuracy of the result. The evaluation indicates good results.
The Quantum Approximate Optimisation Algorithm (QAOA) has emerged as a leading candidate for near-term quantum advantage in combinatorial optimisation, but most evaluations remain confined to synthetic benchmarks such as random MaxCut instances. Translating QAOA to real-world problem instances -- with irregular graph structures, heterogeneous constraint types, and practical scale requirements -- introduces additional challenges including QUBO formulation overhead, hardware embedding costs, and the performance gap between QAOA on structured real instances vs. random benchmarks. This paper presents the Real-World QAOA (RW-QAOA) framework, a systematic methodology for applying QAOA to four real-world application domains: supply chain network optimisation, financial portfolio rebalancing, telecommunications frequency assignment, and traffic signal timing optimisation. RW-QAOA introduces three methodological contributions: a domain-adaptive QUBO formulator (DAQF) encoding real-world constraints as penalised QUBO terms with penalty coefficient auto-tuning; a warm-start initialisation strategy (WSIS) using classical heuristic solutions to seed QAOA parameter search; and a layered noise adaptation protocol (LNAP) adjusting circuit depth based on real-time device calibration data. RW-QAOA is evaluated on real problem instances from industry partners across all four domains on IBM Quantum Eagle (127-qubit). RW-QAOA achieves solution quality within 4.2% of classical exact solvers across all four domains, outperforming classical greedy heuristics by 12.4% (SD = 3.8%) on average. WSIS reduces QAOA parameter convergence iterations by 48.4%. LNAP improves approximation ratio by 8.4pp vs. fixed-depth QAOA under device noise variation.