Circle graph states satisfy LU=LC equivalence and bipartite variants correspond bijectively to planar code states. Despite polynomial rank-width, MBQC on circle graph states is efficiently classically simulable. Counting LU-equivalent graph states is #P-hard.
#GraphStates #QuantumComputing #MBQC