A Grover search-based algorithm for the list coloring problem

Abstract

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\ge 5$. The list coloring problem asks the following more general question: given a list of available colors for each vertex in a graph, does it admit a proper coloring? We propose a quantum algorithm based on Grover search 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 commentUpdated with accepted journal version

References in corpus (17)

• Elementary gates for quantum computation
• Quantum Algorithms Revisited
• Multi-particle entanglement of hot trapped ions
• Tight bounds on quantum searching
• Quantum Circuits for General Multiqubit Gates
• A Quantum Algorithm for Finding the Minimum
• Efficient decomposition of quantum gates
• Grover Adaptive Search for Constrained Polynomial Binary Optimization
• On Problems as Hard as CNFSAT
• Quantum Approximate Counting, Simplified
• Hybrid quantum-classical algorithms for approximate graph coloring
• Efficient decomposition of unitary matrices in quantum circuit compilers
• Constrained quantum annealing of graph coloring
• Trajectory optimization using quantum computing
• Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems
• Circuit Design for $k$-coloring Problem and Its Implementation on Near-term Quantum Devices
• Quantum-gate decomposer

Cited by in corpus (1)

• Optimized General Uniform Quantum State Preparation