Graph state extraction from two-dimensional cluster states
arXiv:2505.08396 · doi:10.1088/1367-2630/ae02bd
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.
References in corpus (35)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum sensing
- Measurement-based quantum computation with cluster states
- Measurement-based quantum computation
- Multi-party entanglement in graph states
- Graph States for Quantum Secret Sharing
- Graphical description of the action of local Clifford transformations on graph states
- Distributed quantum sensing in a continuous variable entangled network
- Multi-parameter estimation in networked quantum sensors
- Universal resources for measurement-based quantum computation
- Quantum Conference Key Agreement: A Review
- A quantum network stack and protocols for reliable entanglement-based networks
- Modular architectures for quantum networks
- Quantum network routing and local complementation
- Efficient Long-Range Entanglement using Dynamic Circuits
- Experimental quantum conference key agreement
- Distributing Graph States Over Arbitrary Quantum Networks
- Tools for quantum network design
- Distributing Multipartite Entanglement over Noisy Quantum Networks
- Anonymous Quantum Conference Key Agreement
- Optimal distributed sensing in noisy environments
- Transforming graph states using single-qubit operations
- Symmetries in quantum networks lead to no-go theorems for entanglement distribution and to verification techniques
- Device-independent quantum secret sharing with noise preprocessing and postselection
- Influence of noise in entanglement-based quantum networks
- Rank-width of Random Graphs
- Extracting GHZ states from linear cluster states
- Private and Robust States for Distributed Quantum Sensing
- Noisy Stabilizer Formalism
- No graph state is preparable in quantum networks with bipartite sources and no classical communication
- Flexible quantum data bus for quantum networks
- Experimental anonymous conference key agreement using linear cluster states
- Simple loss-tolerant protocol for GHZ-state distribution in a quantum network
- The average cut-rank of graphs
- Generating multipartite nonlocality to benchmark quantum computers