pith. sign in

arxiv: 2501.10152 · v4 · pith:VXV4K335new · submitted 2025-01-17 · 🪐 quant-ph · cs.IT· math.IT

Quantum Advantage in Locally Differentially Private Hypothesis Testing

classification 🪐 quant-ph cs.ITmath.IT
keywords privacyquantumtestingadvantageclassicalsymmetricasymmetricbounds
0
0 comments X
read the original abstract

We consider a private hypothesis testing scenario, including both symmetric and asymmetric testing, based on classical data samples. The utility is measured by the error exponents, namely the Chernoff information and the relative entropy, while privacy is measured in terms of classical or quantum local differential privacy. In this scenario, we show a quantum advantage with respect to the optimal privacy-utility trade-off (PUT) in certain cases. Specifically, we focus on distributions referred to as smoothed point mass distributions, along with the uniform distribution, as hypotheses. We then derive upper bounds on the optimal PUTs achievable by classical privacy mechanisms, which are tight in specific instances. To show the quantum advantage, we propose a particular quantum privacy mechanism that achieves better PUTs than these upper bounds in both symmetric and asymmetric testing, specifically under stringent privacy constraints and small discrete data alphabet sizes ranging from 3 to 9. The proposed mechanism consists of a classical-quantum channel that prepares symmetric informationally complete (SIC) states, followed by a depolarizing channel.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Optimal Privacy-Utility Trade-Offs in LDP: Functional and Geometric Perspectives

    cs.CR 2026-05 unverdicted novelty 8.0

    A one-to-one correspondence maps maximal LDP channels under the Blackwell order to vertices of a finite-dimensional polytope, making optimal privacy-utility trade-offs computable via linear programming or vertex enume...

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

    quant-ph 2026-05 unverdicted novelty 7.0

    Optimal QLDP mechanisms achieve the same asymptotic Q/C ratio as classical LDP for Holevo information and hypothesis-testing error exponents, with Q/C >= 3/2 when protecting n-ary data for n >= 3.