[2204.13802] BILP-Q: Quantum Coalition Structure Generation
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Quantum Physics

arXiv:2204.13802 (quant-ph)
[Submitted on 28 Apr 2022]

Title:BILP-Q: Quantum Coalition Structure Generation

Authors:Supreeth Mysore Venkatesh, Antonio Macaluso, Matthias Klusch
View PDF
Abstract:Quantum AI is an emerging field that uses quantum computing to solve typical complex problems in AI. In this work, we propose BILP-Q, the first-ever general quantum approach for solving the Coalition Structure Generation problem (CSGP), which is notably NP-hard. In particular, we reformulate the CSGP in terms of a Quadratic Binary Combinatorial Optimization (QUBO) problem to leverage existing quantum algorithms (e.g., QAOA) to obtain the best coalition structure. Thus, we perform a comparative analysis in terms of time complexity between the proposed quantum approach and the most popular classical baselines. Furthermore, we consider standard benchmark distributions for coalition values to test the BILP-Q on small-scale experiments using the IBM Qiskit environment. Finally, since QUBO problems can be solved operating with quantum annealing, we run BILP-Q on medium-size problems using a real quantum annealer (D-Wave).
Comments: 8 pages, 2 figures, 1 table
Subjects: Quantum Physics (quant-ph); Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA)
ACM classes: I.2.11; F.1.0
Cite as: arXiv:2204.13802 [quant-ph]
  (or arXiv:2204.13802v1 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2204.13802
Related DOI: https://doi.org/10.1145/3528416.3530235

Submission history

From: Antonio Macaluso Dr. [view email]
[v1] Thu, 28 Apr 2022 22:19:50 UTC (591 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2022-04
Change to browse by:
cs
cs.AI
cs.MA

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)