0
$\begingroup$

I have a combinatorial optimization problem which on a first pass I think boils down to finding a path with a maximal score. The score for a path is computed by an auxiliary function.

Are there near-term/variational quantum algorithms designed for this problem? I see that QAOA etc. have only been dealt with MaxCut, Max Independent Set type problems.

$\endgroup$
1

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.