Paper Image

Quantum annealing for graph coloring problems

Published on:

8 November 2023

Primary Category:

Quantum Physics

Paper Authors:

Joel E. Pion,

Susan M. Mniszewski

Bullets

Key Details

Quantum annealing can solve combinatorial optimization problems

Monochromatic triangle problem converts directly to QUBO form

Ramsey numbers require order reduction to reach quadratic form

Tested quantum annealing for both problems using D-Wave Advantage

Achieved good results on monochromatic triangle problem

AI generated summary

Quantum annealing for graph coloring problems

This paper explores using quantum annealing to solve graph coloring problems like the monochromatic triangle problem and Ramsey numbers. The monochromatic triangle problem converts naturally to a quadratic unconstrained binary optimization (QUBO) form for quantum hardware. The Ramsey number problem requires order reduction to reach a quadratic form. Experiments were run using the D-Wave Advantage quantum annealer.

Answers from this paper

Comments

No comments yet, be the first to start the conversation...

Sign up to comment on this paper

Sign Up