paulie.classifier.classification.Morph#

class paulie.classifier.classification.Morph(legs, dependents)#

Stores the structural data of a canonical graph.

counts()#

Get counts of length 1 legs, length 2 legs, and number of vertices on the longest leg.

Returns:: Counts of length 1 legs, length 2 legs, and number of vertices on the longest leg.
Return type:: tuple[int,int,int]
Raises:: ClassificationException – If the graph is of non-canonical type.

gen_generators()#

Generate generators.

gen_independent_pair()#

Generate all independent pairs of Pauli strings in the transformed generating set.

gen_pq()#

Generate products of all pairs of Pauli strings in the canonical graph.

Yields:: Dictionary of v (PauliString): Vertex of graph. w (PauliString): Other vertex of graph. vw (PauliString): Proportional product of v and w. neighbour: True if v and w are neighbours.

get_algebra_properties()#

Get the properties of the algebra.

If the algebra is

\[\bigoplus_{i=1}^{n}\mathfrak{a}(m)\]

Then the tuple \(\{\mathfrak{a},n,m\}\) is returned.

Returns:: Tuple of type of algebra, number of copies of the algebra, and the size of the algebra.
Return type:: tuple[TypeAlgebra,int,int]

get_dependents()#

Get a list of dependent Pauli strings.

get_legs()#

Get list of legs.

get_properties()#

Get the properties of the graph including its type.

Returns:: Type of the graph and counts of length 1 legs, length 2 legs, and number of vertices on the longest leg.
Return type:: tuple[TypeGraph,int,int,int]
Raises:: ClassificationException – If the graph is of non-canonical type.

get_type()#

Get the type of the graph.

get_vertices()#

Get a list of vertices in the graph.

is_empty()#

Check if the graph is empty.

is_empty_legs()#

Check if the graph has a center but no legs.