A novel definition for quantum privacy based on hypothesis testing is presented. This privacy notion possesses an operational interpretation based on the false positive and negative rates of adversaries attempting to distinguish among private categories to which quantum states belong using arbitrary measurements. Important properties of post processing and composition are established. The relationship between privacy against hypothesis-testing adversaries and quantum differential privacy are then examined. This enables analysis of hypothesis testing under differential privacy and in noisy quantum systems. It also provides an operational interpretation for quantum differential privacy.
A novel definition for quantum privacy based on hypothesis testing is presented. This privacy notion possesses an operational interpretation based on the false positive and negative rates of adversaries attempting to distinguish among private categories to which quantum states belong using arbitrary measurements. Important properties of post processing and composition are established. The relationship between privacy against hypothesis-testing adversaries and quantum differential privacy are then examined. This enables analysis of hypothesis testing under differential privacy and in noisy quantum systems. It also provides an operational interpretation for quantum differential privacy.
A novel definition for data privacy in quantum computing based on quantum hypothesis testing is presented in this paper. The parameters in this privacy notion possess an operational interpretation based on the success/failure of an omnipotent adversary being able to distinguish the private categories to which the data belongs using arbitrary measurements on quantum states. Important properties of post processing and composition are then proved for the new notion of privacy. The relationship between privacy against hypothesis-testing adversaries, defined in this paper, and quantum differential privacy are then examined. It is shown that these definitions are intertwined in some parameter regimes. This enables us to provide an interpretation for the privacy budget in quantum differential privacy based on its relationship with privacy against hypothesis testing adversaries.
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, Rényi differential privacy and the hypothesis testing interpretation to the quantum setting, providing several new properties and insights.
Differential privacy provides a rigorous framework for quantifying privacy leakage in data analysis, while its quantum extensions have become increasingly relevant with the development of quantum computing and quantum machine learning. In this work, we introduce and study quantum probabilistic local differential privacy, a relaxation of quantum local differential privacy in which the privacy constraint is allowed to fail on a spectral violation event with low probability. This quantity can be interpreted as the probability under the quantum superoperation of a quantum privacy-loss violation, and is closely related to the acceptance probability of the quantum Neyman-Pearson test at a small threshold. We investigate the basic structural properties of this privacy notion and clarify its relationship with existing forms of quantum differential privacy. We show the properties of quantum probabilistic local differential privacy under tensor-product composition and unitary post-processing, while it is in general neither convex nor closed under post-processing by arbitrary quantum channels. We further characterize when depolarizing noise satisfies quantum probabilistic local differential privacy under several representative scenarios. Finally, we connect quantum probabilistic privacy constraints with statistical inference by deriving a lower bound on probabilistically privatized contraction coefficients in terms of the hockey-stick divergence. As an application, we obtain sample complexity bounds of probabilistically privated asymmetric and symmetric quantum hypothesis testing. These results provide a systematic foundation for studying probabilistic privacy guarantees in quantum information processing and their operational consequences for private quantum statistical inference.
We study quantum differential privacy (QDP) by defining a notion of the order of informativeness between two pairs of quantum states. In particular, we show that if the hypothesis testing divergence of the one pair dominates over that of the other pair, then this dominance holds for every f-divergence. This approach completely characterizes (ε,δ)-QDP mechanisms by identifying the most informative (ε,δ)-DP quantum state pairs. We apply this to study precise limits for privatized hypothesis testing and privatized quantum parameter estimation, including tight upper-bounds on the quantum Fisher information under QDP. Finally, we establish near-optimal contraction bounds for differentially private quantum channels with respect to the Hockey-Stick divergence.
With the surging interest in quantum and hybrid classical-quantum systems, ensuring the privacy of generated quantum data is essential. Quantum differential privacy (QDP) has been introduced to ensure privacy for quantum states. However, the versatility of QDP is limited. We introduce a flexible privacy framework for quantum systems termed as Quantum PP (QPP). We show that QPP is captured exactly by an information-spectrum divergence, endowing the latter with its first operational interpretation. Then this divergence is used to study properties of QPP mechanisms, showcasing distinctions that arise in the quantum setting compared to the classical setting. We introduce the first algorithms that can be used to audit for privacy given a mechanism, which facilitates new approaches with the access to quantum devices. We analyse how the QPP framework provides better privacy-utility tradeoffs with the flexibility to incorporate application-specific criteria.To provide further insights on QPP, we comprehensively study measured hockey-stick divergences that find operational interpretation in the QPP framework as optimal privacy parameters. Studying statistical problems under privacy constraints is vital for understanding the price that we have to pay to ensure privacy. To this end, the contraction of statistical measures and divergences under privacy constraintsis an important technical tool. However, in the quantum setting, this area of research is largely unexplored even for fundamental statistical tasks. We characterize the contraction of quantum divergences under a local variant of quantum privacy, which enables this field of study. We completely characterize the privatized contraction coefficient of the trace distance, among others. Next, we utilize the information-theoretic tools developed to study statistical tasks under privacy constraints. To this end, we characterize the cost of privacy in quantum hypothesis testing and learning expectation of observables while ensuring privacy of quantum states. In sum, this thesis lays a theoretical foundation for ensuring the privacy of quantum data by introducing flexible privacy frameworks tailored to quantum systems. It also evaluates the tradeoffs involved in maintaining privacy during the testing and learning of properties of quantum data, offering information-theoretic tools to study statistical tasks under privacy constraints.
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.