Quantum Computing, Graph Coloring, Communication Network.
coloring problem for four graphs with 7, 7, 10, and 19 nodes. In all four graphs, the algorithm found an optimal coloring solution in excellent agreement with the corresponding numerical simulations. The four graphs colored using an emulator. The results from the QPU will be published in a