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

arXiv:2511.04438

Limiting one-way distillable secret key via privacy testing of extendible states

Vishal Singh, Karol Horodecki, Aby Philip, Mark M. Wilde

quant-phcs.ITSubmitted Nov 6, 2025• Announced Nov 7, 2025• 1 citation
arXivHTMLPDF

Abstract

The notions of privacy tests and $k$-extendible states have both been instrumental in quantum information theory, particularly in understanding the limits of secure communication. In this paper, we determine the maximum probability with which an arbitrary $k$-extendible state can pass a privacy test, and we prove that it is equal to the maximum fidelity between an arbitrary $k$-extendible state and the standard maximally entangled state. Our findings, coupled with the resource theory of $k$-unextendibility, lead to an efficiently computable upper bound on the one-shot, one-way distillable key of a bipartite state, and we prove that it is equal to the best-known efficiently computable upper bound on the one-shot, one-way distillable entanglement. We also establish efficiently computable upper bounds on the one-shot, forward-assisted private capacity of channels. Extending our formalism to the independent and identically distributed setting, we obtain single-letter efficiently computable bounds on the $n$-shot, one-way distillable key of a state and the $n$-shot, forward-assisted private capacity of a channel. For some key examples of interest, our bounds are significantly tighter than other known efficiently computable bounds.

Comments
31+10 pages, 4 figures

Related papers

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

Limits on secure communication over quantum networks via extendibility

Vishal Singh

A quantum network promises unconditionally secure transmission of data between its nodes by utilizing its ability to distribute entanglement across distant nodes. However, for most practical purposes, the distribution of entanglement is affected by environmental noise. We study the limits of secure communication between two parties sharing an arbitrary bipartite state or an arbitrary quantum channel under the one-way local operations and classical communication (one-way LOCC) setting, particularly for the non-asymptotic case. We use the ideas of unextendibility of entanglement to quantify the resourcefulness of a bipartite state or a quantum channel for forward-assisted private communication between its bearers, which we use to establish limits on the number of secret bits that can be established between the two parties either exactly, or probabilistically, or approximately. Our results surpass several previously known limits on secure communication under the considered setting. Additionally, several bounds presented in our work are efficiently computable, including the bounds on the one-shot private capacity of a channel, which are the first efficiently computable bounds on these quantities to the best of our knowledge.

•Jan 1, 2025•0 citations

Unextendible Entanglement of Quantum Channels

Vishal Singh, Mark M. Wilde

Quantum communication relies on the existence of high quality quantum channels to exchange information. In practice, however, all communication links are affected by noise from the environment. Here we investigate the ability of quantum channels to perform quantum communication tasks by restricting the participants to use only local operations and one-way classical communication (one-way LOCC) along with the available quantum channel. In particular, a channel can be used to distill a highly entangled state between two parties, which further enables quantum or private communication. In this work, we invoke the framework of superchannels to study the distillation of a resourceful quantum state, such as a maximally entangled state or a private state, using multiple instances of a point-to-point quantum channel. We use the idea ofk-extendibility to obtain a semidefinite relaxation of the set of one-way LOCC superchannels and define a class of entanglement measures for quantum channels that decrease monotonically under such superchannels; therefore these measures, dubbed collectively the “unextendible entanglement of a channel”, yield upper bounds on several communication-theoretic quantities of interest in the regimes of resource distillation and zero error.We then generalize the formalism ofk-extendibility to bipartite superchannels, thus obtaining functions that are monotone under two-extendible superchannels. This allows us to analyze probabilistic distillation of ebits or secret key bits from a bipartite state when using a resourceful quantum channel. Moreover, we propose semidefinite programs to evaluate several of these quantities, providing a computationally feasible method of comparison between quantum channels for resource distillation.

arXiv:2407.15944•IEEE Transactions on Information Theory•May 7, 2025•3 citations

Extendible Quantum Measurements and Limitations on Classical Communication

Vishal Singh, Theshani Nuradha, Mark M. Wilde

