Published January 5, 2024
| Version v3
Journal article
Open
Solving the General Planar Graph Coloring Problem Using Grover's Algorithm
Description
In this paper, we discuss the structure and implementations of the planar graph-coloring problem (PGCP). We briefly look at well-known classical algorithms used to solve the PGCP but primarily focus on the quantum computational angle. Grover’s search is a well-known quantum algorithm that offers a quadratic advantage relative to its classical counterparts. We inspect its application to the PGCP and build a corresponding quantum circuit. We take a specific case of specialists in Nepalese hospitals and optimize their placements.
Files
IJISRT23DEC1734.pdf
Files
(818.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:e6946ab34ef8320ef8c517d69f323966
|
818.9 kB | Preview Download |
Additional details
Dates
- Accepted
-
2024-01-05