Fetching the paper…
Reading the bibliography…
A quantum generalized divergence by definition satisfies the data-processing inequality; as such, the relative decrease in such a divergence under the action of a quantum channel is at most one.
H. Chernoff, “A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations,” The Annals of Mathematical Statistics , pp. 493–507, 1952
1952
Earlier work this paper cites.
H. Umegaki, “Conditional expectation in an operator algebra, IV (entropy and information),” in Kodai Mathematical Seminar Reports , vol. 14. Department of Mathematics, Tokyo Institute of Technology, 1962, pp. 59–85
1962
Earlier work this paper cites.
W. Hoeffding, “Asymptotically optimal tests for multinomial distributions,” The Annals of Mathematical Statistics , pp. 369–401, 1965
1965
Earlier work this paper cites.
C. W. Helstrom, “Detection theory and quantum mechanics,” Information and Control , vol. 10, no. 3, pp. 254–291, 1967
1967
Earlier work this paper cites.
A. S. Holevo, “Statistical decision theory for quantum systems,” Journal of Multivariate Analysis , vol. 3, no. 4, pp. 337–394, 1973
1973
Earlier work this paper cites.
E. H. Lieb and M. B. Ruskai, “Proof of the strong subadditivity of quantum-mechanical entropy,” Journal of Mathematical Physics , vol. 14, no. 12, pp. 1938–1941, December 1973
1973
Earlier work this paper cites.
A. Uhlmann, “The ‘transition probability’ in the state space of a *-algebra,” Reports on Mathematical Physics , vol. 9, pp. 273–279, 1976
1976
Earlier work this paper cites.
C. A. Fuchs and C. M. Caves, “Mathematical techniques for quantum communication theory,” Open Systems & Information Dynamics , vol. 3, no. 3, pp. 345–356, 1995
1995
Earlier work this paper cites.
C. Fuchs and J. van de Graaf, “Cryptographic distinguishability measures for quantum-mechanical states,” IEEE Transactions on Information Theory , vol. 45, no. 4, pp. 1216–1227, may 1999
1999
Earlier work this paper cites.
O. Bousquet and A. Elisseeff, “Stability and generalization,” The Journal of Machine Learning Research , vol. 2, pp. 499–526, 2002
2002
Earlier work this paper cites.
K. M. R. Audenaert and J. Eisert, “Continuity bounds on the quantum relative entropy,” Journal of Mathematical Physics , vol. 46, no. 10, p. 102104, 2005
2005
Earlier work this paper cites.
C. Dwork, F. McSherry, K. Nissim, and A. Smith, “Calibrating noise to sensitivity in private data analysis,” in Proceedings of Conference on Theory of Cryptography, TCC , 2006, pp. 265–284
2006
Earlier work this paper cites.
K. M. R. Audenaert, J. Calsamiglia, R. Munoz-Tapia, E. Bagan, L. Masanes, A. Acin, and F. Verstraete, “Discriminating states: The quantum Chernoff bound,” Physical Review Letters , vol. 98, no. 16, p. 160501, 2007
2007
Earlier work this paper cites.
K. M. R. Audenaert, M. Nussbaum, A. Szkoła, and F. Verstraete, “Asymptotic error rates in quantum hypothesis testing,” Communications in Mathematical Physics , vol. 279, pp. 251–283, 2008
2008
Earlier work this paper cites.
M. Nussbaum and A. Szkoła, “The Chernoff lower bound for symmetric quantum hypothesis testing,” The Annals of Statistics , vol. 37, no. 2, pp. 1040–1057, 2009
2009
Earlier work this paper cites.
N. Datta, “Min-and max-relative entropies and a new entanglement monotone,” IEEE Transactions on Information Theory , vol. 55, no. 6, pp. 2816–2826, 2009
2009
Earlier work this paper cites.
S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith, “What can we learn privately?” SIAM Journal on Computing , vol. 40, no. 3, pp. 793–826, 2011
2011
Earlier work this paper cites.
2012
Earlier work this paper cites.
J. C. Duchi, M. I. Jordan, and M. J. Wainwright, “Local privacy and statistical minimax rates,” in IEEE Annual Symposium on Foundations of Computer Science , 2013, pp. 429–438
2013
Earlier work this paper cites.
M. Müller-Lennert, F. Dupuis, O. Szehr, S. Fehr, and M. Tomamichel, “On quantum Rényi entropies: A new generalization and some properties,” Journal of Mathematical Physics , vol. 54, no. 12, p. 122203, 2013
2013
Earlier work this paper cites.
C. Dwork and A. Roth, “The algorithmic foundations of differential privacy,” Foundations and Trends in Theoretical Computer Science (FnT-TCS) , vol. 9, no. 3-4, pp. 211–407, 2014
2014
Earlier work this paper cites.
D. Kifer and A. Machanavajjhala, “Pufferfish: A framework for mathematical privacy definitions,” ACM Transactions on Database Systems , vol. 39, no. 1, pp. 1–36, 2014
2014
Cited alongside, same era.
Ú. Erlingsson, V. Pihur, and A. Korolova, “Rappor: Randomized aggregatable privacy-preserving ordinal response,” in Proceedings of ACM SIGSAC Conference on Computer and Communications Security , 2014, pp. 1054–1067
2014
Cited alongside, same era.
P. Kairouz, S. Oh, and P. Viswanath, “Extremal mechanisms for local differential privacy,” in Advances in Neural Information Processing Systems , vol. 27, 2014, pp. 1–9
2014
Cited alongside, same era.
N. Datta and F. Leditzky, “Second-order asymptotics for source coding, dense coding, and pure-state entanglement conversions,” IEEE Transactions on Information Theory , vol. 61, no. 1, pp. 582–608, 2014
2014
Cited alongside, same era.
2022
Later among the works it cites.
Y. Du, M.-H. Hsieh, T. Liu, S. You, and D. Tao, “Quantum differentially private sparse regression learning,” IEEE Transactions on Information Theory , vol. 68, no. 8, pp. 5217–5233, 2022
2022
Later among the works it cites.
J. Guan, W. Fang, and M. Ying, “Verifying fairness in quantum machine learning,” in Proceedings of International Conference on Computer Aided Verification . Springer, 2022, pp. 408–429
2022
Later among the works it cites.
Y. Huang and C. L. Canonne, “Lemmas of differential privacy,” arXiv preprint arXiv:2211.11189 , 2022
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. M. Wilde, A. Winter, and D. Yang, “Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy,” Communications in Mathematical Physics , vol. 331, pp. 593–622, 2014
2014
Cited alongside, same era.
J. Bae and L.-C. Kwek, “Quantum state discrimination and its applications,” Journal of Physics A: Mathematical and Theoretical , vol. 48, no. 8, p. 083001, 2015
2015
Cited alongside, same era.
P. Cuff and L. Yu, “Differential privacy as a mutual information constraint,” in Proceedings of ACM SIGSAC Conference on Computer and Communications Security , 2016, pp. 43–54
2016
Cited alongside, same era.
L. Zhang, K. Bu, and J. Wu, “A lower bound on the fidelity between two states in terms of their trace-distance and max-relative entropy,” Linear and Multilinear Algebra , vol. 64, no. 5, pp. 801–806, 2016
2016
Cited alongside, same era.
A. W. Flores, K. Bechtel, and C. T. Lowenkamp, “False positives, false negatives, and false analyses: A rejoinder to machine bias: There’s software used across the country to predict future criminals. and it’s biased against blacks,” Fed. Probation , vol. 80, p. 38, 2016
2016
Cited alongside, same era.
M. Raginsky, A. Rakhlin, M. Tsao, Y. Wu, and A. Xu, “Information-theoretic analysis of stability and bias of learning algorithms,” in 2016 IEEE Information Theory Workshop (ITW) . IEEE, 2016, pp. 26–30
2016
Cited alongside, same era.
L. Zhou and M. Ying, “Differential privacy in quantum computation,” in Proceedings of IEEE Computer Security Foundations Symposium (CSF) . IEEE, 2017, pp. 249–262
2017
Cited alongside, same era.
M. Senekane, M. Mafu, and B. M. Taele, “Privacy-preserving quantum machine learning using differential privacy,” in Proceedings of IEEE AFRICON , 2017, pp. 1432–1435
2017
Cited alongside, same era.
T. Nuradha and Z. Goldfeld, “Pufferfish privacy: An information-theoretic study,” IEEE Transactions on Information Theory , vol. 69, no. 11, pp. 7336–7356, 2023
2023
Later among the works it cites.
2023
Later among the works it cites.
W. M. Watkins, S. Y.-C. Chen, and S. Yoo, “Quantum machine learning with differential privacy,” Scientific Reports , vol. 13, no. 1, p. 2453, 2023
2023
Later among the works it cites.
J.-C. Huang, Y.-L. Tsai, C.-H. H. Yang, C.-F. Su, C.-M. Yu, P.-Y. Chen, and S.-Y. Kuo, “Certified robustness of quantum classifiers against adversarial examples through quantum noise,” in Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2023, pp. 1–5
2023
Later among the works it cites.
A. Pensia, A. R. Asadi, V. Jog, and P.-L. Loh, “Simple binary hypothesis testing under local differential privacy and communication constraints,” in The Thirty Sixth Annual Conference on Learning Theory . PMLR, 2023, pp. 3229–3230
2023
Later among the works it cites.
2023
Later among the works it cites.
B. Zamanlooy and S. Asoodeh, “Strong data processing inequalities for locally differentially private mechanisms,” in 2023 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2023, pp. 1794–1799
2023
Later among the works it cites.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
J. Guan, “Optimal mechanisms for quantum local differential privacy,” 2024, arXiv:2407.13516
2024
Closest in time.
A. Pensia, V. Jog, and P.-L. Loh, “Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalities,” IEEE Transactions on Information Theory , vol. 70, no. 1, pp. 389–414, 2024
2024
Closest in time.