RowCol Algorithm

The RowCol algorithm paper [1] builds on Kissinger et al [2] and Nash et al [3], and improves it in terms of worst case scaling and applicability to general connectivities. The following benchmark shows comparisons in practice with random circuits on two different architecture connectivities.

Figure 7 taken from [1] comparing RowCol in [1] with Kissinger et al [2] and Nash et al [3]. Random circuits are sampled as random binary and invertible matrices. The results are for two different connectivity architectures, a) for IBMQ20 and b) for T20 as depicted in fig. 5 of [1].