Composable end-to-end security of Gaussian quantum networks with untrusted relays

Masoud Ghalaii; Panagiotis Papanastasiou; Stefano Pirandola

doi:10.1038/s41534-022-00620-5

Composable end-to-end security of Gaussian quantum networks with untrusted relays

Masoud Ghalaii, Panagiotis Papanastasiou, Stefano Pirandola

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

Gaussian networks are fundamental objects in network information theory. Here many senders and receivers are connected by physically motivated Gaussian channels while auxiliary Gaussian components, such as Gaussian relays, are entailed. Whilst the theoretical backbone of classical Gaussian networks is well established, the quantum analogue is yet immature. Here, we theoretically tackle composable security of arbitrary Gaussian quantum networks (quantum networks), with generally untrusted nodes, in the finite-size regime. We put forward a general methodology for parameter estimation, which is only based on the data shared by the remote end-users. Taking a chain of identical quantum links as an example, we further demonstrate our study. Additionally, we find that the key rate of a quantum amplifier-assisted chain can ideally beat the fundamental repeaterless limit with practical block sizes. However, this objective is practically questioned leading the way to new network/chain designs.

Original language	English
Article number	105
Journal	npj Quantum Information
Volume	8
DOIs	https://doi.org/10.1038/s41534-022-00620-5
Publication status	Published - 8 Sept 2022

Keywords

quant-ph

Access to Document

10.1038/s41534-022-00620-5

2203.11969v3Accepted author manuscript, 3.16 MB

Cite this

@article{b30f41a0f58d496e8708651e2b2ddafc,

title = "Composable end-to-end security of Gaussian quantum networks with untrusted relays",

abstract = "Gaussian networks are fundamental objects in network information theory. Here many senders and receivers are connected by physically motivated Gaussian channels while auxiliary Gaussian components, such as Gaussian relays, are entailed. Whilst the theoretical backbone of classical Gaussian networks is well established, the quantum analogue is yet immature. Here, we theoretically tackle composable security of arbitrary Gaussian quantum networks (quantum networks), with generally untrusted nodes, in the finite-size regime. We put forward a general methodology for parameter estimation, which is only based on the data shared by the remote end-users. Taking a chain of identical quantum links as an example, we further demonstrate our study. Additionally, we find that the key rate of a quantum amplifier-assisted chain can ideally beat the fundamental repeaterless limit with practical block sizes. However, this objective is practically questioned leading the way to new network/chain designs.",

keywords = "quant-ph",

author = "Masoud Ghalaii and Panagiotis Papanastasiou and Stefano Pirandola",

year = "2022",

month = sep,

day = "8",

doi = "10.1038/s41534-022-00620-5",

language = "English",

volume = "8",

journal = "npj Quantum Information",

issn = "2056-6387",

publisher = "Springer",

}

TY - JOUR

T1 - Composable end-to-end security of Gaussian quantum networks with untrusted relays

AU - Ghalaii, Masoud

AU - Papanastasiou, Panagiotis

AU - Pirandola, Stefano

PY - 2022/9/8

Y1 - 2022/9/8

N2 - Gaussian networks are fundamental objects in network information theory. Here many senders and receivers are connected by physically motivated Gaussian channels while auxiliary Gaussian components, such as Gaussian relays, are entailed. Whilst the theoretical backbone of classical Gaussian networks is well established, the quantum analogue is yet immature. Here, we theoretically tackle composable security of arbitrary Gaussian quantum networks (quantum networks), with generally untrusted nodes, in the finite-size regime. We put forward a general methodology for parameter estimation, which is only based on the data shared by the remote end-users. Taking a chain of identical quantum links as an example, we further demonstrate our study. Additionally, we find that the key rate of a quantum amplifier-assisted chain can ideally beat the fundamental repeaterless limit with practical block sizes. However, this objective is practically questioned leading the way to new network/chain designs.

AB - Gaussian networks are fundamental objects in network information theory. Here many senders and receivers are connected by physically motivated Gaussian channels while auxiliary Gaussian components, such as Gaussian relays, are entailed. Whilst the theoretical backbone of classical Gaussian networks is well established, the quantum analogue is yet immature. Here, we theoretically tackle composable security of arbitrary Gaussian quantum networks (quantum networks), with generally untrusted nodes, in the finite-size regime. We put forward a general methodology for parameter estimation, which is only based on the data shared by the remote end-users. Taking a chain of identical quantum links as an example, we further demonstrate our study. Additionally, we find that the key rate of a quantum amplifier-assisted chain can ideally beat the fundamental repeaterless limit with practical block sizes. However, this objective is practically questioned leading the way to new network/chain designs.

KW - quant-ph

U2 - 10.1038/s41534-022-00620-5

DO - 10.1038/s41534-022-00620-5

M3 - Article

SN - 2056-6387

VL - 8

JO - npj Quantum Information

JF - npj Quantum Information

M1 - 105

ER -