English
Related papers

Related papers: Extendibility limits quantum-secured communication…

200 papers

The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it.…

Quantum Physics · Physics 2017-01-16 Ioannis Kogias , Yu Xiang , Qiongyi He , Gerardo Adesso

The potential impact of future quantum networks hinges on high-quality quantum entanglement shared between network nodes. Unavoidable real-world imperfections necessitate means to improve remote entanglement by local quantum operations.…

We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum…

Quantum Physics · Physics 2019-03-19 Anurag Anshu , Rahul Jain , Naqueeb Ahmad Warsi

We analyze the set of two-qubit states from which a secret key can be extracted by single-copy measurements plus classical processing of the outcomes. We introduce a key distillation protocol and give the corresponding necessary and…

Quantum Physics · Physics 2016-08-16 A. Acín , J. Bae , E. Bagan , M. Baig , Ll. Masanes , R. Muñoz-Tapia

In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is,…

Quantum Physics · Physics 2010-07-19 Ciara Morgan

Quantum communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that…

Quantum Physics · Physics 2017-04-27 Stefano Pirandola , Riccardo Laurenza , Carlo Ottaviani , Leonardo Banchi

Secure quantum conferencing refers to a protocol where a number of trusted users generate exactly the same secret key to confidentially broadcast private messages. By a modification of the techniques first introduced in [Pirandola,…

Quantum Physics · Physics 2022-02-09 Stefano Pirandola

We extend the formalism of cluster state quantum secret sharing, as presented in Markham and Sanders [Phys. Rev. A 78, 042309 (2008)] and Keet et al. [Phy. Rev. A 82, 062315 (2010)], to the continuous-variable regime. We show that both…

Quantum Physics · Physics 2013-10-15 Hoi-Kwan Lau , Christian Weedbrook

We introduce an alternative type of quantum repeater for long-range quantum communication with improved scaling with the distance. We show that by employing hashing, a deterministic entanglement distillation protocol with one-way…

Quantum Physics · Physics 2018-01-24 M. Zwerger , A. Pirker , V. Dunjko , H. J. Briegel , W. Dür

We addressed the question of optimality of private quantum channels. We have shown that the Shannon entropy of the classical key necessary to securely transfer the quantum information is lower bounded by the entropy exchange of the private…

Quantum Physics · Physics 2009-11-13 Jan Bouda , Mario Ziman

We show that the phenomenon of superadditivity of distillable entanglement observed in multipartite quantum systems results from the consideration of states created during the execution of the standard end-to-end quantum teleportation…

Quantum Physics · Physics 2009-11-13 Somshubhro Bandyopadhyay , Vwani Roychowdhury

We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel, assisted with a limited amount of shared entanglement. We derive direct and converse bounds for the one-shot capacity…

Quantum Physics · Physics 2023-02-14 Eyuri Wakakuwa , Yoshifumi Nakata

A quantum generalized divergence by definition satisfies the data-processing inequality; as such, the relative decrease in such a divergence under the action of a quantum channel is at most one. This relative decrease is formally known as…

Quantum Physics · Physics 2025-11-06 Theshani Nuradha , Mark M. Wilde

Quantum capacity quantifies the amount of quantum information that can be transmitted by a quantum channel with an arbitrary small probability of error. Mathematically, the quantum capacity is given by an asymptotic formula involving the…

Quantum Physics · Physics 2025-12-30 Zhen Wu , Zhihao Ma , James Fullwood

We extend covert communication to the quantum regime by showing that covert quantum communication is possible over optical channels with noise arising either from the environment or from the sender's lab. In particular, we show that…

Quantum Physics · Physics 2016-12-21 Juan Miguel Arrazola , Valerio Scarani

We provide a simple security proof for prepare & measure quantum key distribution protocols employing noisy processing and one-way postprocessing of the key. This is achieved by showing that the security of such a protocol is equivalent to…

Quantum Physics · Physics 2007-05-23 Joseph M. Renes , Graeme Smith

We establish fundamental upper bounds on the amount of secret key that can be extracted from quantum Gaussian states by using only local Gaussian operations, local classical processing, and public communication. For one-way public…

Quantum Physics · Physics 2023-10-03 Ludovico Lami , Ladislav Mišta, , Gerardo Adesso

Basing on unified approach to {\it all} kinds of quantum capacities we show that the rate of quantum information transmission is bounded by the maximal attainable rate of coherent information. Moreover, we show that, if for any bipartite…

Quantum Physics · Physics 2009-11-06 Michal Horodecki , Pawel Horodecki , Ryszard Horodecki

Shared entanglement can significantly amplify classical correlations between systems interacting over a limited quantum channel. A natural avenue is to use entanglement of the same dimension as the channel because this allows for unitary…

We show that covert secret key expansion is possible using a public authenticated classical channel and a quantum channel largely under control of an adversary, which we precisely define. We also prove a converse result showing that, under…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Matthieu R. Bloch