0
$\begingroup$

I am trying to calculate the min cut of a graph. My plan so far is to use QuadraticProgram from the problem specification as well as create the corresponding Ising Hamiltonian. Though I am currently planning on using QAOA I am also considering BFS and Grover’s search.

I have this code from qiskit for Maxcut, however a Mincut function does not exist. w is the weight matrix.

max_cut = Maxcut(w)
qp = max_cut.to_quadratic_program()
print(qp.prettyprint())

source: https://qiskit.org/documentation/optimization/tutorials/06_examples_max_cut_and_tsp.html

Improve this question
$\endgroup$

0

Reset to default

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.

Browse other questions tagged or ask your own question.