Mathematical comparison of classical and quantum mechanisms in optimization under local differential privacy
Yuuya Yoshida

TL;DR
This paper compares classical and quantum mechanisms in local differential privacy, showing that for three or more elements, quantum privacy mechanisms are strictly more general than classical ones, with quantifiable differences.
Contribution
It demonstrates that classical and quantum differential privacy sets differ for n≥3, extending previous results for n=2, and provides estimates of their differences.
Findings
For n≥3, classical and quantum DP sets are not equal.
Quantum DP mechanisms form a strictly larger set than classical ones for n≥3.
Quantitative estimates of the difference between classical and quantum DP sets.
Abstract
Let . An -tuple of probability vectors is called -differentially private (-DP) if has no negative entries for all . An -tuple of density matrices is called classical-quantum -differentially private (CQ -DP) if is positive semi-definite for all . Denote by the set of all -DP -tuples, and by the set of all CQ -DP -tuples. By considering optimization problems under local differential privacy, we define the subset of that is essentially classical. Roughly speaking, an element in is the image of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Stochastic Gradient Optimization Techniques · Cryptography and Data Security
