I am a novice in the Quantum Computing field. Recently we were discussing NP-complete problems in Algorithms class and a question arose in my mind which I have stated above, can anyone help me with this?

  • $\begingroup$ For examples like this: 1. Implement a funcion that checks edges that are attached to a common vertices and increments a counter when their color is the same. 2. Use this function as an oracle in a Grover Search algorithm which looks for those combinations which have zero errors. $\endgroup$ – draks ... Apr 28 '20 at 9:37
  • $\begingroup$ you find plenty of papers online for that, maybe you try to adapt the ideas of this one to your problem: researchgate.net/publication/… $\endgroup$ – draks ... Apr 28 '20 at 9:56
  • 1
    $\begingroup$ I just came across this one: github.com/microsoft/QuantumKatas/blob/master/GraphColoring/… $\endgroup$ – draks ... May 4 '20 at 7:14

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.