Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Iran Workshop on Communication and Information Theory (IWCIT)

From source model to quantum key distillation: An improved upper bound

Kamran Keykhosravi, Majid Mahzoon, Amin Gohari, Mohammad Reza Aref

Published May 1, 2014• 8 citations
Publisher

Abstract

In this paper we derive a new upper bound on the quantum key distillation capacity. This upper bound is an extension of the classical bound of Gohari and Anantharam on the source model problem. Our bound strictly improves the quantum extension of reduced intrinsic information bound of Christandl et al. Although this bound is proposed for quantum settings, it also serves as an upper bound for the special case of classical source model, and may improve the bound of Gohari and Anantharam. The problem of quantum key distillation is one in which two distant parties, Alice and Bob, and an adversary, Eve, have access to copies of quantum systems A, B, E respectively, prepared jointly according to an arbitrary state ρABE. Alice and Bob desire to distill secret key bits that are secure from Eve, using only local quantum operations and authenticated public classical communication (LOPC).

DOI
10.1109/iwcit.2014.6842497

Related papers

Distillation of secret key and entanglement from quantum states

Igor Devetak, Andreas Winter

We study and solve the problem of distilling a secret key from quantum states representing correlation between two parties (Alice and Bob) and an eavesdropper (Eve) via one–way public discussion: we prove a coding theorem to achieve the ‘wire–tapper’ bound, the difference of the mutual information Alice–Bob and that of Alice–Eve, for so–called classical–quantum–quantum–correlations, via one–way public communication. This result yields information–theoretic formulae for the distillable secret key, giving ‘ultimate’ key rate bounds if Eve is assumed to possess a purification of Alice and Bob's joint state. Specializing our protocol somewhat and making it coherent leads us to a protocol of entanglement distillation via one–way LOCC (local operations and classical communication) which is asymptotically optimal: in fact we prove the so–called ‘hashing inequality’, which says that the coherent information (i.e. the negative conditional von Neumann entropy) is an achievable Einstein–Podolsky–Rosen rate. This result is known to imply a whole set of distillation and capacity formulae, which we briefly review.

arXiv:quant-ph/0306078•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Oct 19, 2004•1,088 citations

Quantum Versus Classical Advantages in Secret Key Distillation (and Their Links to Quantum Entanglement)

Eric Chitambar, Ben Fortescue, Min-Hsiu Hsieh

We consider the extraction of shared secret key from correlations that are generated by either a classical or quantum source. In the classical setting, two honest parties (Alice and Bob) use public discussion and local randomness to distill secret key from some distribution $p_{XYZ}$ that is shared with an unwanted eavesdropper (Eve). In the quantum settings, the correlations $p_{XYZ}$ are delivered to the parties as either an \textit{incoherent} mixture of orthogonal quantum states or as \textit{coherent} superposition of such states; in both cases, Alice and Bob use public discussion and local quantum operations to distill secret key. While the power of quantum mechanics increases Alice and Bob's ability to generate shared randomness, it also equips Eve with a greater arsenal of eavesdropping attacks. Therefore, it is not obvious who gains the greatest advantage for distilling secret key when replacing a classical source with a quantum one. In this paper we first demonstrate that the classical key rate is equivalent to the quantum key rate when the correlations are generated incoherently in the quantum setting. For coherent sources, we next show that the rates are incomparable, and in fact, their difference can be arbitrarily large in either direction. However, we identify a large class of non-trivial distributions $p_{XYZ}$ that possess the following properties: (i) Eve's advantage is always greater in the quantum source than in its classical counterpart, and (ii) for the quantum entanglement shared between Alice and Bob in the coherent source, the so-called entanglement cost/squashed entanglement/relative entropy of entanglement can all be computed. With property (ii), we thus present a rare instance in which the various entropic entanglement measures of a quantum state can be explicitly calculated.

arXiv:1510.07344•Oct 26, 2015•0 citations

Multi-Party Quantum Purity Distillation with Bounded Classical Communication

Touheed Anwar Atif, S. Sandeep Pradhan

We consider the task of distilling local purity from a noisy quantum state ρABC, wherein we provide a protocol for three parties, Alice, Bob and Charlie, to distill local purity (at a rate P) from many independent copies of a given quantum state ρABC. The three parties have access to their respective subsystems of ρABC, and are only allowed to use local unitary operations. In addition, Alice and Bob can communicate with Charlie using a one-way multiple-access dephasing channel of link rates R1and R2, respectively. The objective of the protocol is to minimize the usage of the dephasing channel (in terms of rates R1and R2) while maximizing the asymptotic purity that can be jointly distilled from ρABC. To achieve this, we employ ideas from distributed measurement compression protocols, and in turn, characterize a set of sufficient conditions on (P, R1,R2) in terms of quantum information theoretic quantities such that P amount of purity can be distilled using rates R1and R2.

arXiv:2203.05511•IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•4 citations

Local purity distillation with bounded classical communication

Hari Krovi, Igor Devetak

