We present an encoding of some NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. A solution for a QUBO problem corresponds to minimize a quadratic function over binary variables (0/1), whose coefficients can be represented by a symmetric square matrix. Being this problem NP-Complete as well, there exist approximate solvers: from the D-Wave Ocean SDK we test a simulated annealing algorithm and a real quantum annelaer provided by the Leap (TM) Quantum Cloud Service. Hence, we propose a new encoding for Abstract Argumentation problems, which will benefit from the future development of quantum computation.
Abstract Argumentation Goes Quantum: An Encoding to QUBO Problems
Marco Baioletti;Francesco Santini
2022
Abstract
We present an encoding of some NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. A solution for a QUBO problem corresponds to minimize a quadratic function over binary variables (0/1), whose coefficients can be represented by a symmetric square matrix. Being this problem NP-Complete as well, there exist approximate solvers: from the D-Wave Ocean SDK we test a simulated annealing algorithm and a real quantum annelaer provided by the Leap (TM) Quantum Cloud Service. Hence, we propose a new encoding for Abstract Argumentation problems, which will benefit from the future development of quantum computation.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
