Optimal quantum locally differentially private mechanisms in the high-privacy regime

• URL: http://arxiv.org/abs/2605.27278v1
• Date: Tue, 26 May 2026 16:57:22 GMT
• Title: Optimal quantum locally differentially private mechanisms in the high-privacy regime
• Abstract summary: We adopt local differential privacy (LDP) and its quantum extension, quantum local differential privacy (QLDP) for privacy protection.<n>We investigate utility functions including the Holevo information (which reduces to the mutual information in the classical case) and the error exponents in symmetric and asymmetric hypothesis testing.<n>Our results reveal quantum advantages (more precisely, $Q/Cge3/2$) for the above utility functions when the protected private data are $n$-ary with $nge3$.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We optimize the trade-off between privacy and utility in the high-privacy regime. We adopt local differential privacy (LDP) and its quantum extension, quantum local differential privacy (QLDP), for privacy protection, and investigate utility functions including the Holevo information (which reduces to the mutual information in the classical case) and the error exponents in symmetric and asymmetric hypothesis testing. These utility functions have classical and quantum optimal values, which are denoted by $C$ and $Q$, respectively, in this abstract for simplicity. In this paper, we provide optimal LDP and QLDP mechanisms achieving the classical and quantum optimal values in the high-privacy regime, and prove that the asymptotic ratio $Q/C$ in this regime takes the same value regardless of the utility function. Our results reveal quantum advantages (more precisely, $Q/C\ge3/2$) for the above utility functions when the protected private data are $n$-ary with $n\ge3$.

Related papers

• Asymptotic Optimality of the High-Dimensional Gaussian Mechanism and Improved Low-Dimensional Mechanisms for Differential Privacy [51.25798439950639]
  We show that no additive-noise mechanism can improve on the Gaussian mechanism's privacy--utility tradeoff for the strong privacy settings typically used.<n>We develop a new family of emphSpherical Generalized Gamma DP mechanisms, which contains both the Gaussian mechanism and the recently studied $ell$ mechanism.
  arXiv  Detail & Related papers  (2026-06-07T15:33:30Z)
• Privacy-Utility Tradeoffs in Quantum Information Processing [13.088625380700933]
  We study optimal tradeoffs for both generic and application-specific utility metrics when privacy is quantified by $(varepsilon,)$-quantum local differential privacy.<n>We derive a lower bound on the number of samples required to achieve a fixed accuracy guarantee with high probability.<n>We conclude by initiating the study of private classical shadows, which promise useful applications for private learning tasks.
  arXiv  Detail & Related papers  (2026-02-11T04:21:45Z)
• Private Hyperparameter Tuning with Ex-Post Guarantee [98.43027866582979]
  " Utility-first" privacy mechanisms prioritize a desired level of utility and then determine the corresponding privacy cost.<n>We extend the work of Wu et al. [ 2019] and Liu and Talwar [ 2019] to support any sequence of private estimators.<n>We demonstrate that hyper parameter tuning for these estimators, including the selection of an optimal privacy budget, can be performed without additional privacy cost.
  arXiv  Detail & Related papers  (2025-08-21T02:42:23Z)
• Differential Privacy of Quantum and Quantum-Inspired-Classical Recommendation Algorithms [2.36119616330904]
  We analyze the DP (differential privacy) properties of the quantum recommendation algorithm and the quantum-inspired-classical recommendation algorithm.<n>We find that the quantum recommendation algorithm is a privacy curating mechanism on its own, requiring no external noise.<n>A comparison shows that the quantum algorithm has better privacy preserving potential than the classical one.
  arXiv  Detail & Related papers  (2025-02-07T08:45:00Z)
• Quantum Advantage in Locally Differentially Private Hypothesis Testing [15.33076560724092]
  We show a quantum advantage with respect to the optimal privacy-utility trade-off (PUT) in certain cases.<n>We propose a particular quantum privacy mechanism that achieves better PUTs than these upper bounds in both symmetric and asymmetric testing.
  arXiv  Detail & Related papers  (2025-01-17T12:23:43Z)
• Optimized Tradeoffs for Private Prediction with Majority Ensembling [59.99331405291337]
  We introduce the Data-dependent Randomized Response Majority (DaRRM) algorithm.<n>DaRRM is parameterized by a data-dependent noise function $gamma$, and enables efficient utility optimization over the class of all private algorithms.<n>We show that DaRRM provably enjoys a privacy gain of a factor of 2 over common baselines, with fixed utility.
  arXiv  Detail & Related papers  (2024-11-27T00:48:48Z)
• Optimal Mechanisms for Quantum Local Differential Privacy [2.773175214444248]
  Local differential privacy (QLDP) has been proposed to preserve quantum data privacy akin to the classical scenario where all states are viewed as neighboring states.<n>This paper delves into optimal QLDP mechanisms to balance privacy and utility to enhance the practical use of the QLDP framework.
  arXiv  Detail & Related papers  (2024-07-18T13:46:16Z)
• Privacy Amplification for the Gaussian Mechanism via Bounded Support [64.86780616066575]
  Data-dependent privacy accounting frameworks such as per-instance differential privacy (pDP) and Fisher information loss (FIL) confer fine-grained privacy guarantees for individuals in a fixed training dataset. We propose simple modifications of the Gaussian mechanism with bounded support, showing that they amplify privacy guarantees under data-dependent accounting.
  arXiv  Detail & Related papers  (2024-03-07T21:22:07Z)
• 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)
• Optimal Compression of Locally Differentially Private Mechanisms [21.200464908282594]
  We demonstrate the benefits of schemes that jointly compress and privatize the data using shared randomness. Our theoretical and empirical findings show that our approach can compress PrivUnit (Bhowmick et al., Coding and Subset Selection (Ye et al., the best known LDP algorithms for mean and frequency estimation, to the order of epsilon-bits of communication, while preserving their privacy and accuracy guarantees, to the order of epsilon-bits of communication, to the order of epsilon-bits of communication, to the order of epsilon-bits of communication, to the
  arXiv  Detail & Related papers  (2021-10-29T21:36:34Z)
• Quantum Differentially Private Sparse Regression Learning [132.1981461292324]
  We devise an efficient quantum differentially private (QDP) Lasso estimator to solve sparse regression tasks. Last, we exhibit that the QDP Lasso attains a near-optimal utility bound $tildeO(N-2/3)$ with privacy guarantees.
  arXiv  Detail & Related papers  (2020-07-23T10:50:42Z)

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.