A Simple Quantum Blockmodeling with Qubits and Permutations

arXiv:2311.07726v2 Announce Type: replace-cross
Abstract: Blockmodeling of a given problem represented by an $N\times N$ adjacency matrix can be found by swapping rows and columns of the matrix (i.e. multiplying matrix from left and right by a permutation matrix). Although classical matrix permutations can be efficiently done by swapping pointers for the permuted rows (or columns) of the matrix, by changing row-column order, a permutation changes the location of the matrix elements, which determines the membership of a group in …

abstract arxiv cs.lg cs.si found matrix permutations quant-ph quantum qubits simple the matrix type