paulie.application.get_optimal_su2_n.get_optimal_edges_su_2_n# paulie.application.get_optimal_su2_n.get_optimal_edges_su_2_n(ng, fraction=0.706)# Get the optimal number of edges in the anticommutation graph for \(\mathfrak{su}(2^{n})\). Parameters: ng (int) – Number of generators. fraction (float) – Desired fraction of anticommuting pairs. Returns: Target number of anticommuting pairs, or -1 if ng < 2. Return type: int