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

Information and Computation

Min-entropy as a resource

Barbara Espinoza, Geoffrey Smith

Published Mar 8, 2013• 63 citations
Publisher
DOI
10.1016/j.ic.2013.03.005

Related papers

Optimal min-entropy uncertainty relation

Alexandra Musat, Andrei Tănăsescu, Pantelimon George Popescu

Physical Review A•Jan 26, 2026•0 citations

Quasi chain rule for min-entropy

Stefan Dziembowski, Tomasz Kazana, Maciej Zdanowicz

Information Processing Letters•Feb 5, 2018•3 citations

Min-Entropy Leakage of Channels in Cascade

Barbara Espinoza, Geoffrey Smith

Lecture notes in computer science•Jan 1, 2012•15 citations

Weighted entropy

Silviu Guiaşu

Reports on Mathematical Physics•Sep 1, 1971•158 citations

(Quantum) Min-Entropy Resources

Christopher Portmann

We model (interactive) resources that provide Alice with a string $X$ and a guarantee that any Eve interacting with her interface of the resource obtains a (quantum) system $E$ such that the conditional (smooth) min-entropy of $X$ given $E$ is lower bounded by some $k$. This (abstract) resource specification encompasses any setting that results in the honest players holding such a string (or aborting). For example, it could be constructed from, e.g., noisy channels, quantum key distribution (QKD), or a violation of Bell inequalities, which all may be used to derive bounds on the min-entropy of $X$. As a first application, we use this min-entropy resource to modularize key distribution (KD) schemes by dividing them in two parts, which may be analyzed separately. In the first part, a KD protocol constructs a min-entropy resource given the (physical) resources available in the specific setting considered. In the second, it distills secret key from the min-entropy resource---i.e., it constructs a secret key resource. We prove security for a generic key distillation protocol that may use any min-entropy resource. Since the notion of resource construction is composable---security of a composed protocol follows from the security of its parts--- this reduces proving security of a KD protocol (e.g., QKD) to proving that it constructs a min-entropy resource. As a second application, we provide a composable security proof for the recent Fehr-Salvail protocol [EUROCRYPT 2017] that authenticates classical messages with a quantum message authentication code (Q-MAC), and recycles all the key upon successfully verifying the authenticity of the message. This protocol uses (and recycles) a non-uniform key, which we model as consuming and constructing a min-entropy resource.

arXiv:1705.10595•May 30, 2017•4 citations

Min-entropy as a resource for one-shot private state transfer, quantum masking, and state transition

Seok Hyung Lie, Seongjeon Choi, Hyunseok Jeong

We give an operational meaning to the min-entropy of a quantum state as a resource measure for various interconnected tasks. In particular, we show that the min-entropy without smoothing measures the amount of quantum information that can be hidden or encoded perfectly in the one-shot setting when the quantum state is used as a randomness or correlation source. First, we show that the min-entropy of entanglement of a pure bipartite state is the maximum number of qubits privately transferable when the state is used as a quantum one-time pad. Then, through the equivalence of quantum secret sharing--like protocols, it is also shown that the min-entropy of a quantum state is the maximum number of qubits that can be masked when the state is used as a randomness source for a quantum masking process. Consequently, we show that the min-entropy of a quantum state is half the size of the quantum state it can catalytically dephase. This gives a necessary and sufficient condition for catalysts for state transition processes.

arXiv:2010.14796•Physical Review A•Apr 23, 2021•14 citations
We model (interactive) resources that provide Alice with a string XXX and a guarantee that any Eve interacting with her interface of the resource obtains a (quantum) system EEE such that the conditional (smooth) min-entropy of XXX given EEE is lower bounded by some kkk. This (abstract) resource specification encompasses any setting that results in the honest players holding such a string (or aborting). For example, it could be constructed from, e.g., noisy channels, quantum key distribution (QKD), or a violation of Bell inequalities, which all may be used to derive bounds on the min-entropy of XXX. As a first application, we use this min-entropy resource to modularize key distribution (KD) schemes by dividing them in two parts, which may be analyzed separately. In the first part, a KD protocol constructs a min-entropy resource given the (physical) resources available in the specific setting considered. In the second, it distills secret key from the min-entropy resource---i.e., it constructs a secret key resource. We prove security for a generic key distillation protocol that may use any min-entropy resource. Since the notion of resource construction is composable---security of a composed protocol follows from the security of its parts--- this reduces proving security of a KD protocol (e.g., QKD) to proving that it constructs a min-entropy resource. As a second application, we provide a composable security proof for the recent Fehr-Salvail protocol [EUROCRYPT 2017] that authenticates classical messages with a quantum message authentication code (Q-MAC), and recycles all the key upon successfully verifying the authenticity of the message. This protocol uses (and recycles) a non-uniform key, which we model as consuming and constructing a min-entropy resource.
We give an operational meaning to the min-entropy of a quantum state as a resource measure for various interconnected tasks. In particular, we show that the min-entropy without smoothing measures the amount of quantum information that can be hidden or encoded perfectly in the one-shot setting when the quantum state is used as a randomness or correlation source. First, we show that the min-entropy of entanglement of a pure bipartite state is the maximum number of qubits privately transferable when the state is used as a quantum one-time pad. Then, through the equivalence of quantum secret sharing--like protocols, it is also shown that the min-entropy of a quantum state is the maximum number of qubits that can be masked when the state is used as a randomness source for a quantum masking process. Consequently, we show that the min-entropy of a quantum state is half the size of the quantum state it can catalytically dephase. This gives a necessary and sufficient condition for catalysts for state transition processes.