Cosmo Lupo

dblp:86/8033 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2016
0000-0002-5227-4009ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Quantum computing and quantum information · 74% Information theory · 26%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum cryptography
quantum data hiding
0.212016
Quantum Data Hiding in the Presence of Noise · IEEE Trans. Inf. Theory 2016
Information theory › channel capacity › capacity analysis
capacity estimation
0.112012
Methods for Estimating Capacities and Rates of Gaussian Quantum Channels · IEEE Trans. Inf. Theory 2012
Quantum computing and quantum information › quantum channel capacity
classical capacity
0.112012
Methods for Estimating Capacities and Rates of Gaussian Quantum Channels · IEEE Trans. Inf. Theory 2012
Information theory › information measures
holevo information
0.112012
Methods for Estimating Capacities and Rates of Gaussian Quantum Channels · IEEE Trans. Inf. Theory 2012
Quantum computing and quantum information
quantum channel
0.112012
Methods for Estimating Capacities and Rates of Gaussian Quantum Channels · IEEE Trans. Inf. Theory 2012
Quantum computing and quantum information › quantum channel
quantum gaussian channels
0.112012
Methods for Estimating Capacities and Rates of Gaussian Quantum Channels · IEEE Trans. Inf. Theory 2012
Quantum computing and quantum information › quantum channel
quantum broadcast channel
0.112016
Quantum Data Hiding in the Presence of Noise · IEEE Trans. Inf. Theory 2016

Methods — techniques the papers use, named apart from their topics

regularized upper bound · 0.2coherent-state encoding · 0.2optimization methods · 0.1heterodyne and homodyne measurement · 0.1
YearPublicationVenuePosition
2016 Quantum Data Hiding in the Presence of Noise
abstract
When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data, such that the receivers cannot recover it when performing local operations and classical communication, but they can reliably decode if they bring their systems together and perform a collective measurement. This phenomenon is known as quantum data hiding and hitherto has been studied under the assumption that noise does not affect the encoded systems. With the aim of applying the quantum data hiding effect in practical scenarios, here, we define the data-hiding capacity for hiding classical information using a quantum channel. Using this notion, we establish a regularized upper bound on the data hiding capacity of any quantum broadcast channel, and we prove that coherent-state encodings have a strong limitation on their data hiding rates. We, then, prove a lower bound on the data hiding capacity of channels that map the maximally mixed state to the maximally mixed state (we call these channels mictodiactic-they can be seen as a generalization of unital channels when the input and output spaces are not necessarily isomorphic) and argue how to extend this bound to generic channels and to more than two receivers.
Cosmo Lupo, Mark M. Wilde, Seth Lloyd
IEEE Trans. Inf. Theory1
2012 Methods for Estimating Capacities and Rates of Gaussian Quantum Channels
abstract
Optimization methods aimed at estimating the capacities of a general Gaussian channel are developed. Specifically evaluation of classical capacity as maximum of the Holevo information is pursued over all possible Gaussian encodings for the lossy bosonic channel, but extension to other capacities and other Gaussian channels seems feasible. Solutions for both memoryless and memory channels are presented. It is first dealt with single-use (single-mode) channel where the capacity dependence on channel's parameters is analyzed providing the full classification of possible cases. Then, it is dealt with multiple uses (multimode) channel where the capacity dependence on the (multimode) environment state is analyzed when both total environment energy and environment purity are fixed. This allows a fair comparison among different environments, thus understanding the role of memory (intermode correlations) and phenomenon like superadditivity of the capacity. The developed methods are also used for deriving transmission rates with heterodyne and homodyne measurements at the channel output. Classical capacity and transmission rates are presented within a unique framework where the rates can be treated as logarithmic approximations of the capacity.
Oleg V. Pilyavets, Cosmo Lupo, Stefano Mancini
IEEE Trans. Inf. Theory2