Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Certifying the quantum local differential privacy ofan untrusted mechanism: a no-go theorem and acomposable trusted-probe protocol

Clifford N. Jones, Khem Narayan Poudel

Published Nov 11, 2026• 0 citations
PDF (CC BY)Publisher

Abstract

Abstract Quantum local differential privacy (QLDP) bounds how much any measurement can distinguish the outputs of a mechanism on neighboring inputs, but existing theory quantifies privacy under the assumption that the mechanism is trusted and characterized. We ask whether the QLDP parameter of an untrusted quantum mechanism can be certified from observed statistics, and we answer in two parts. First, we prove a no-go theorem: under full device independence, where the measurement is also untrusted, no protocol can certify any finite bound on the privacy parameter, because the privacy action of a channel can be absorbed into the untrusted measurement without changing the observed statistics. Second, we identify the minimal trusted-probe model that escapes this obstruction: the verifier prepares informationally complete test states, applies a characterized informationally complete measurement to the output, and reports the worst-case privacy parameter over all mechanisms consistent with the data. The resulting certificate is a sound upper bound on the true leakage, admits a closed form on the optimal mechanism family used for private inference, and remains valid under finite statistics against adaptive, memoryful adversarial strategies through a martingale concentration bound. The certified mechanism retains the known quantum utility advantage for non-binary data up to a quantified noise threshold, and the certificate is composably secure in the abstract-cryptography framework, yielding a certified-private-aggregation resource for federated settings. The results connect quantum differential privacy with quantum certification by treating privacy leakage itself as the operational quantity to be certified.

DOI
10.21203/rs.3.rs-10297234/v1

Related papers

How Entanglement Reshapes the Geometry of Quantum Differential Privacy

Xi Wang, Parastoo Sadeghi, Guodong Shi

Quantum differential privacy provides a rigorous framework for quantifying privacy guarantees in quantum information processing. While classical correlations are typically regarded as adversarial to privacy, the role of their quantum analogue, entanglement, is not well understood. In this work, we investigate how quantum entanglement fundamentally shapes quantum local differential privacy (QLDP). We consider a bipartite quantum system whose input state has a prescribed level of entanglement, characterized by a lower bound on the entanglement entropy. Each subsystem is then processed by a local quantum mechanism and measured using local operations only, ensuring that no additional entanglement is generated during the process. Our main result reveals a sharp phase-transition phenomenon in the relation between entanglement and QLDP: below a mechanism-dependent entropy threshold, the optimal privacy leakage level mirrors that of unentangled inputs; beyond this threshold, the exact privacy leakage is strictly smaller than its unentangled value and admits an explicitly computable upper bound that strictly decreases with the entropy. This bound can also certify that some non-private mechanisms become private under sufficiently strong entanglement constraints. The phase-transition phenomenon gives rise to a nonlinear dependence of the certified privacy-leakage upper bound on the entanglement entropy, even though the underlying quantum mechanisms and measurements are linear. We show that the transition is governed by the intrinsic non-convex geometry of the set of entanglement-constrained quantum states, which we parametrize as a smooth manifold and analyze via Riemannian optimization. Our findings demonstrate that entanglement serves as a genuine privacy-enhancing resource, offering a geometric and operational foundation for designing robust privacy-preserving quantum protocols.

cs.ITCross-listedarXiv:2601.19126•Jan 28, 2026•1 citation

High quantum local differential privacy breaks entanglement

Sujeet Bhalerao, Theshani Nuradha, Felix Leditzky

