Universal Limitations on Quantum Key Distribution over a Network

Das, Siddhartha; Bäuml, Stefan; Winczewski, Marek; Horodecki, Karol

doi:10.1103/physrevx.11.041016

Cited by 38 publications

(30 citation statements)

References 131 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…See Appendix C for details. Note that the Steiner tree packing approach is applied to the similar problems in [26][27][28].…”

Section: Ghz Entanglement Distillation From Shared Bipartite Statesmentioning

confidence: 99%

“…This concludes the proof of the lower bound. Note that the Steiner tree approach to the entanglement and key distribution over a quantum network is also discussed in [26][27][28] where the more general case, i.e. the tree packing among a subgraph is mainly considered.…”

Section: Asymptotic Continuitymentioning

confidence: 99%

“…Despite recent efforts [25][26][27][28], however, less is known for the multipartite entanglement/secret key distribution capacity. This is mainly due to the little knowledge on the upper bound of the GHZ version of distillable entanglement/secret key, although it is one of the fundamental problem in quantum information theory for long time [7,29].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Multipartite entanglement and secret key distribution in quantum networks

Takeoka,

Kaur,

Roga

et al. 2019

Preprint

View full text Add to dashboard Cite

Distribution and distillation of entanglement over quantum networks is a basic task for Quantum Internet applications. A fundamental question is then to determine the ultimate performance of entanglement distribution over a given network. Although this question has been extensively explored for bipartite entanglement-distribution scenarios, less is known about multipartite entanglement distribution.Here we establish the fundamental limit of distributing multipartite entanglement, in the form of GHZ states, over a quantum network. In particular, we determine the multipartite entanglement distribution capacity of a quantum network, in which the nodes are connected through lossy bosonic quantum channels. This setting corresponds to a practical quantum network consisting of optical links. The result is also applicable to the distribution of multipartite secret key, known as common key, for both a fully quantum network and trusted-node based quantum key distribution network. Our results set a general benchmark for designing a network topology and network quantum repeaters (or key relay in trusted nodes) to realize efficient GHZ state/common key distribution in both fully quantum and trusted-node-based networks. We show an example of how to overcome this limit by introducing a network quantum repeater.Our result follows from an upper bound on distillable GHZ entanglement introduced here, called the "recursive-cut-and-merge" bound, which constitutes major progress on a longstanding fundamental problem in multipartite entanglement theory. This bound allows for determining the distillable GHZ entanglement for a class of states consisting of products of bipartite pure states.

show abstract

“…See Appendix C for details. Note that the Steiner tree packing approach is applied to the similar problems in [26][27][28].…”

Section: Ghz Entanglement Distillation From Shared Bipartite Statesmentioning

confidence: 99%

Section: Asymptotic Continuitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multipartite entanglement and secret key distribution in quantum networks

Takeoka,

Kaur,

Roga

et al. 2019

Preprint

View full text Add to dashboard Cite

show abstract

“…Various quantum-information tasks requires genuine entanglement as an indispensable ingredient. They include the quantum key distribution [1], measurement-based quantum computation [2,3], communication [4] and one-dimensional cluster-Ising model [5]. The detection and construction of genuine entanglement has a received extensive attentions in quantum information both theoretically and experimentally in recent years.…”

Section: Introductionmentioning

confidence: 99%

Tripartite genuinely entangled states from entanglement-breaking subspaces

Sun,

Chen

2020

Preprint

View full text Add to dashboard Cite

The determination of genuine entanglement is a central problem in quantum information processing. We investigate the tripartite state as the tensor product of two bipartite entangled states by merging two systems. We show that the tripartite state is a genuinely entangled state when the range of both bipartite states are entanglement-breaking subspaces. We further investigate the tripartite state when one of the two bipartite states has rank two. Our results provide the latest progress on a conjecture proposed in the paper [Yi Shen et al, J. Phys. A 53, 125302 (2020)]. We apply our results to construct multipartite states whose bipartite reduced density operators have additive EOF. Further, such states are distillable across every bipartition under local operations and classical communications.

show abstract

“…Genuine multipartite entanglement offers significant advantages compared with bipartite entanglement in quantum tasks [1][2][3]. Multipartite private states from which secret keys are directly accessible to trusted partners are genuinely multipartite entangled states [4]. Furthermore, genuine entanglement (GE) is the basic ingredient in measurementbased quantum computation [5,6], and is beneficial in various quantum communication protocols [7].…”

Section: Introductionmentioning

confidence: 99%

Detection of genuine tripartite entanglement by two bipartite entangled states

Sun¹,

Chen²

2020

Preprint

View full text Add to dashboard Cite

It is an interesting problem to construct genuine tripartite entangled states based on the collective use of two bipartite entangled states. We consider the case that the states are two-qubit Werner states, we construct the interval of parameter of Werner states such that the tripartite state is genuine entangled. Further, we present the way of detecting the tripartite genuine entanglement using current techniques in experiments. We also investigate the lower bound of genuine multipartite entanglement concurrence.

show abstract

Universal Limitations on Quantum Key Distribution over a Network

Cited by 38 publications

References 131 publications

Multipartite entanglement and secret key distribution in quantum networks

Multipartite entanglement and secret key distribution in quantum networks

Tripartite genuinely entangled states from entanglement-breaking subspaces

Detection of genuine tripartite entanglement by two bipartite entangled states

Contact Info

Product

Resources

About