2026-04-17T17:00:28Zhttps://recercat.cat/oai/request

oai:recercat.cat:2099.1/113132025-07-22T18:53:38Zcom_2072_1033col_2072_452951

Quantum annealing of a hard combinatorial problem Lecina Casas, Daniel Sánchez Umbría, Juan, Palassini, Matteo Àrees temàtiques de la UPC::Física Quantum theory Constraint satisfaction problem Quantum annealing Quantum coloring problem Coloring Física quàntica Quàntums, Teoria dels Projecte Final de Màster Oficial fet en col.laboració amb el Departament de Física Fonamental, Facultat de Física,Universitat de Barcelona We present the numerical results obtained using quantum annealing (QA) in a hard combinatorial problem: the coloring problem (q-COL) of an Erd˝os-R´enyi graph. We first propose a quantum coloring Hamiltonian, natural extension of q-COL, based on the quantum Ising model in a transverse field. We then test several QA schemes and find the one that solves the highest number of graphs in the smallest number of iterations. Our results suggest that the computation time of QA scales exponentially in the size and it does not improve the results obtained by thermal annealing (TA) for q-COL. 2011-02-04 Master thesis https://hdl.handle.net/2099.1/11313 eng http://creativecommons.org/licenses/by-nc-nd/3.0/es/ Open Access Attribution-NonCommercial-NoDerivs 3.0 Spain application/pdf Universitat Politècnica de Catalunya