When Does Quantum Differential Privacy Compose?

• URL: http://arxiv.org/abs/2601.00337v1
• Date: Thu, 01 Jan 2026 13:24:09 GMT
• Title: When Does Quantum Differential Privacy Compose?
• Authors: Daniel Alabi, Theshani Nuradha,
• Abstract summary: In the quantum setting, privacy is defined operationally against arbitrary measurements.<n>It has remained unclear when meaningful composition guarantees can be obtained for quantum differential privacy.
• Score: 11.680868844041791
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Composition is a cornerstone of classical differential privacy, enabling strong end-to-end guarantees for complex algorithms through composition theorems (e.g., basic and advanced). In the quantum setting, however, privacy is defined operationally against arbitrary measurements, and classical composition arguments based on scalar privacy-loss random variables no longer apply. As a result, it has remained unclear when meaningful composition guarantees can be obtained for quantum differential privacy (QDP). In this work, we clarify both the limitations and possibilities of composition in the quantum setting. We first show that classical-style composition fails in full generality for POVM-based approximate QDP: even quantum channels that are individually perfectly private can completely lose privacy when combined through correlated joint implementations. We then identify a setting in which clean composition guarantees can be restored. For tensor-product channels acting on product neighboring inputs, we introduce a quantum moments accountant based on an operator-valued notion of privacy loss and a matrix moment-generating function. Although the resulting Rényi-type divergence does not satisfy a data-processing inequality, we prove that controlling its moments suffices to bound measured Rényi divergence, yielding operational privacy guarantees against arbitrary measurements. This leads to advanced-composition-style bounds with the same leading-order behavior as in the classical theory. Our results demonstrate that meaningful composition theorems for quantum differential privacy require carefully articulated structural assumptions on channels, inputs, and adversarial measurements, and provide a principled framework for understanding which classical ideas do and do not extend to the quantum setting.

Related papers

• Universal Operational Privacy in Distributed Quantum Sensing [3.758871793953489]
  We introduce a universal operational privacy framework for distributed quantum sensing networks.<n>A protocol-independent criterion ensures that no information about individual parameters is accessible to untrusted parties.<n>Our results establish universal operational constraints governing privacy in distributed quantum sensing networks.
  arXiv  Detail & Related papers  (2026-01-27T05:17:46Z)
• How Entanglement Reshapes the Geometry of Quantum Differential Privacy [10.99782151422611]
  We show that entanglement serves as a privacy-enhancing resource, offering a geometric and operational foundation for designing robust privacy-preserving quantum protocols.<n>Our findings demonstrate that entanglement serves as a privacy-enhancing resource, offering a geometric and operational foundation for designing robust privacy-preserving quantum protocols.
  arXiv  Detail & Related papers  (2026-01-27T02:50:51Z)
• A unifying framework for differentially private quantum algorithms [0.0]
  We propose a novel and general definition of neighbouring quantum states. We demonstrate that this definition captures the underlying structure of quantum encodings. We also investigate an alternative setting where we are provided with multiple copies of the input state.
  arXiv  Detail & Related papers  (2023-07-10T17:44:03Z)
• Quantum Pufferfish Privacy: A Flexible Privacy Framework for Quantum Systems [19.332726520752846]
  We propose a versatile privacy framework for quantum systems, termed quantum pufferfish privacy (QPP) Inspired by classical pufferfish privacy, our formulation generalizes and addresses limitations of quantum differential privacy. We show that QPP can be equivalently formulated in terms of the Datta-Leditzky information spectrum divergence.
  arXiv  Detail & Related papers  (2023-06-22T17:21:17Z)
• Brownian Noise Reduction: Maximizing Privacy Subject to Accuracy Constraints [53.01656650117495]
  There is a disconnect between how researchers and practitioners handle privacy-utility tradeoffs. Brownian mechanism works by first adding Gaussian noise of high variance corresponding to the final point of a simulated Brownian motion. We complement our Brownian mechanism with ReducedAboveThreshold, a generalization of the classical AboveThreshold algorithm.
  arXiv  Detail & Related papers  (2022-06-15T01:43:37Z)
• Fully Adaptive Composition in Differential Privacy [53.01656650117495]
  Well-known advanced composition theorems allow one to query a private database quadratically more times than basic privacy composition would permit. We introduce fully adaptive composition, wherein both algorithms and their privacy parameters can be selected adaptively. We construct filters that match the rates of advanced composition, including constants, despite allowing for adaptively chosen privacy parameters.
  arXiv  Detail & Related papers  (2022-03-10T17:03:12Z)
• Quantum Differential Privacy: An Information Theory Perspective [2.9005223064604073]
  We discuss 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.
  arXiv  Detail & Related papers  (2022-02-22T08:12:50Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)
• Quantum-secure message authentication via blind-unforgeability [74.7729810207187]
  We propose a natural definition of unforgeability against quantum adversaries called blind unforgeability. This notion defines a function to be predictable if there exists an adversary who can use "partially blinded" access to predict values. We show the suitability of blind unforgeability for supporting canonical constructions and reductions.
  arXiv  Detail & Related papers  (2018-03-10T05:31:38Z)

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.