Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
From MaRDI portal
Publication:1687551
DOI10.1007/978-3-319-66167-4_9zbMath1495.68201OpenAlexW2747088929MaRDI QIDQ1687551
Stefano Varotti, Aidan Roy, Zhengbing Bian, Roberto Sebastiani, William G. Macready, Fabián A. Chudak
Publication date: 4 January 2018
Full work available at URL: http://hdl.handle.net/11572/185348
Quantum computation (81P68) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
Applications and Computational Advances for Solving the QUBO Model ⋮ Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results ⋮ Efficiently embedding QUBO problems on adiabatic quantum computers ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories ⋮ A maximum edge-weight clique extraction algorithm based on branch-and-bound ⋮ Quantum annealing learning search for solving QUBO problems
This page was built for publication: Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
