Reformulating the harmonious colouring problem for quantum annealing

MaRDI QIDQ5064871zbMATH OpenFDO

Authors Anuradha Mahasinghe

Publication date 16 March 2022

Full work available at URL http://misn-b.spiruharet.ro/images/secretariat/secretariat-mate-info/informatica/cercetare/anale-mi/ashu-mi-full_2018_1_a2.pdf

zbMATH Keywords

graph colouringmetaheuristicsquadratic unconstrained binary optimisationquantum computing

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Applications of mathematical programming (90C90)

Recommendations

• Quantum annealing of the graph coloring problem
• Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
• Quantum approaches to graph colouring
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Quantum annealing of hard problems

Cited in

(3)

• Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
• Quantum annealing of the graph coloring problem
• A degree reduction method for an efficient QUBO formulation for the graph coloring problem

This page was built for publication: Reformulating the harmonious colouring problem for quantum annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5064871)