Description
Graph states are fundamental for many exciting future applications, such as quantum computing and networks. Two-qubit entangling gates are crucial for generating arbitrary graph states. Previous approaches were concentrated on growing graph states from smaller states via merging and fusing using such entangling gates in an arbitrary manner. Here, we focus on a top-down approach, assuming that a specific multipartite entangled resource state is available. We concentrate on two-dimensional cluster states corresponding to two-dimensional lattice structures, which can efficiently be prepared in set-ups that obey such a geometry. We propose schemes to extract arbitrary graph states from two-dimensional cluster states by locally manipulating the qubits. These schemes have direct applications in entanglement-based quantum networks, sensor networks, and distributed quantum computing in general.
