paulie.application.get_optimal_su2_n.get_optimal_universal_generators#

paulie.application.get_optimal_su2_n.get_optimal_universal_generators(n)#

Get an optimal universal generator set for \(\mathfrak{su}(2^{n})\).

Parameters:

n (int) – Number of qubits, i.e. the exponent in \(\mathfrak{su}(2^{n})\)

Returns:

An optimal universal generator set for \(\mathfrak{su}(2^{n})\).

Return type:

PauliStringCollection | None