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

• URL: http://arxiv.org/abs/2511.04438v1
• Date: Thu, 06 Nov 2025 15:11:54 GMT
• Title: Limiting one-way distillable secret key via privacy testing of extendible states
• Authors: Vishal Singh, Karol Horodecki, Aby Philip, Mark M. Wilde,
• Abstract summary: In this paper, we determine the maximum probability with which an arbitrary $k$-extendible state can pass a privacy test.<n>We also prove that it is equal to the maximum fidelity between an arbitrary $k$-extendible state and the standard maximally entangled state.<n>For some key examples of interest, our bounds are significantly tighter than other known efficiently computable bounds.
• Score: 11.199585259018457
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms [67.94856074923571]
  This paper introduces a novel proof technique based on a multi-player communication game.<n>We show that winning this communication game requires transmitting information proportional to the number of over-active users.<n>We show that this communication-theoretic technique generalizes to broad classes of problems, yielding lower bounds for private medians, quantiles, and max-select.
  arXiv  Detail & Related papers  (2026-02-12T17:49:07Z)
• Entropy Bounds via Hypothesis Testing and Its Applications to Two-Way Key Distillation in Quantum Cryptography [0.38233569758620045]
  Quantum key distribution (QKD) information-theoretic security, without relying on computational assumptions, by distributing quantum states.<n>In this work, we establish a rigorous connection between the key rate achievable by applying two-way key distillation, such as advantage distillation, and quantum hypothesis testing.<n>Our work shows how advances in quantum multiple hypothesis testing can directly sharpen the security analyses of QKD.
  arXiv  Detail & Related papers  (2026-02-05T16:48:03Z)
• Quantum Blackwell's Ordering and Differential Privacy [42.694152897125726]
  We develop a framework for quantum differential privacy (QDP) based on quantum hypothesis testing and Blackwell's ordering.<n>This approach characterizes $(eps,delta)$-QDP via hypothesis testing divergences and identifies the most informative quantum state pairs under privacy constraints.
  arXiv  Detail & Related papers  (2025-11-03T11:24:52Z)
• Optimality of universal conclusive entanglement purification protocols [75.52645767671567]
  We establish fundamental limits for conclusive protocols distilling perfect Bell states from a pure two-qubit states.<n>We prove that a known protocol achieves these bounds, confirming its optimality.
  arXiv  Detail & Related papers  (2025-09-11T13:04:17Z)
• Storage and retrieval of two unknown unitary channels [35.35606314237919]
  We consider the case where the unknown unitary is selected with equal prior probability from two options.<n>First, we prove that the optimal storage strategy involves the sequential application of the $n$ uses of the unknown unitary.<n>Next, we show that incoherent "measure-and-prepare" retrieval achieves the maximum fidelity between the retrieved operation and the original (qubit) unitary.
  arXiv  Detail & Related papers  (2024-10-30T18:27:46Z)
• Convergent Differential Privacy Analysis for General Federated Learning: the $f$-DP Perspective [57.35402286842029]
  Federated learning (FL) is an efficient collaborative training paradigm with a focus on local privacy. differential privacy (DP) is a classical approach to capture and ensure the reliability of private protections.
  arXiv  Detail & Related papers  (2024-08-28T08:22:21Z)
• No-go theorem for probabilistic one-way secret-key distillation [4.079147243688764]
  Probability one-way distillable secret key is equal to the largest expected rate at which perfect secret key bits can be probabilistically distilled from a bipartite state. We prove that an arbitrary state in this set cannot be used for probabilistic one-way secret-key distillation.
  arXiv  Detail & Related papers  (2024-04-01T18:01:15Z)
• Cost of quantum secret key [4.3012765978447565]
  We study the properties of a quantum state and device 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. We show that the key cost is bounded from below by the regularized relative entropy of entanglement.
  arXiv  Detail & Related papers  (2024-02-26T20:22:06Z)
• TernaryVote: Differentially Private, Communication Efficient, and Byzantine Resilient Distributed Optimization on Heterogeneous Data [50.797729676285876]
  We propose TernaryVote, which combines a ternary compressor and the majority vote mechanism to realize differential privacy, gradient compression, and Byzantine resilience simultaneously. We theoretically quantify the privacy guarantee through the lens of the emerging f-differential privacy (DP) and the Byzantine resilience of the proposed algorithm.
  arXiv  Detail & Related papers  (2024-02-16T16:41:14Z)
• Fixed-Budget Differentially Private Best Arm Identification [62.36929749450298]
  We study best arm identification (BAI) in linear bandits in the fixed-budget regime under differential privacy constraints. We derive a minimax lower bound on the error probability, and demonstrate that the lower and the upper bounds decay exponentially in $T$.
  arXiv  Detail & Related papers  (2024-01-17T09:23:25Z)
• Breaking the Communication-Privacy-Accuracy Tradeoff with $f$-Differential Privacy [51.11280118806893]
  We consider a federated data analytics problem in which a server coordinates the collaborative data analysis of multiple users with privacy concerns and limited communication capability. We study the local differential privacy guarantees of discrete-valued mechanisms with finite output space through the lens of $f$-differential privacy (DP) More specifically, we advance the existing literature by deriving tight $f$-DP guarantees for a variety of discrete-valued mechanisms.
  arXiv  Detail & Related papers  (2023-02-19T16:58:53Z)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)
• Upper bounds on key rates in device-independent quantum key distribution based on convex-combination attacks [1.118478900782898]
  We present the convex-combination attack as an efficient, easy-to-use technique for upper-bounding DIQKD key rates. It allows verifying the accuracy of lower bounds on key rates for state-of-the-art protocols.
  arXiv  Detail & Related papers  (2022-06-13T15:27:48Z)
• Quantifying the unextendibility of entanglement [13.718093420358827]
  Entanglement is a striking feature of quantum mechanics, and it has a key property called unextendibility. We present a framework for quantifying and investigating the unextendibility of general bipartite quantum states.
  arXiv  Detail & Related papers  (2019-11-18T05:22:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.