Local pure states are an important resource for quantum computing. The problem of distilling local pure states from mixed ones can be cast in an information theoretic paradigm. The bipartite version of this problem where local purity must be distilled from an arbitrary quantum state shared between two parties, Alice and Bob, is closely related to the problem of separating quantum and classical correlations in the state and in particular, to a measure of classical correlations called the one-way distillable common randomness. In Phys. Rev. A 71, 062303 (2005), the optimal rate of local purity distillation is derived when many copies of a bipartite quantum state are shared between Alice and Bob, and the parties are allowed unlimited use of a unidirectional dephasing channel. In the present paper, we extend this result to the setting in which the use of the channel is bounded. We demonstrate that in the case of a classical-quantum system, the expression for the local purity distilled is efficiently computable and provide examples with their tradeoff curves.

arXiv:0705.4089•Physical Review A•Jul 18, 2007•17 citations

Secret-Key Distillation across a Quantum Wiretap Channel under Restricted Eavesdropping

Ziwen Pan, Kaushik P. Seshadreesan, William Clark +4 more

The theory of quantum cryptography aims to guarantee unconditional information-theoretic security against an omnipotent eavesdropper. In many practical scenarios, however, the assumption of an all-powerful adversary is excessive and can be relaxed considerably. In this paper we study secret-key distillation across a lossy and noisy quantum wiretap channel between Alice and Bob, with a separately parameterized realistically lossy quantum channel to the eavesdropper Eve. We show that under such restricted eavesdropping, the key rates achievable can exceed the secret-key-distillation capacity against an unrestricted eavesdropper in the quantum wiretap channel. Furthermore, we show upper bounds on the key rates based on the relative entropy of entanglement. This simple restricted eavesdropping model is widely applicable, for example, to free-space quantum optical communication, where realistic collection of light by Eve is limited by the finite size of her optical aperture. Future work will include calculating bounds on the amount of light Eve can collect under various realistic scenarios.

arXiv:1903.03136•Physical Review Applied•Aug 17, 2020•46 citations

Extendibility limits quantum-secured communication and key distillation

Vishal Singh, Mark M. Wilde

Secret-key distillation from quantum states and channels is a central task of interest in quantum information theory, as it facilitates private communication over a quantum network. Here, we study the task of secret-key distillation from bipartite states and point-to-point quantum channels using local operations and one-way classical communication (one-way LOCC). We employ the resource theory of unextendible entanglement to study the transformation of a bipartite state under one-way LOCC, and we obtain several efficiently computable upper bounds on the number of secret bits that can be distilled from a bipartite state using one-way LOCC channels; these findings apply not only in the one-shot setting but also in some restricted asymptotic settings. We extend our formalism to private communication over a quantum channel assisted by forward classical communication. We obtain efficiently computable upper bounds on the one-shot forward-assisted private capacity of a channel, thus addressing a question in the theory of quantum-secured communication that has been open for some time now. Our formalism also provides upper bounds on the rate of private communication when using a large number of channels in such a way that the error in the transmitted private data decreases exponentially with the number of channel uses. Moreover, our bounds can be computed using semidefinite programs, thus providing a computationally feasible method to understand the limits of private communication over a quantum network.

