dc.contributor
Sánchez Umbría, Juan,
dc.contributor
Palassini, Matteo
dc.contributor.author
Lecina Casas, Daniel
dc.date.issued
2011-02-04
dc.identifier
https://hdl.handle.net/2099.1/11313
dc.description.abstract
Projecte Final de Màster Oficial fet en col.laboració amb el Departament de Física Fonamental, Facultat de Física,Universitat de Barcelona
dc.description.abstract
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.
dc.format
application/pdf
dc.publisher
Universitat Politècnica de Catalunya
dc.rights
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights
Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.subject
Àrees temàtiques de la UPC::Física
dc.subject
Quantum theory
dc.subject
Constraint satisfaction problem
dc.subject
Quantum annealing
dc.subject
Quantum coloring problem
dc.subject
Física quàntica
dc.subject
Quàntums, Teoria dels
dc.title
Quantum annealing of a hard combinatorial problem
