2019
DOI: 10.1140/epjd/e2018-90351-0
|View full text |Cite
|
Sign up to set email alerts
|

Improving the lower bound to the secret-key capacity of the thermal amplifier channel

Abstract: We consider the noisy thermal amplifier channel, where signal modes are amplified together with environmental thermal modes. We focus on the secret-key capacity of this channel, which is the maximum amount of secret bits that two remote parties can generate by means of the most general adaptive protocol, assisted by unlimited and two-way classical communication. For this channel only upper and lower bounds are known, and in this work we improve the lower bound. We consider a protocol based on squeezed states a… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 65 publications
(69 reference statements)
0
8
0
Order By: Relevance
“…[384][385][386] and later in Refs. [387][388][389] as a tool to increase the lower bound to the secret key capacity of the thermal-loss and amplifier channels.…”
Section: E Ideal Performances In a Thermal-loss Channelmentioning
confidence: 99%
See 1 more Smart Citation
“…[384][385][386] and later in Refs. [387][388][389] as a tool to increase the lower bound to the secret key capacity of the thermal-loss and amplifier channels.…”
Section: E Ideal Performances In a Thermal-loss Channelmentioning
confidence: 99%
“…[34,387]. Similarly, for the noisy amplifier, we know [388] trusted-noise protocols that are able to beat the CI of the channel, which is therefore not tight. The non-tightness of the CI (and RCI) is also a feature in the computation of energy-constrained quantum capacities of bosonic Gaussian channels [626].…”
Section: K Open Problemsmentioning
confidence: 99%
“…In this paper, we find a new lower bound on all twoway capacities of piBGCs, which constitutes a significant improvement with respect the state-of-the-art lower bounds [24][25][26][27][28] in many parameter regions. In particular, we completely solve the above open problem, quantitatively establishing that piBGCs can be used to distribute pure entanglement -and hence also secret key -whenever they are not entanglement breaking.…”
Section: Resultsmentioning
confidence: 96%
“…Although the right-hand sides of ( 18)-( 20) also lower bound the secret-key capacity K, improved estimates of K(E λ,ν ) and K(Φ g,ν ) have been put forth by Ottaviani et al [26] (see also [27,Sec. VII]) and by Wong, Ottaviani, Guo, and Pirandola (WOGP) [28], respectively. Lower bounds on the EC two-way capacities with energy constraint N s of piBGCs are the coherent information and the reverse coherent information evaluated on the state obtained by sending the subsystem A of |Ψ Ns AA through the channel.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation