Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2111.14390

Withdrawn: A Measurement-based Algorithm for Graph Colouring

Michael Epping, Tobias Stollenwerk

Published Nov 29, 2021• 0 citations
arXivHTMLPDF

Abstract

In a previous version of this document we misinterpreted the runtime of a part of the described algorithm. Indeed, the runtime is not better than the Grover-Algorithm. We therefor withdraw this work. We present a novel algorithmic approach to find a proper vertex colouring of a graph with $d$ colours, if it exists. We associate a $d$-dimensional quantum system with each vertex and the initial state is a mixture of all possible colourings, from which we obtain a random proper colouring of the graph by measurements. The non-deterministic nature of the quantum measurement is tackled by a reset operation, which can revert the effect of unwanted projections. As in the classical case, we find that the runtime scales exponentially with the number of vertices. However, we provide numerical evidence that the average runtime of the problem-specific part of the algorithm scales polynomially in the number of edges.

DOI
10.48550/arxiv.2111.14390

Related papers

A Measurement-based Algorithm for Graph Colouring.

Michael Epping, Tobias Stollenwerk

We present a novel algorithmic approach to find a proper vertex colouring of a graph with d colours, if it exists. We associate a d-dimensional quantum system with each vertex and the initial state is a mixture of all possible colourings, from which we obtain a random proper colouring of the graph by measurements. The non-deterministic nature of the quantum measurement is tackled by a reset operation, which can revert the effect of unwanted projections. As in the classical case, we find that the runtime scales exponentially with the number of vertices. However, we provide numerical evidence that the average runtime for random graphs scales polynomially in the number of edges.

•Nov 29, 2021•0 citations

A Grover Search-Based Algorithm for the List Coloring Problem

Sayan Mukherjee

Graph coloring is a computationally difficult problem, and currently the best known classical algorithm for$k$-coloring of graphs on$n$vertices has runtimes$\Omega (2^n)$for$k\geq 5$. The list coloring problem asks the following more general question: given alistof available colors for each vertex in a graph, does it admit a proper coloring? We propose a hybrid classical-quantum algorithm based on Grover search 12 to quadratically speed up exhaustive search. Our algorithm loses in complexity to classical ones in specific restricted cases, but improves exhaustive search for cases, where the lists and graphs considered are arbitrary in nature.

arXiv:2108.09061•IEEE Transactions on Quantum Engineering•Jan 1, 2022•26 citations

Exponential-Time Quantum Algorithms for Graph Coloring Problems

Kazuya Shimizu, Ryuhei Mori

Abstract The fastest known classical algorithm deciding the k-colorability of n-vertex graph requires running time $$\varOmega (2^n)$$ Ω ( 2 n ) for $$k\ge 5$$ k ≥ 5 . In this work, we present an exponential-space quantum algorithm computing the chromatic number with running time $$O(1.9140^n)$$ O ( 1 . 9140 n ) using quantum random access memory (QRAM). Our approach is based on Ambainis et al’s quantum dynamic programming with applications of Grover’s search to branching algorithms. We also present a polynomial-space quantum algorithm not using QRAM for the graph 20-coloring problem with running time $$O(1.9575^n)$$ O ( 1 . 9575 n ) . For the polynomial-space quantum algorithm, we essentially develop $$(4-\epsilon )^n$$ ( 4 - ϵ ) n -time classical algorithms that can be improved quadratically by Grover’s search.

arXiv:1907.00529•Algorithmica•Jun 1, 2022•28 citations

A quantum–classical approach to solve the graph coloring problem with minimum colors

Prem Shanker Dwivedi, Abhinav Kumar, Amit Biswas +1 more

Abstract Graph coloring with minimum colors is a well-known NP-complete problem in computer science and mathematics, having diverse real-life applications such as scheduling, register allocation, and frequency assignment. However, a classical computer requires exponential time to solve the graph coloring problem with the minimum number of colors. Therefore, classical approaches become infeasible for solving this problem on large graphs. In contrast, quantum computing offers the potential for speedup on specific problems, although solutions are typically obtained with a certain probability of correctness. This work proposes a quantum–classical method for solving the graph coloring problem and finding the chromatic number of a graph with guaranteed correctness, and also reduces the time and qubit complexities. The proposed method is inspired by Randomized Grover’s search algorithm, and the classical binary search algorithm. Here, Randomized Grover’s search algorithm provides quadratic speedup and this algorithm is useful in real situations when the number of solutions is not known in advance in contrast to the Grover’s search algorithm. The binary search algorithm helps to achieve logarithmic speedup, which reduces overall complexity. The experimental results strongly validate our claims and demonstrate the superiority of the approach. Furthermore, a comprehensive mathematical analysis is carried out to examine its complexities, as well as to compare its computational efficiency with existing methods.