arXiv:2410.21393•Reports on Progress in Physics•Apr 15, 2025•3 citations
In this paper we derive a new upper bound on the quantum key distillation capacity. This upper bound is an extension of the classical bound of Gohari and Anantharam on the source model problem. Our bound strictly improves the quantum extension of reduced intrinsic information bound of Christandl et al. Although this bound is proposed for quantum settings, it also serves as an upper bound for the special case of classical source model, and may improve the bound of Gohari and Anantharam. The problem of quantum key distillation is one in which two distant parties, Alice and Bob, and an adversary, Eve, have access to copies of quantum systems A, B, E respectively, prepared jointly according to an arbitrary state ρABE. Alice and Bob desire to distill secret key bits that are secure from Eve, using only local quantum operations and authenticated public classical communication (LOPC).
We study and solve the problem of distilling a secret key from quantum states representing correlation between two parties (Alice and Bob) and an eavesdropper (Eve) via one–way public discussion: we prove a coding theorem to achieve the ‘wire–tapper’ bound, the difference of the mutual information Alice–Bob and that of Alice–Eve, for so–called classical–quantum–quantum–correlations, via one–way public communication. This result yields information–theoretic formulae for the distillable secret key, giving ‘ultimate’ key rate bounds if Eve is assumed to possess a purification of Alice and Bob's joint state. Specializing our protocol somewhat and making it coherent leads us to a protocol of entanglement distillation via one–way LOCC (local operations and classical communication) which is asymptotically optimal: in fact we prove the so–called ‘hashing inequality’, which says that the coherent information (i.e. the negative conditional von Neumann entropy) is an achievable Einstein–Podolsky–Rosen rate. This result is known to imply a whole set of distillation and capacity formulae, which we briefly review.
We consider the extraction of shared secret key from correlations that are generated by either a classical or quantum source. In the classical setting, two honest parties (Alice and Bob) use public discussion and local randomness to distill secret key from some distribution pXYZp_{XYZ}pXYZ​ that is shared with an unwanted eavesdropper (Eve). In the quantum settings, the correlations pXYZp_{XYZ}pXYZ​ are delivered to the parties as either an \textit{incoherent} mixture of orthogonal quantum states or as \textit{coherent} superposition of such states; in both cases, Alice and Bob use public discussion and local quantum operations to distill secret key. While the power of quantum mechanics increases Alice and Bob's ability to generate shared randomness, it also equips Eve with a greater arsenal of eavesdropping attacks. Therefore, it is not obvious who gains the greatest advantage for distilling secret key when replacing a classical source with a quantum one. In this paper we first demonstrate that the classical key rate is equivalent to the quantum key rate when the correlations are generated incoherently in the quantum setting. For coherent sources, we next show that the rates are incomparable, and in fact, their difference can be arbitrarily large in either direction. However, we identify a large class of non-trivial distributions pXYZp_{XYZ}pXYZ​ that possess the following properties: (i) Eve's advantage is always greater in the quantum source than in its classical counterpart, and (ii) for the quantum entanglement shared between Alice and Bob in the coherent source, the so-called entanglement cost/squashed entanglement/relative entropy of entanglement can all be computed. With property (ii), we thus present a rare instance in which the various entropic entanglement measures of a quantum state can be explicitly calculated.
We consider the task of distilling local purity from a noisy quantum state ρABC, wherein we provide a protocol for three parties, Alice, Bob and Charlie, to distill local purity (at a rate P) from many independent copies of a given quantum state ρABC. The three parties have access to their respective subsystems of ρABC, and are only allowed to use local unitary operations. In addition, Alice and Bob can communicate with Charlie using a one-way multiple-access dephasing channel of link rates R1and R2, respectively. The objective of the protocol is to minimize the usage of the dephasing channel (in terms of rates R1and R2) while maximizing the asymptotic purity that can be jointly distilled from ρABC. To achieve this, we employ ideas from distributed measurement compression protocols, and in turn, characterize a set of sufficient conditions on (P, R1,R2) in terms of quantum information theoretic quantities such that P amount of purity can be distilled using rates R1and R2.
Local pure states are an important resource for quantum computing. The problem of distilling local pure states from mixed ones can be cast in an information theoretic paradigm. The bipartite version of this problem where local purity must be distilled from an arbitrary quantum state shared between two parties, Alice and Bob, is closely related to the problem of separating quantum and classical correlations in the state and in particular, to a measure of classical correlations called the one-way distillable common randomness. In Phys. Rev. A 71, 062303 (2005), the optimal rate of local purity distillation is derived when many copies of a bipartite quantum state are shared between Alice and Bob, and the parties are allowed unlimited use of a unidirectional dephasing channel. In the present paper, we extend this result to the setting in which the use of the channel is bounded. We demonstrate that in the case of a classical-quantum system, the expression for the local purity distilled is efficiently computable and provide examples with their tradeoff curves.
The theory of quantum cryptography aims to guarantee unconditional information-theoretic security against an omnipotent eavesdropper. In many practical scenarios, however, the assumption of an all-powerful adversary is excessive and can be relaxed considerably. In this paper we study secret-key distillation across a lossy and noisy quantum wiretap channel between Alice and Bob, with a separately parameterized realistically lossy quantum channel to the eavesdropper Eve. We show that under such restricted eavesdropping, the key rates achievable can exceed the secret-key-distillation capacity against an unrestricted eavesdropper in the quantum wiretap channel. Furthermore, we show upper bounds on the key rates based on the relative entropy of entanglement. This simple restricted eavesdropping model is widely applicable, for example, to free-space quantum optical communication, where realistic collection of light by Eve is limited by the finite size of her optical aperture. Future work will include calculating bounds on the amount of light Eve can collect under various realistic scenarios.
Secret-key distillation from quantum states and channels is a central task of interest in quantum information theory, as it facilitates private communication over a quantum network. Here, we study the task of secret-key distillation from bipartite states and point-to-point quantum channels using local operations and one-way classical communication (one-way LOCC). We employ the resource theory of unextendible entanglement to study the transformation of a bipartite state under one-way LOCC, and we obtain several efficiently computable upper bounds on the number of secret bits that can be distilled from a bipartite state using one-way LOCC channels; these findings apply not only in the one-shot setting but also in some restricted asymptotic settings. We extend our formalism to private communication over a quantum channel assisted by forward classical communication. We obtain efficiently computable upper bounds on the one-shot forward-assisted private capacity of a channel, thus addressing a question in the theory of quantum-secured communication that has been open for some time now. Our formalism also provides upper bounds on the rate of private communication when using a large number of channels in such a way that the error in the transmitted private data decreases exponentially with the number of channel uses. Moreover, our bounds can be computed using semidefinite programs, thus providing a computationally feasible method to understand the limits of private communication over a quantum network.