8 citations · 18 across the 8 of their papers we have counts for
1 paper · 2 filters
David Jansen, Timothy Heightman, Luke Mortimer +2
We introduce a quantum-inspired algorithm for graph coloring problems (GCPs) that utilizes qudits in a product state, with each qudit representing a node in the graph and parameter…