High quantum local differential privacy breaks entanglement

• URL: http://arxiv.org/abs/2609.13418v1
• Date: Fri, 11 Sep 2026 18:29:55 GMT
• Title: High quantum local differential privacy breaks entanglement
• Abstract summary: We show that every $varepsilon$-QLDP channel with a $d$-dimensional input is entanglement-breaking whenever $varepsilonleqlogfracdd-1$.<n>We also prove an approximate version for $(varepsilon,)$-QLDP, where channels in the same high-privacy regime are close in diamond norm to an entanglement-breaking channel.<n>We apply our results to private quantum learning theory.
• Score: 13.088625380700933
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Differential privacy provides a mathematical framework for guaranteeing privacy for sensitive data. In quantum information processing, the interaction of privacy constraints with quantum resources such as entanglement remains a question of interest. Given that the utility of many protocols, and often the presence of a quantum advantage, relies on quantum resources such as entanglement, it is crucial to understand when a privacy requirement for a quantum channel is compatible with the channel's ability to preserve entanglement. We study this question for quantum local differential privacy (QLDP). Our main result shows that every $\varepsilon$-QLDP channel with a $d$-dimensional input is entanglement-breaking whenever $\varepsilon\leq\log\frac{d}{d-1}$. We also prove an approximate version for $(\varepsilon,δ)$-QLDP, where channels in the same high-privacy regime are close in diamond norm to an entanglement-breaking channel. We further prove a composition result for a collection of private quantum channels having entangled inputs and global measurements in the high-privacy regime. Finally, we apply our results to private quantum learning theory. We prove that any learning protocol using arbitrary quantum memory on copies of the output of an entanglement-breaking channel can be simulated by a protocol that measures the corresponding unprocessed input copies one at a time while storing only classical information. Combining this result with our high-privacy entanglement-breaking theorem, we show that under sufficiently private local noise, a learning protocol with quantum memory for purity testing and bipartite product testing is subject to the sample complexity lower bounds for protocols with single-copy measurements on the noiseless tasks. We also obtain stronger sample complexity lower bounds when a single highly private channel acts on the entire multipartite input.

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)
• 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)
• Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels [49.126395046088014]
  This work shows that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states.<n>This result enables us to tighten the capacity lower bound for DI over quantum channels beyond the simultaneous decoding approach.
  arXiv  Detail & Related papers  (2025-04-29T17:57:36Z)
• Contraction of Private Quantum Channels and Private Quantum Hypothesis Testing [19.69490455003981]
  We study contraction coefficient for hockey-stick divergence under privacy constraints.<n>We also show how private quantum channels provide fairness and Holevo information stability in quantum learning settings.
  arXiv  Detail & Related papers  (2024-06-26T18:00:03Z)
• Differential Privacy Preserving Quantum Computing via Projection Operator Measurements [15.024190374248088]
  In classical computing, we can incorporate the concept of differential privacy (DP) to meet the standard of privacy preservation. In the quantum computing scenario, researchers have extended classic DP to quantum differential privacy (QDP) by considering the quantum noise. We show that shot noise can effectively provide privacy protection in quantum computing.
  arXiv  Detail & Related papers  (2023-12-13T15:27:26Z)
• Harnessing high-dimensional temporal entanglement using limited interferometric setups [41.94295877935867]
  We develop the first complete analysis of high-dimensional entanglement in the polarization-time-domain. We show how to efficiently certify relevant density matrix elements and security parameters for Quantum Key Distribution. We propose a novel setup that can further enhance the noise resistance of free-space quantum communication.
  arXiv  Detail & Related papers  (2023-08-08T17:44:43Z)
• A unifying framework for differentially private quantum algorithms [0.0]
  We propose a novel and general definition of neighbouring quantum states. We demonstrate that this definition captures the underlying structure of quantum encodings. We also investigate an alternative setting where we are provided with multiple copies of the input state.
  arXiv  Detail & Related papers  (2023-07-10T17:44:03Z)
• Differential Privacy Amplification in Quantum and Quantum-inspired Algorithms [0.6827423171182154]
  We provide privacy bounds amplification for quantum and quantum-inspired algorithms. We show for the first time, that algorithms running on quantum encoding of a classical dataset amplify differential privacy.
  arXiv  Detail & Related papers  (2022-03-07T18:55:20Z)
• Private Classical Communication over Quantum Multiple-Access Channels [5.203329540700176]
  We study private classical communication over quantum multiple-access channels. We decouple the reliability and privacy constraints, which are handled via source coding with quantum side information and universal hashing.
  arXiv  Detail & Related papers  (2022-01-28T02:23:50Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.