qml.pauli.grouping.graph_colouring.recursive_largest_first

recursive_largest_first(binary_observables, adj)

Performs graph-colouring using the Recursive Largest Degree First heuristic. Often yields a lower chromatic number than Largest Degree First, but takes longer (runtime is cubic in number of vertices).

Parameters

• binary_observables (array[int]) – the set of Pauli words represented by a column matrix of the Pauli words in binary vector representation

• adj (array[int]) – the adjacency matrix of the Pauli graph

Returns

keys correspond to colours (labelled by integers) and values are lists of Pauli words of the same colour in binary vector representation

Return type

dict(int, list[array[int]])

Example

>>> binary_observables = np.array([[1., 1., 0.],
... [1., 0., 0.],
... [0., 0., 1.],
... [1., 0., 1.]])
>>> adj = np.array([[0., 0., 1.],
... [0., 0., 1.],
... [1., 1., 0.]])
>>> recursive_largest_first(binary_observables, adj)
{1: [array([0., 0., 1.])], 2: [array([1., 1., 0.]), array([1., 0., 0.])]}

code/api/pennylane.pauli.grouping.graph_colouring.recursive_largest_first

 

Download Python script

 

Download Notebook

 

View on GitHub