Alessandro Falco

dblp:412/3635 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0004-3586-9491ORCID · reported

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

Theory of computation · 1 · 1 first-author · 1 since 2021

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
1 paper
Quantum computing and quantum information · 83% Information theory · 17%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
entanglement measures
0.912025
The Multimode Conditional Quantum Entropy Power Inequality and the Squashed Entanglement of the Extreme Multimode Bosonic Gaussian Channels · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information
quantum channel
0.912025
The Multimode Conditional Quantum Entropy Power Inequality and the Squashed Entanglement of the Extreme Multimode Bosonic Gaussian Channels · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information
quantum communication
0.912025
The Multimode Conditional Quantum Entropy Power Inequality and the Squashed Entanglement of the Extreme Multimode Bosonic Gaussian Channels · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum channel
quantum gaussian channels
0.912025
The Multimode Conditional Quantum Entropy Power Inequality and the Squashed Entanglement of the Extreme Multimode Bosonic Gaussian Channels · IEEE Trans. Inf. Theory 2025
Information theory › information-theoretic security
secret key capacity
0.912025
The Multimode Conditional Quantum Entropy Power Inequality and the Squashed Entanglement of the Extreme Multimode Bosonic Gaussian Channels · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › entanglement measures
squashed entanglement
0.912025
The Multimode Conditional Quantum Entropy Power Inequality and the Squashed Entanglement of the Extreme Multimode Bosonic Gaussian Channels · IEEE Trans. Inf. Theory 2025

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

von neumann entropy · 0.9conditional quantum entropy power inequality · 0.9
YearPublicationVenuePosition
2025 The Multimode Conditional Quantum Entropy Power Inequality and the Squashed Entanglement of the Extreme Multimode Bosonic Gaussian Channels
abstract
We prove the multimode conditional quantum Entropy Power Inequality for bosonic quantum systems. This inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes among all the input states of the modes with given conditional entropies. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime, which provides the most promising platform for quantum communication and quantum key distribution. We apply our multimode conditional quantum Entropy Power Inequality to determine new lower bounds to the squashed entanglement of a large family of bosonic quantum Gaussian states. The squashed entanglement is one of the main entanglement measures in quantum communication theory, providing the best known upper bound to the distillable key. Exploiting this result, we determine a new lower bound to the squashed entanglement of the multimode bosonic Gaussian channels that are extreme,i.e., that cannot be decomposed as a non-trivial convex combination of quantum channels. The squashed entanglement of a quantum channel provides an upper bound to its secret-key capacity,i.e., the capacity to generate a secret key shared between the sender and the receiver. Lower bounds to the squashed entanglement are notoriously hard to prove. Our results contribute to break this barrier and will stimulate further research in the field of quantum communication with bosonic quantum systems.
Alessandro Falco, Giacomo De Palma
IEEE Trans. Inf. Theory1