A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity

Romain Bourneuf, Nathan Claudet, Sang Yoon Kim +3

We introduce a new notion of distance between two graph states $|G⟩$ and $|G^{\prime }⟩$ on the same set of qubits. This distance is the minimum number of ancilla qubits in a gr…