Distillation of multipartite entangled states for arbitrary subsets of parties in noisy quantum networks of increasing size

Abstract

Quantum network states are multipartite states built from distributing pairwise entanglement among parties and underpin the paradigm of quantum networks for quantum information processing. In this work we introduce the problem of partial distillability in noisy quantum networks. This corresponds to the possibility of distilling by local operations and classical communication an arbitrary pure state for an arbitrary subset of parties starting from a single copy of a quantum network state of an increasing number of parties that share noisy (i.e. mixed) bipartite entangled states. Here, distillation means that the target state is obtained with fidelity as close to 1 as desired as the size of the network increases when the pairwise entangled links support a constant amount of noise. While we prove an obstruction to multipartite distillation protocols after teleportation with channels with constant noise, we show that partial distillability is indeed possible if certain well-established graph-theoretic parameters that measure the connectivity in the network grow fast enough with its size. We give necessary as well as sufficient conditions for partial distillability in terms of these parameters and we moreover provide explicit constructions of networks with partial distillability and a relatively slow connectivity growth.

arXiv comment12 pages

References in corpus (25)

• Quantum secret sharing
• Mixed-state entanglement and distillation: is there a ``bound'' entanglement in nature?
• On the Theory of Quantum Secret Sharing
• Fisher information and multiparticle entanglement
• Multipartite entanglement and high precision metrology
• Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
• Entanglement purification and quantum error correction
• Classification of multi-qubit mixed states: separability and distillability properties
• Universal resources for measurement-based quantum computation
• Quantum Conference Key Agreement: A Review
• The maximally entangled set of multipartite quantum states
• No-Go Theorems for Quantum Resource Purification
• Distributing Graph States Over Arbitrary Quantum Networks
• Distribution of entanglement in large-scale quantum networks
• Tools for quantum network design
• Genuine multipartite nonlocality is intrinsic to quantum networks
• Analysis of Multipartite Entanglement Distribution using a Central Quantum-Network Node
• Purification of genuine multipartite entanglement
• Activation of genuine multipartite entanglement: Beyond the single-copy paradigm of entanglement characterisation
• Growth of graph states in quantum networks
• Asymptotic survival of genuine multipartite entanglement in noisy quantum networks depends on the topology
• Graph-associated entanglement cost of a multipartite state in exact and finite-block-length approximate constructions
• Measurement outcomes that do not occur and their role in entanglement transformations
• Generating $k$ EPR-pairs from an $n$-party resource state
• Transformations in quantum networks via local operations assisted by finitely many rounds of classical communication