Differential privacy provides a mathematical framework for guaranteeing privacy for sensitive data. In quantum information processing, the interaction of privacy constraints with quantum resources such as entanglement remains a question of interest. Given that the utility of many protocols, and often the presence of a quantum advantage, relies on quantum resources such as entanglement, it is crucial to understand when a privacy requirement for a quantum channel is compatible with the channel's ability to preserve entanglement. We study this question for quantum local differential privacy (QLDP). Our main result shows that every $\varepsilon$-QLDP channel with a $d$-dimensional input is entanglement-breaking whenever $\varepsilon\leq\log\frac{d}{d-1}$. We also prove an approximate version for $(\varepsilon,δ)$-QLDP, where channels in the same high-privacy regime are close in diamond norm to an entanglement-breaking channel. We further prove a composition result for a collection of private quantum channels having entangled inputs and global measurements in the high-privacy regime. Finally, we apply our results to private quantum learning theory. We prove that any learning protocol using arbitrary quantum memory on copies of the output of an entanglement-breaking channel can be simulated by a protocol that measures the corresponding unprocessed input copies one at a time while storing only classical information. Combining this result with our high-privacy entanglement-breaking theorem, we show that under sufficiently private local noise, a learning protocol with quantum memory for purity testing and bipartite product testing is subject to the sample complexity lower bounds for protocols with single-copy measurements on the noiseless tasks. We also obtain stronger sample complexity lower bounds when a single highly private channel acts on the entire multipartite input.

quant-pharXiv:2609.13418•Sep 15, 2026•0 citations

Optimal quantum locally differentially private mechanisms in the high-privacy regime

Yuuya Yoshida

We optimize the trade-off between privacy and utility in the high-privacy regime. We adopt local differential privacy (LDP) and its quantum extension, quantum local differential privacy (QLDP), for privacy protection, and investigate utility functions including the Holevo information (which reduces to the mutual information in the classical case) and the error exponents in symmetric and asymmetric hypothesis testing. Under the LDP and QLDP constraints, these utility functions have classical and quantum optimal values, which we denote simply by $C$ and $Q$, respectively, in this abstract. In this paper, we provide optimal LDP and QLDP mechanisms achieving the classical and quantum optimal values in the high-privacy regime, and prove that the asymptotic ratio $Q/C$ in this regime takes the same value regardless of the utility function. Our results reveal quantum advantages (specifically, $Q/C\ge3/2$) for the above utility functions when the private data take at least three possible values. In addition, conditional on a mathematical conjecture concerning equi-isoclinic tight fusion frames (EITFFs), our QLDP mechanisms also exhibit quantum advantages in a moderate-privacy regime.

quant-pharXiv:2605.27278•May 27, 2026•1 citation

Quantum Probabilistic Local Differential Privacy: Structural Properties and Sample Complexity Bounds

Xian Shi

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.

quant-pharXiv:2607.06307•Jul 8, 2026•0 citations

When Does Quantum Differential Privacy Compose?

Daniel Alabi, Theshani Nuradha

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.

quant-pharXiv:2601.00337•Leibniz international proceedings in informatics•Jan 2, 2026•4 citations

Quantum Information Ordering and Differential Privacy

Naqueeb Ahmad Warsi, Ayanava Dasgupta, Masahito Hayashi

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 $(\varepsilon,δ)$-QDP mechanisms by identifying the most informative $(\varepsilon,δ)$-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.

