Quantum Probabilistic Local Differential Privacy: Structural Properties and Sample Complexity Bounds

• URL: http://arxiv.org/abs/2607.06307v1
• Date: Tue, 07 Jul 2026 14:11:15 GMT
• Title: Quantum Probabilistic Local Differential Privacy: Structural Properties and Sample Complexity Bounds
• Abstract summary: We study a relaxation of quantum local differential privacy in which the privacy constraint is allowed to fail on a spectral violation event with low probability.<n>This quantity can be interpreted as the probability under the quantum superoperation of a quantum privacy-loss violation.<n>We show the properties of quantum probabilistic local differential privacy under tensor-product composition and unitary post-processing.
• Score: 4.704514200771222
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Differential privacy provides a rigorous framework for quantifying privacy leakage in data analysis, while its quantum extensions have become increasingly relevant with the development of quantum computing and quantum machine learning. In this work, we introduce and study quantum probabilistic local differential privacy, a relaxation of quantum local differential privacy in which the privacy constraint is allowed to fail on a spectral violation event with low probability. This quantity can be interpreted as the probability under the quantum superoperation of a quantum privacy-loss violation, and is closely related to the acceptance probability of the quantum Neyman-Pearson test at a small threshold. We investigate the basic structural properties of this privacy notion and clarify its relationship with existing forms of quantum differential privacy. We show the properties of quantum probabilistic local differential privacy under tensor-product composition and unitary post-processing, while it is in general neither convex nor closed under post-processing by arbitrary quantum channels. We further characterize when depolarizing noise satisfies quantum probabilistic local differential privacy under several representative scenarios. Finally, we connect quantum probabilistic privacy constraints with statistical inference by deriving a lower bound on probabilistically privatized contraction coefficients in terms of the hockey-stick divergence. As an application, we obtain sample complexity bounds of probabilistically privated asymmetric and symmetric quantum hypothesis testing. These results provide a systematic foundation for studying probabilistic privacy guarantees in quantum information processing and their operational consequences for private quantum statistical inference.

Related papers

• How Entanglement Reshapes the Geometry of Quantum Differential Privacy [10.99782151422611]
  We show that entanglement serves as a privacy-enhancing resource, offering a geometric and operational foundation for designing robust privacy-preserving quantum protocols.<n>Our findings demonstrate that entanglement serves as a privacy-enhancing resource, offering a geometric and operational foundation for designing robust privacy-preserving quantum protocols.
  arXiv  Detail & Related papers  (2026-01-27T02:50:51Z)
• 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)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem.<n>We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions.<n>We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks [37.23288214515363]
  It is critically important to analyze the achievability of quantum advantage under realistic imperfections.<n>We show that quantum advantage in distributed sensing can be achieved with noisy quantum networks which can only distribute noisy entangled states.
  arXiv  Detail & Related papers  (2024-09-25T16:55:07Z)
• 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)
• 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)
• Quantum Pufferfish Privacy: A Flexible Privacy Framework for Quantum Systems [19.332726520752846]
  We propose a versatile privacy framework for quantum systems, termed quantum pufferfish privacy (QPP) Inspired by classical pufferfish privacy, our formulation generalizes and addresses limitations of quantum differential privacy. We show that QPP can be equivalently formulated in terms of the Datta-Leditzky information spectrum divergence.
  arXiv  Detail & Related papers  (2023-06-22T17:21:17Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Quantum Local Differential Privacy and Quantum Statistical Query Model [0.7673339435080445]
  Quantum statistical queries provide a theoretical framework for investigating the computational power of a learner with limited quantum resources. In this work, we establish an equivalence between quantum statistical queries and quantum differential privacy in the local model. We consider the task of quantum multi-party computation under local differential privacy.
  arXiv  Detail & Related papers  (2022-03-07T18:38:02Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• 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.