Metraipolis › archive › dc_0f345bb3ec2e
Quantum Advantage for Two-Party Differential Privacy — arXiv:2610.02113
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.02113
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T17:48:51.764Z
- SHA-256 of the archived text
7394ad082c40f212a6dd966777659fe71da647537dab346ea9c263fb814bf362- Stable URL of this page
https://metraipolis.com/documento/dc_0f345bb3ec2e
How to cite
Quantum Advantage for Two-Party Differential Privacy — arXiv:2610.02113 — arXiv (en), https://arxiv.org/abs/2610.02113 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0f345bb3ec2e (Metraipolis archive dc_0f345bb3ec2e, sha256 7394ad082c40f212a6dd966777659fe71da647537dab346ea9c263fb814bf362)
BibTeX
@misc{dc0f345bb3ec2e,
title = {Quantum Advantage for Two-Party Differential Privacy — arXiv:2610.02113},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.02113},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0f345bb3ec2e; sha256 7394ad082c40f212a6dd966777659fe71da647537dab346ea9c263fb814bf362},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.02113. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce information-theoretically private quantum protocols for two-party Hamming distance when both parties must output the same estimate. Classically, for input length $n$, information-theoretic protocols require $\Omega(\sqrt{n})$ error under pure differential privacy and $\Omega(\sqrt{n}/\log n)$ error under strong approximate differential privacy, whereas computational security permits $O(1)$ error. In Klauck's honest, nonpreemptive, message-preserving model, we give an $O(n)$-communication quantum protocol with pure $\varepsilon$ quantum differential privacy (QDP) and expected error at most $\frac{2}{\sinh \varepsilon}+\gamma$, for every $\gamma>0$. For approximate $(\varepsilon, \delta)$ QDP, an exact hockey-stick divergence calculation yields strictly smaller error, while preserving the $O(1)$-versus-$\Omega(\sqrt{n}/\log n)$ separation for $\delta=o(1/n)$. Thus, quantum communication achieves $O(1)$ information-theoretic error, matching the accuracy available classically only under computational assumptions. The main construction uses a guarded coherent round trip and an equal-Gram rigidity principle that prevents an honest player from retaining input-dependent complementary information. We separate this model from weaker prescribed-channel privacy, which already admits an exact classical realization, and from fully retention-robust security, against which measurement-and-abort attacks remain possible. Therefore, we identify preservation of non-orthogonal quantum messages as a resource for privacy.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR); Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.02113 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T16:13:30.469Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).