To utilize a quantum annealing system such as D-Wave's to solve a graph coloring problem,
it is necessary to convert the utility polynomial into a quadratic polynomial in binary variables.
This is called QUBO (quadratic unconstrained binary optimization) problem.
In any degree reduction process, we need to introduce auxiliary variables,
and more variables we have in the QUBO problem, less likely a
quantum annealing system can find an optimal solution.
The current degree reduction methods applies to monomials.

Dataset Files

You must be an IEEE Dataport Subscriber to access these files. Subscribe now or login.

[1] Hyosang Kang, "Symmetric degree reduction on random graphs", IEEE Dataport, 2023. [Online]. Available: http://dx.doi.org/10.21227/8qfp-qx18. Accessed: Feb. 17, 2025.
@data{8qfp-qx18-23,
doi = {10.21227/8qfp-qx18},
url = {http://dx.doi.org/10.21227/8qfp-qx18},
author = {Hyosang Kang },
publisher = {IEEE Dataport},
title = {Symmetric degree reduction on random graphs},
year = {2023} }
TY - DATA
T1 - Symmetric degree reduction on random graphs
AU - Hyosang Kang
PY - 2023
PB - IEEE Dataport
UR - 10.21227/8qfp-qx18
ER -
Hyosang Kang. (2023). Symmetric degree reduction on random graphs. IEEE Dataport. http://dx.doi.org/10.21227/8qfp-qx18
Hyosang Kang, 2023. Symmetric degree reduction on random graphs. Available at: http://dx.doi.org/10.21227/8qfp-qx18.
Hyosang Kang. (2023). "Symmetric degree reduction on random graphs." Web.
1. Hyosang Kang. Symmetric degree reduction on random graphs [Internet]. IEEE Dataport; 2023. Available from : http://dx.doi.org/10.21227/8qfp-qx18
Hyosang Kang. "Symmetric degree reduction on random graphs." doi: 10.21227/8qfp-qx18