Unextendibility of quantum states and channels is inextricably linked to the no-cloning theorem of quantum mechanics, it has played an important role in understanding and quantifying entanglement, and more recently it has found applications in providing limitations on quantum error correction and entanglement distillation. Here we generalize the framework of unextendibility to quantum measurements and define $k$-extendible measurements for every integer $k\ge 2$. Our definition provides a hierarchy of semidefinite constraints that specify a set of measurements containing every measurement that can be realized by local operations and one-way classical communication. Furthermore, the set of $k$-extendible measurements converges to the set of measurements that can be realized by local operations and one-way classical communication as $k\to \infty$. To illustrate the utility of $k$-extendible measurements, we establish a semidefinite programming upper bound on the one-shot classical capacity of a channel, which outperforms the best known efficiently computable bound from [Matthews and Wehner, IEEE Trans. Inf. Theory 60, pp. 7317-7329 (2014)] and also leads to efficiently computable upper bounds on the $n$-shot classical capacity of a channel.

arXiv:2412.18556•IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•4 citations

Degradable states and one-way entanglement distillation

Felix Leditzky, Nilanjana Datta, Graeme Smith

We derive an upper bound on the one-way distillable entanglement of bipartite quantum states. To this end, we revisit the notion of degradable, conjugate degradable, and antidegrad-able bipartite quantum states [1]. We prove that for degradable and conjugate degradable states the one-way distillable entanglement is equal to the coherent information, and thus given by a single-letter formula. Furthermore, it is well-known that the one-way distillable entanglement of antidegradable states is zero. We use these results to derive an upper bound for arbitrary bipartite quantum states, which is based on a convex decomposition of a bipartite state into degradable and antidegradable states. This upper bound is always at least as good an upper bound as the entanglement of formation. Applying our bound to the qubit depolarizing channel, we obtain an upper bound on its quantum capacity that is strictly better than previously known bounds in the high noise regime. We also transfer the concept of approximate degradability [2] to quantum states and show that this yields another easily computable upper bound on the one-way distillable entanglement. Moreover, both methods of obtaining upper bounds on the one-way distillable entanglement can be combined into a generalized one.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•1 citation

Cost of quantum secret key

Karol Horodecki, Leonard Sikorski, Siddhartha Das +1 more

In this paper, we develop the resource theory of quantum secret key. Operating under the assumption that entangled states with zero distillable key do not exist, we define the key cost of a quantum state, and device. We study its properties through the lens of a quantity that we call the key of formation. The main result of our paper is that the regularized key of formation is an upper bound on the key cost of a quantum state. The core protocol underlying this result is privacy dilution, which converts states containing ideal privacy into ones with diluted privacy. Next, we show that the key cost is bounded from below by the regularized relative entropy of entanglement, which implies the irreversibility of the privacy creation-distillation process for a specific class of states. We further focus on mixed-state analogues of pure quantum states in the domain of privacy, and we prove that a number of entanglement measures are equal to each other for these states, similar to the case of pure entangled states. The privacy cost and distillable key in the single-shot regime exhibit a yield-cost relation, and basic consequences for quantum devices are also provided. Importantly, our results presented here will remain valid even if entangled states with zero distillable key were shown to exist.

