Published on:

8 November 2023

Primary Category:

Quantum Physics

Paper Authors:

Joel E. Pion,

Susan M. Mniszewski

•

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

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.

A Beginner's Guide to Quantum Optimization

Benchmarking quantum optimization performance

Quantum optimization of optical network routing

Quantum algorithms for two-level and book graph drawings

Quantum computing for radar waveform optimization: A new approach to an old problem

A quantum algorithm for quadratic optimization

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

Sign up to comment on this paper