qiskit.optimization.applications.ising.stable_set¶
Convert stable set instances into Pauli list. We read instances in the Gset format, see https://web.stanford.edu/~yyye/yyye/Gset/ , for compatibility with the maxcut format, but the weights on the edges as they are not really used and are always assumed to be 1. The graph is represented by an adjacency matrix.
Functions
Get graph solution from binary string. |
|
|
Generate Hamiltonian for the maximum stable set in a graph. |
|
Compute the value of a stable set, and its feasibility. |
-
get_graph_solution(x)[source]¶ Get graph solution from binary string.
- Paramètres
x (numpy.ndarray) – binary string as numpy array.
- Renvoie
graph solution as binary numpy array.
- Type renvoyé
numpy.ndarray
-
get_operator(w)[source]¶ Generate Hamiltonian for the maximum stable set in a graph.
- Paramètres
w (numpy.ndarray) – adjacency matrix.
- Renvoie
operator for the Hamiltonian and a constant shift for the obj function.
- Type renvoyé
tuple(WeightedPauliOperator, float)
-
stable_set_value(x, w)[source]¶ Compute the value of a stable set, and its feasibility.
- Paramètres
x (numpy.ndarray) – binary string in original format – not graph solution!.
w (numpy.ndarray) – adjacency matrix.
- Renvoie
- size of the stable set, and Boolean indicating
feasibility.
- Type renvoyé
tuple(float, bool)