1 citations · 1 across the 3 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2025
Divide-et-impera Heuristic-based Randomized Search for the Qubit Routing Problem
Marco Baioletti, Fabrizio Fagiolo, Angelo Oddi +1
This paper introduces the DIRSH algorithm for the Qubit Routing Problem (QRP), using a heuristic-guided randomized divide-and-conquer strategy. The method splits the circuit into c…
quant-ph2024★ 1 cited
An encoding of argumentation problems using quadratic unconstrained binary optimization
Marco Baioletti, Francesco Santini
In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. In this form, a sol…