Differential privacy (DP) is an influential privacy measure and has been studied to protect private data. DP has been often studied in classical probability theory, but few researchers studied quantum versions of DP. In this paper, we consider classical-quantum DP mechanisms which (i) convert binary private data to quantum states and (ii) satisfy a quantum version of the DP constraint. The class of classical-quantum DP mechanisms contains classical DP mechanisms. As a main result, we show that some classical DP mechanism optimizes any information quantity satisfying the information processing inequality. Therefore, the performance of classical DP mechanisms attains that of classical-quantum DP mechanisms.
Differential categories provide an axiomatization of the basics of differentiation and categorical models of differential linear logic. As differentiation is an important tool throughout quantum mechanics and quantum information, it makes sense to study applications of the theory of differential categories to categorical quantum foundations. In categorical quantum foundations, compact closed categories (and therefore traced symmetric monoidal categories) are one of the main objects of study, in particular the category of finite-dimensional Hilbert spaces FHilb. In this paper, we will explain why the only differential category structure on FHilb is the trivial one. This follows from a sort of in-compatibility between the trace of FHilb and possible differential category structure. That said, there are interesting non-trivial examples of traced/compact closed differential categories, which we also discuss. The goal of this paper is to introduce differential categories to the broader categorical quantum foundation community and hopefully open the door to further work in combining these two fields. While the main result of this paper may seem somewhat "negative" in achieving this goal, we discuss interesting potential applications of differential categories to categorical quantum foundations.
Abstract Recent research has demonstrated the potential of quantum algorithms to exploit vulnerabilities in various popular constructions, such as certain block ciphers like Feistel, Even-Mansour, and multiple MACs, within the superposition query model. In this study, we delve into the security of block ciphers against quantum threats, particularly investigating their susceptibility to cryptanalysis techniques, notably exploring quantum adaptations of differential cryptanalysis. Initially, we introduce a BV-based quantum algorithm for identifying linear structures with a complexity of
O(n) O ( n ) , where n denotes the number of bits in the function. Subsequently, we illustrate the application of this algorithm in devising quantum differential cryptanalysis techniques, including quantum differential cryptanalysis, quantum small probability differential cryptanalysis, and quantum impossible differential cryptanalysis, demonstrating polynomial acceleration compared to prior approaches. By treating the encryption function as a unified entity, our algorithm circumvents the traditional challenge of extending differential paths in differential cryptanalysis.