Expressing multiagent coalition structure problems for optimisation by quantum annealing

ABSTRACT This paper addresses the problem of finding the optimal coalition structure in a multiagent system by expressing it in a proper format that can be solved by an adiabatic quantum computer such as D-Wave. The general case with any number of agents and graphs of agent connections with arbitrary structure is considered, and a method to handle the issues that arise from mapping a weighted graph game with intersecting edges on the lattice of qubit cells is provided. A principled discussion about the parameter values and mathematical proofs for the design choices are also included.

[1]  Andrew Lucas,et al.  Ising formulations of many NP problems , 2013, Front. Physics.

[2]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[3]  H. Nishimori,et al.  Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.

[4]  Mark W. Johnson,et al.  Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor , 2014, IEEE Transactions on Applied Superconductivity.

[5]  Sarit Kraus,et al.  Methods for Task Allocation via Agent Coalition Formation , 1998, Artif. Intell..

[6]  Nicholas R. Jennings,et al.  An improved dynamic programming algorithm for coalition structure generation , 2008, AAMAS.

[7]  Judith R. Fredrickson.  On the Crossing Number of Complete Graphs: Growing Minimal Kn From Minimal Kn 1 , 2006 .

[8]  Seth Lloyd,et al.  Adiabatic quantum computation is equivalent to standard quantum computation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[9]  Md. Saidur Rahman,et al.  Rectangular drawings of planar graphs , 2002, J. Algorithms.

[10]  Daniel A. Lidar,et al.  Defining and detecting quantum speedup , 2014, Science.

[11]  Morteza Zadimoghaddam,et al.  Optimal Coalition Structures in Cooperative Graph Games , 2011, 1108.5248.

[12]  Ryan Babbush,et al.  What is the Computational Value of Finite Range Tunneling , 2015, 1512.02206.

[13]  Ramos Alonso,et al.  Recent developments on the crossing number of the complete graph , 2013 .

[14]  Md. Saidur Rahman,et al.  Box-Rectangular Drawings of Planar Graphs , 2013, WALCOM.

[15]  Daniel A. Lidar,et al.  Error-corrected quantum annealing with hundreds of qubits , 2013, Nature Communications.

[16]  Alejandro Perdomo-Ortiz,et al.  Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics versus quantum approaches , 2016, 1604.01746.

[17]  Xiaotie Deng,et al.  On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..

[18]  Alán Aspuru-Guzik,et al.  Bayesian network structure learning using quantum annealing , 2014, The European Physical Journal Special Topics.

[19]  Costin Badica,et al.  Multiagent Coalition Structure Optimization by Quantum Annealing , 2017, ICCCI.

[20]  Shengjun Pan,et al.  The crossing number of K11 is 100 , 2007, J. Graph Theory.

[21]  D. Venturelli,et al.  Quantum Annealing Implementation of Job-Shop Scheduling , 2015, 1506.08479.

[22]  R. Guy.  Crossing numbers of graphs , 1972 .

[23]  Nicholas R. Jennings,et al.  Coalition Structure Generation over Graphs , 2012, J. Artif. Intell. Res..

[24]  Andrew D. King,et al.  Constructing SAT Filters with a Quantum Annealer , 2015, SAT.

[25]  Mark W. Johnson,et al.  Observation of topological phenomena in a programmable lattice of 1,800 qubits , 2018, Nature.