Joe Pacold

Hello -- I've been looking for open issues to work on and am potentially interested in this one. It looks as if [synth_permutation_basic](https://github.com/Qiskit/qiskit/blob/d10f9a0fe1f73cde5b66e49af880a6f7816f131f/qiskit/synthesis/permutation/permutation_full.py#L27) just decomposes a permutation into transpositions by...

Commenting so that this can be assigned to me (see #1213)

@raynelfss Done, thanks for pointing that out.

It looks like #12605 closes this.

I'm interested in taking this on if nobody has started on it.

So far all I have done is implement the [modularity](https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.community.quality.modularity.html#networkx.algorithms.community.quality.modularity) function (which the Louvain algorithm tries to maximize) in [this branch](https://github.com/jpacold/rustworkx/tree/louvain). Before going any further I wanted to check whether...

* Fixed two mistakes in the modularity gain calculation (I am actually a little surprised that the tests passed earlier and need to come up with some more) * Addressed...

Thanks for the advice! It looks like there is still a test failure but the docs build should be fixed.

- Fixed heading levels - Substantially expanded the introduction to describe the circuit without references to the paper - Changed the title. The results in the paper that are specifically...

> Thanks, @jpacold. Regarding your question in the PR description, most definitely a small non-working example would help to understand what the issue is. An example is below. I get...