Extracting GHZ states from linear cluster states

Abstract

Quantum information processing architectures typically only allow for nearest-neighbour entanglement creation. In many cases, this prevents the direct generation of GHZ states, which are commonly used for many communication and computation tasks. Here, we show how to obtain GHZ states between nodes in a network that are connected in a straight line, naturally allowing them to initially share linear cluster states. We prove a strict upper bound of $\lfloor (n+3)/2\rfloor$ on the size of the set of nodes sharing a GHZ state that can be obtained from a linear cluster state of $n$ qubits, using local Clifford unitaries, local Pauli measurements, and classical communication. Furthermore, we completely characterize all selections of nodes below this threshold that can share a GHZ state obtained within this setting. Finally, we demonstrate these transformations on the IBMQ Montreal quantum device for linear cluster states of up to $n=19$ qubits.

arXiv comment6 pages, 4 figures, Jupyter notebook available at https://github.com/hahnfrederik/Extracting-maximal-entanglement-from-linear-cluster-states

References in corpus (18)

• Quantum secret sharing
• Persistent entanglement in arrays of interacting particles
• Multi-party entanglement in graph states
• Detecting Genuine Multipartite Entanglement with Two Local Measurements
• Graphical description of the action of local Clifford transformations on graph states
• The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
• Quantum Conference Key Agreement: A Review
• Quantum network routing and local complementation
• Quantum Anonymous Transmissions
• Anonymous Quantum Conference Key Agreement
• Local unitary versus local Clifford equivalence of stabilizer states
• Transforming graph states using single-qubit operations
• Secure Anonymous Conferencing in Quantum Networks
• Transforming graph states to Bell-pairs is NP-Complete
• Limitations of nearest-neighbour quantum networks
• Fidelity measurement of a multiqubit cluster state with minimal effort
• Extracting perfect GHZ states from imperfect weighted graph states via entanglement concentration
• Counting single-qubit Clifford equivalent graph states is #P-Complete

Cited by in corpus (8)

• Flexible quantum data bus for quantum networks
• Hardware-Efficient Preparation of Graph States on Near-Term Quantum Computers
• Transforming graph states via Bell state measurements
• Graph state extraction from two-dimensional cluster states
• The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States
• Distinguishing Graph States by the Properties of Their Marginals
• Localizing multipartite entanglement with local and global measurements
• Polynomial-time Extraction of Entanglement Resources