qiskit.optimization.applications.ising.max_cut¶

Convert max-cut instances into Pauli list Deal with Gset format. See https://web.stanford.edu/~yyye/yyye/Gset/ Design the max-cut object w as a two-dimensional np.array e.g., w[i, j] = x means that the weight of a edge between i and j is x Note that the weights are symmetric, i.e., w[j, i] = x always holds.

Functions

 Get graph solution from binary string. get_operator(weight_matrix) Generate Hamiltonian for the max-cut problem of a graph. max_cut_value(x, w) Compute the value of a cut.
get_graph_solution(x)[código fonte]

Get graph solution from binary string.

Parâmetros

x (numpy.ndarray) – binary string as numpy array.

Retorna

graph solution as binary numpy array.

Tipo de retorno

numpy.ndarray

get_operator(weight_matrix)[código fonte]

Generate Hamiltonian for the max-cut problem of a graph.

Parâmetros

Retorna

operator for the Hamiltonian float: a constant shift for the obj function.

Tipo de retorno

WeightedPauliOperator

max_cut_value(x, w)[código fonte]

Compute the value of a cut.

Parâmetros
• x (numpy.ndarray) – binary string as numpy array.

• w (numpy.ndarray) – adjacency matrix.

Retorna

value of the cut.

Tipo de retorno

float