Physica Scripta•Oct 9, 2026•0 citations

Optimization by quantum annealing for the graph colouring problem

Olawale Titiloye

Quantum annealing is the quantum equivalent of the well known classical simulated annealing algorithm for combinatorial optimization problems. Despite the appeal of the approach, quantum annealing algorithms competitive with the state of the art for specific problems hardly exist in the literature. Graph colouring is a difficult problem of practical significance that can be formulated as combinatorial optimization. By introducing a symmetry-breaking problem representation, and finding fast incremental techniques to calculate energy changes, a competitive graph colouring algorithm based on quantum annealing is derived. This algorithm is further enhanced by tuning simplification techniques; replica spacing techniques to increase robustness; and a messaging protocol, which enables quantum annealing to efficiently take advantage of multiprocessor environments. Additionally, observations of some patterns in the tuning for random graphs led to a more effective algorithm able to find new upper bounds for several widely-used benchmark graphs, some of which had resisted improvement in the last two decades.

•May 27, 2026•0 citations

Symmetric Reduction Techniques for Quantum Graph Colouring

Lord Sen, Shyamapada Mukherjee

This paper introduces an efficient quantum computing method for reducing special graphs in the context of the graph coloring problem. The special graphs considered include both symmetric and non-symmetric graphs where the axis passes through nodes only, edges only, and both together. The presented method reduces the number of coloring matrices, which is important for realization of the number of quantum states required, from $K^{N}$ to $K^{\frac{N+m}{2}}$ upon one symmetric reduction of graphs symmetric about an axis passing through $m$ nodes, where $K$ is the number of colours required and \emph{N} being total number of nodes. Similarly for other types also, the number of quantum states is reduced. The complexity in the number of qubits has been reduced by $δC_q= \frac{9N^2}{8}-\frac{3m^2}{8}-\frac{3Nm}{4}-\frac{N}{4}+\frac{m}{4}$ upon one symmetric reduction of graphs, symmetric about an axis passing through $m$ nodes and other types as presented in the paper. Additionally, the number of gates and number of iterations are reduced massively compared to state-of-the-art quantum algorithms. Like for a graph with 20 nodes and symmetric line passing through 2 nodes, the number of iterations decreased from 5157 to 67. Therefore, the procedure presented for solving the graph coloring problem now requires a significantly reduced number of qubits compared to before. The run time of the proposed algorithm for these special type of graphs are reduced from $O(1.9575^{N})$ to $O(1.9575^{(\frac{N+m}{2})})$ upon one symmetric reduction of graphs symmetric about an axis passing through $m$ nodes and similarly for others cases.

