Pith. sign in

REVIEW 7 cited by

Quantum Differential Privacy: An Information Theory Perspective

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.10717 v3 pith:4JYWO6N3 submitted 2022-02-22 quant-ph cs.CRcs.ITcs.LGmath.IT

Quantum Differential Privacy: An Information Theory Perspective

classification quant-ph cs.CRcs.ITcs.LGmath.IT
keywords differentialprivacyquantumclassicalcomputationsnoiseamountcomputation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Differential privacy has been an exceptionally successful concept when it comes to providing provable security guarantees for classical computations. More recently, the concept was generalized to quantum computations. While classical computations are essentially noiseless and differential privacy is often achieved by artificially adding noise, near-term quantum computers are inherently noisy and it was observed that this leads to natural differential privacy as a feature. In this work we discuss quantum differential privacy in an information theoretic framework by casting it as a quantum divergence. A main advantage of this approach is that differential privacy becomes a property solely based on the output states of the computation, without the need to check it for every measurement. This leads to simpler proofs and generalized statements of its properties as well as several new bounds for both, general and specific, noise models. In particular, these include common representations of quantum circuits and quantum machine learning concepts. Here, we focus on the difference in the amount of noise required to achieve certain levels of differential privacy versus the amount that would make any computation useless. Finally, we also generalize the classical concepts of local differential privacy, Renyi differential privacy and the hypothesis testing interpretation to the quantum setting, providing several new properties and insights.

discussion (0)

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

Forward citations

Cited by 7 Pith papers

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

  1. Integral representations of $f$-divergences for general von Neumann algebras

    math.OA 2026-07 accept novelty 7.0

    The f_0-divergence defined via Jordan decomposition integrals coincides with Araki's relative entropy on arbitrary von Neumann algebras, extending Frenkel's finite-dimensional formula.

  2. New approaches to almost i.i.d. information theory

    quant-ph 2026-05 unverdicted novelty 7.0

    Introduces two alternative definitions of almost i.i.d. states in quantum information theory and proves a strict hierarchy with a previously proposed notion, separated by explicit examples.

  3. Sufficiency and Petz recovery for positive maps

    quant-ph 2026-04 accept novelty 7.0

    Minimal sufficient Jordan algebras characterize sufficiency for positive trace-preserving maps on quantum states, with Neyman-Pearson tests generating them and equality in data-processing inequalities implying Petz recovery.

  4. Sufficiency and Petz recovery for positive maps

    quant-ph 2026-04 unverdicted novelty 7.0

    Minimal sufficient Jordan algebras generated by Neyman-Pearson tests characterize sufficiency for positive trace-preserving maps, implying Petz-like recovery and equivalence of interconversion conditions for quantum d...

  5. Quantum Shannon theory made robust: a tale of three protocols for almost i.i.d. sources

    quant-ph 2026-05 unverdicted novelty 6.0

    Robust protocols are identified for three quantum Shannon tasks under three notions of almost i.i.d. structure that preserve i.i.d. rates, along with new concepts of almost i.i.d. process and club distance.

  6. Quantum Shannon theory made robust: a tale of three protocols for almost i.i.d. sources

    quant-ph 2026-05 unverdicted novelty 5.0

    Robust protocols exist for hypothesis testing, compression, and channel coding that attain optimal rates for arbitrary almost i.i.d. sources, via a new club distance and almost i.i.d. process notion.

  7. Foundations of Future Communication Systems: Innovations in Communication - A Report

    cs.IT 2026-04 unverdicted novelty 1.0

    The report assembles abstracts of invited talks, presentations, and posters from the FFCS conference on foundational limits and emerging paradigms in communication.