arXiv:2402.17007•Quantum•May 6, 2026•2 citations
The notions of privacy tests and kkk-extendible states have both been instrumental in quantum information theory, particularly in understanding the limits of secure communication. In this paper, we determine the maximum probability with which an arbitrary kkk-extendible state can pass a privacy test, and we prove that it is equal to the maximum fidelity between an arbitrary kkk-extendible state and the standard maximally entangled state. Our findings, coupled with the resource theory of kkk-unextendibility, lead to an efficiently computable upper bound on the one-shot, one-way distillable key of a bipartite state, and we prove that it is equal to the best-known efficiently computable upper bound on the one-shot, one-way distillable entanglement. We also establish efficiently computable upper bounds on the one-shot, forward-assisted private capacity of channels. Extending our formalism to the independent and identically distributed setting, we obtain single-letter efficiently computable bounds on the nnn-shot, one-way distillable key of a state and the nnn-shot, forward-assisted private capacity of a channel. For some key examples of interest, our bounds are significantly tighter than other known efficiently computable bounds.
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.
A quantum network promises unconditionally secure transmission of data between its nodes by utilizing its ability to distribute entanglement across distant nodes. However, for most practical purposes, the distribution of entanglement is affected by environmental noise. We study the limits of secure communication between two parties sharing an arbitrary bipartite state or an arbitrary quantum channel under the one-way local operations and classical communication (one-way LOCC) setting, particularly for the non-asymptotic case. We use the ideas of unextendibility of entanglement to quantify the resourcefulness of a bipartite state or a quantum channel for forward-assisted private communication between its bearers, which we use to establish limits on the number of secret bits that can be established between the two parties either exactly, or probabilistically, or approximately. Our results surpass several previously known limits on secure communication under the considered setting. Additionally, several bounds presented in our work are efficiently computable, including the bounds on the one-shot private capacity of a channel, which are the first efficiently computable bounds on these quantities to the best of our knowledge.
Quantum communication relies on the existence of high quality quantum channels to exchange information. In practice, however, all communication links are affected by noise from the environment. Here we investigate the ability of quantum channels to perform quantum communication tasks by restricting the participants to use only local operations and one-way classical communication (one-way LOCC) along with the available quantum channel. In particular, a channel can be used to distill a highly entangled state between two parties, which further enables quantum or private communication. In this work, we invoke the framework of superchannels to study the distillation of a resourceful quantum state, such as a maximally entangled state or a private state, using multiple instances of a point-to-point quantum channel. We use the idea ofk-extendibility to obtain a semidefinite relaxation of the set of one-way LOCC superchannels and define a class of entanglement measures for quantum channels that decrease monotonically under such superchannels; therefore these measures, dubbed collectively the “unextendible entanglement of a channel”, yield upper bounds on several communication-theoretic quantities of interest in the regimes of resource distillation and zero error.We then generalize the formalism ofk-extendibility to bipartite superchannels, thus obtaining functions that are monotone under two-extendible superchannels. This allows us to analyze probabilistic distillation of ebits or secret key bits from a bipartite state when using a resourceful quantum channel. Moreover, we propose semidefinite programs to evaluate several of these quantities, providing a computationally feasible method of comparison between quantum channels for resource distillation.
Unextendibility of quantum states and channels is inextricably linked to the no-cloning theorem of quantum mechanics, it has played an important role in understanding and quantifying entanglement, and more recently it has found applications in providing limitations on quantum error correction and entanglement distillation. Here we generalize the framework of unextendibility to quantum measurements and define kkk-extendible measurements for every integer k≥2k\ge 2k≥2. Our definition provides a hierarchy of semidefinite constraints that specify a set of measurements containing every measurement that can be realized by local operations and one-way classical communication. Furthermore, the set of kkk-extendible measurements converges to the set of measurements that can be realized by local operations and one-way classical communication as k→∞k\to \inftyk→∞. To illustrate the utility of kkk-extendible measurements, we establish a semidefinite programming upper bound on the one-shot classical capacity of a channel, which outperforms the best known efficiently computable bound from [Matthews and Wehner, IEEE Trans. Inf. Theory 60, pp. 7317-7329 (2014)] and also leads to efficiently computable upper bounds on the nnn-shot classical capacity of a channel.
We derive an upper bound on the one-way distillable entanglement of bipartite quantum states. To this end, we revisit the notion of degradable, conjugate degradable, and antidegrad-able bipartite quantum states [1]. We prove that for degradable and conjugate degradable states the one-way distillable entanglement is equal to the coherent information, and thus given by a single-letter formula. Furthermore, it is well-known that the one-way distillable entanglement of antidegradable states is zero. We use these results to derive an upper bound for arbitrary bipartite quantum states, which is based on a convex decomposition of a bipartite state into degradable and antidegradable states. This upper bound is always at least as good an upper bound as the entanglement of formation. Applying our bound to the qubit depolarizing channel, we obtain an upper bound on its quantum capacity that is strictly better than previously known bounds in the high noise regime. We also transfer the concept of approximate degradability [2] to quantum states and show that this yields another easily computable upper bound on the one-way distillable entanglement. Moreover, both methods of obtaining upper bounds on the one-way distillable entanglement can be combined into a generalized one.
In this paper, we develop the resource theory of quantum secret key. Operating under the assumption that entangled states with zero distillable key do not exist, we define the key cost of a quantum state, and device. We study its properties through the lens of a quantity that we call the key of formation. The main result of our paper is that the regularized key of formation is an upper bound on the key cost of a quantum state. The core protocol underlying this result is privacy dilution, which converts states containing ideal privacy into ones with diluted privacy. Next, we show that the key cost is bounded from below by the regularized relative entropy of entanglement, which implies the irreversibility of the privacy creation-distillation process for a specific class of states. We further focus on mixed-state analogues of pure quantum states in the domain of privacy, and we prove that a number of entanglement measures are equal to each other for these states, similar to the case of pure entangled states. The privacy cost and distillable key in the single-shot regime exhibit a yield-cost relation, and basic consequences for quantum devices are also provided. Importantly, our results presented here will remain valid even if entangled states with zero distillable key were shown to exist.