arXiv:2510.16784•Oct 19, 2025•2 citations
In a previous version of this document we misinterpreted the runtime of a part of the described algorithm. Indeed, the runtime is not better than the Grover-Algorithm. We therefor withdraw this work. We present a novel algorithmic approach to find a proper vertex colouring of a graph with ddd colours, if it exists. We associate a ddd-dimensional quantum system with each vertex and the initial state is a mixture of all possible colourings, from which we obtain a random proper colouring of the graph by measurements. The non-deterministic nature of the quantum measurement is tackled by a reset operation, which can revert the effect of unwanted projections. As in the classical case, we find that the runtime scales exponentially with the number of vertices. However, we provide numerical evidence that the average runtime of the problem-specific part of the algorithm scales polynomially in the number of edges.
We present a novel algorithmic approach to find a proper vertex colouring of a graph with d colours, if it exists. We associate a d-dimensional quantum system with each vertex and the initial state is a mixture of all possible colourings, from which we obtain a random proper colouring of the graph by measurements. The non-deterministic nature of the quantum measurement is tackled by a reset operation, which can revert the effect of unwanted projections. As in the classical case, we find that the runtime scales exponentially with the number of vertices. However, we provide numerical evidence that the average runtime for random graphs scales polynomially in the number of edges.
Graph coloring is a computationally difficult problem, and currently the best known classical algorithm forkkk-coloring of graphs onnnnvertices has runtimesΩ(2n)\Omega (2^n)Ω(2n)fork≥5k\geq 5k≥5. The list coloring problem asks the following more general question: given alistof available colors for each vertex in a graph, does it admit a proper coloring? We propose a hybrid classical-quantum algorithm based on Grover search 12 to quadratically speed up exhaustive search. Our algorithm loses in complexity to classical ones in specific restricted cases, but improves exhaustive search for cases, where the lists and graphs considered are arbitrary in nature.
Abstract The fastest known classical algorithm deciding the k-colorability of n-vertex graph requires running time Ω(2n)\varOmega (2^n)Ω(2n) Ω ( 2 n ) for k≥5k\ge 5k≥5 k ≥ 5 . In this work, we present an exponential-space quantum algorithm computing the chromatic number with running time O(1.9140n)O(1.9140^n)O(1.9140n) O ( 1 . 9140 n ) using quantum random access memory (QRAM). Our approach is based on Ambainis et al’s quantum dynamic programming with applications of Grover’s search to branching algorithms. We also present a polynomial-space quantum algorithm not using QRAM for the graph 20-coloring problem with running time O(1.9575n)O(1.9575^n)O(1.9575n) O ( 1 . 9575 n ) . For the polynomial-space quantum algorithm, we essentially develop (4−ϵ)n(4-\epsilon )^n(4−ϵ)n ( 4 - ϵ ) n -time classical algorithms that can be improved quadratically by Grover’s search.
Abstract Graph coloring with minimum colors is a well-known NP-complete problem in computer science and mathematics, having diverse real-life applications such as scheduling, register allocation, and frequency assignment. However, a classical computer requires exponential time to solve the graph coloring problem with the minimum number of colors. Therefore, classical approaches become infeasible for solving this problem on large graphs. In contrast, quantum computing offers the potential for speedup on specific problems, although solutions are typically obtained with a certain probability of correctness. This work proposes a quantum–classical method for solving the graph coloring problem and finding the chromatic number of a graph with guaranteed correctness, and also reduces the time and qubit complexities. The proposed method is inspired by Randomized Grover’s search algorithm, and the classical binary search algorithm. Here, Randomized Grover’s search algorithm provides quadratic speedup and this algorithm is useful in real situations when the number of solutions is not known in advance in contrast to the Grover’s search algorithm. The binary search algorithm helps to achieve logarithmic speedup, which reduces overall complexity. The experimental results strongly validate our claims and demonstrate the superiority of the approach. Furthermore, a comprehensive mathematical analysis is carried out to examine its complexities, as well as to compare its computational efficiency with existing methods.
Quantum annealing is the quantum equivalent of the well known classical simulated annealing algorithm for combinatorial optimization problems. Despite the appeal of the approach, quantum annealing algorithms competitive with the state of the art for specific problems hardly exist in the literature. Graph colouring is a difficult problem of practical significance that can be formulated as combinatorial optimization. By introducing a symmetry-breaking problem representation, and finding fast incremental techniques to calculate energy changes, a competitive graph colouring algorithm based on quantum annealing is derived. This algorithm is further enhanced by tuning simplification techniques; replica spacing techniques to increase robustness; and a messaging protocol, which enables quantum annealing to efficiently take advantage of multiprocessor environments. Additionally, observations of some patterns in the tuning for random graphs led to a more effective algorithm able to find new upper bounds for several widely-used benchmark graphs, some of which had resisted improvement in the last two decades.
This paper introduces an efficient quantum computing method for reducing special graphs in the context of the graph coloring problem. The special graphs considered include both symmetric and non-symmetric graphs where the axis passes through nodes only, edges only, and both together. The presented method reduces the number of coloring matrices, which is important for realization of the number of quantum states required, from KNK^{N}KN to KN+m2K^{\frac{N+m}{2}}K2N+m​ upon one symmetric reduction of graphs symmetric about an axis passing through mmm nodes, where KKK is the number of colours required and \emph{N} being total number of nodes. Similarly for other types also, the number of quantum states is reduced. The complexity in the number of qubits has been reduced by δCq=9N28−3m28−3Nm4−N4+m4δC_q= \frac{9N^2}{8}-\frac{3m^2}{8}-\frac{3Nm}{4}-\frac{N}{4}+\frac{m}{4}δCq​=89N2​−83m2​−43Nm​−4N​+4m​ upon one symmetric reduction of graphs, symmetric about an axis passing through mmm nodes and other types as presented in the paper. Additionally, the number of gates and number of iterations are reduced massively compared to state-of-the-art quantum algorithms. Like for a graph with 20 nodes and symmetric line passing through 2 nodes, the number of iterations decreased from 5157 to 67. Therefore, the procedure presented for solving the graph coloring problem now requires a significantly reduced number of qubits compared to before. The run time of the proposed algorithm for these special type of graphs are reduced from O(1.9575N)O(1.9575^{N})O(1.9575N) to O(1.9575(N+m2))O(1.9575^{(\frac{N+m}{2})})O(1.9575(2N+m​)) upon one symmetric reduction of graphs symmetric about an axis passing through mmm nodes and similarly for others cases.