Distributed synthesis of arbitrary graph states in quantum networks via rank-two GF(2) reduction
This paper forms graph state synthesis as a rank-2 reduction process of a difference matrix over GF(2), and gives an upper bound floor(N/2) on the number of steps for synthesizing an arbitrary N-node graph state, independent of the edge density of the target graph state.