quant-pharXiv:2511.01467•IEEE Transactions on Information Theory•Nov 4, 2025•8 citations
Abstract Quantum local differential privacy (QLDP) bounds how much any measurement can distinguish the outputs of a mechanism on neighboring inputs, but existing theory quantifies privacy under the assumption that the mechanism is trusted and characterized. We ask whether the QLDP parameter of an untrusted quantum mechanism can be certified from observed statistics, and we answer in two parts. First, we prove a no-go theorem: under full device independence, where the measurement is also untrusted, no protocol can certify any finite bound on the privacy parameter, because the privacy action of a channel can be absorbed into the untrusted measurement without changing the observed statistics. Second, we identify the minimal trusted-probe model that escapes this obstruction: the verifier prepares informationally complete test states, applies a characterized informationally complete measurement to the output, and reports the worst-case privacy parameter over all mechanisms consistent with the data. The resulting certificate is a sound upper bound on the true leakage, admits a closed form on the optimal mechanism family used for private inference, and remains valid under finite statistics against adaptive, memoryful adversarial strategies through a martingale concentration bound. The certified mechanism retains the known quantum utility advantage for non-binary data up to a quantified noise threshold, and the certificate is composably secure in the abstract-cryptography framework, yielding a certified-private-aggregation resource for federated settings. The results connect quantum differential privacy with quantum certification by treating privacy leakage itself as the operational quantity to be certified.
Quantum differential privacy provides a rigorous framework for quantifying privacy guarantees in quantum information processing. While classical correlations are typically regarded as adversarial to privacy, the role of their quantum analogue, entanglement, is not well understood. In this work, we investigate how quantum entanglement fundamentally shapes quantum local differential privacy (QLDP). We consider a bipartite quantum system whose input state has a prescribed level of entanglement, characterized by a lower bound on the entanglement entropy. Each subsystem is then processed by a local quantum mechanism and measured using local operations only, ensuring that no additional entanglement is generated during the process. Our main result reveals a sharp phase-transition phenomenon in the relation between entanglement and QLDP: below a mechanism-dependent entropy threshold, the optimal privacy leakage level mirrors that of unentangled inputs; beyond this threshold, the exact privacy leakage is strictly smaller than its unentangled value and admits an explicitly computable upper bound that strictly decreases with the entropy. This bound can also certify that some non-private mechanisms become private under sufficiently strong entanglement constraints. The phase-transition phenomenon gives rise to a nonlinear dependence of the certified privacy-leakage upper bound on the entanglement entropy, even though the underlying quantum mechanisms and measurements are linear. We show that the transition is governed by the intrinsic non-convex geometry of the set of entanglement-constrained quantum states, which we parametrize as a smooth manifold and analyze via Riemannian optimization. Our findings demonstrate that entanglement serves as a genuine privacy-enhancing resource, offering a geometric and operational foundation for designing robust privacy-preserving quantum protocols.
Differential privacy provides a mathematical framework for guaranteeing privacy for sensitive data. In quantum information processing, the interaction of privacy constraints with quantum resources such as entanglement remains a question of interest. Given that the utility of many protocols, and often the presence of a quantum advantage, relies on quantum resources such as entanglement, it is crucial to understand when a privacy requirement for a quantum channel is compatible with the channel's ability to preserve entanglement. We study this question for quantum local differential privacy (QLDP). Our main result shows that every ε\varepsilonε-QLDP channel with a ddd-dimensional input is entanglement-breaking whenever ε≤log⁡dd−1\varepsilon\leq\log\frac{d}{d-1}ε≤logd−1d​. We also prove an approximate version for (ε,δ)(\varepsilon,δ)(ε,δ)-QLDP, where channels in the same high-privacy regime are close in diamond norm to an entanglement-breaking channel. We further prove a composition result for a collection of private quantum channels having entangled inputs and global measurements in the high-privacy regime. Finally, we apply our results to private quantum learning theory. We prove that any learning protocol using arbitrary quantum memory on copies of the output of an entanglement-breaking channel can be simulated by a protocol that measures the corresponding unprocessed input copies one at a time while storing only classical information. Combining this result with our high-privacy entanglement-breaking theorem, we show that under sufficiently private local noise, a learning protocol with quantum memory for purity testing and bipartite product testing is subject to the sample complexity lower bounds for protocols with single-copy measurements on the noiseless tasks. We also obtain stronger sample complexity lower bounds when a single highly private channel acts on the entire multipartite input.
We optimize the trade-off between privacy and utility in the high-privacy regime. We adopt local differential privacy (LDP) and its quantum extension, quantum local differential privacy (QLDP), for privacy protection, and investigate utility functions including the Holevo information (which reduces to the mutual information in the classical case) and the error exponents in symmetric and asymmetric hypothesis testing. Under the LDP and QLDP constraints, these utility functions have classical and quantum optimal values, which we denote simply by CCC and QQQ, respectively, in this abstract. In this paper, we provide optimal LDP and QLDP mechanisms achieving the classical and quantum optimal values in the high-privacy regime, and prove that the asymptotic ratio Q/CQ/CQ/C in this regime takes the same value regardless of the utility function. Our results reveal quantum advantages (specifically, Q/C≥3/2Q/C\ge3/2Q/C≥3/2) for the above utility functions when the private data take at least three possible values. In addition, conditional on a mathematical conjecture concerning equi-isoclinic tight fusion frames (EITFFs), our QLDP mechanisms also exhibit quantum advantages in a moderate-privacy regime.
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.
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.
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 fff-divergence. This approach completely characterizes (ε,δ)(\varepsilon,δ)(ε,δ)-QDP mechanisms by identifying the most informative (ε,δ)(\varepsilon,δ)(ε,δ)-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.