Graph state extraction from two-dimensional cluster states

TL;DR

This paper presents methods to extract arbitrary graph states from 2D cluster states using local single-qubit measurements, enabling applications in quantum networks and distributed quantum computing.

Contribution

It introduces novel graph state manipulation tools and a zipper scheme to efficiently generate desired graph states from 2D cluster states.

Findings

Minimized overheads by avoiding multiple edges

Compared with measurement-based quantum computation strategies

Demonstrated applications in quantum networks and distributed computing

Abstract

We propose schemes to extract arbitrary graph states from two-dimensional cluster states by locally manipulating the qubits solely via single-qubit measurements. We introduce graph state manipulation tools that allow one to increase the local vertex degree and to merge subgraphs. We utilize these tools together with the previously introduced zipper scheme that generates multiple edges between distant vertices to extract the desired graph state from a two-dimensional cluster state. We show how to minimize overheads by avoiding multiple edges, and compare with a local manipulation strategy based on measurement-based quantum computation together with transport. These schemes have direct applications in entanglement-based quantum networks, sensor networks, and distributed quantum computing in general.