Fetching the paper…
Reading the bibliography…
We propose a versatile privacy framework for quantum systems, termed quantum pufferfish privacy (QPP).
A. C. Thompson, “On certain contraction mappings in a partially ordered vector space.” Proceedings of American Mathematical Society , vol. 14, no. 3, pp. 438–443, 1963
1963
Earlier work this paper cites.
E. B. Davies and J. T. Lewis, “An operational approach to quantum probability,” Communications in Mathematical Physics , vol. 17, no. 3, pp. 239–260, September 1970
1970
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.
G. Lindblad, “Completely positive maps and entropy inequalities,” Communications in Mathematical Physics , vol. 40, pp. 147–151, June 1975
1975
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.
E. B. Davies, Quantum Theory of Open Systems . Academic Press, 1976
1976
Earlier work this paper cites.
M. Ozawa, “Quantum measuring processes of continuous observables,” Journal of Mathematical Physics , vol. 25, no. 1, pp. 79–87, 1984
1984
Earlier work this paper cites.
D. Petz, “Quasi-entropies for States of a von Neumann Algebra,” Publications of the Research Institute for Mathematical Sciences , vol. 21, pp. 787–800, 1985
1985
Earlier work this paper cites.
——, “Quasi-entropies for finite quantum systems,” Reports in Mathematical Physics , vol. 23, pp. 57–65, 1986
1986
Earlier work this paper cites.
M. Ohya and D. Petz, Quantum Entropy and its Use . Springer Science & Business Media, 1993
1993
Earlier work this paper cites.
C. Fuchs, “Distinguishability and accessible information in quantum theory,” Ph.D. dissertation, University of New Mexico, New Mexico, December 1996, arXiv:quant-ph/9601020
1996
Earlier work this paper cites.
A. Kitaev, “Quantum computations: algorithms and error correction,” Russian Mathematical Surveys , vol. 52, pp. 1191–1249, 1997
1997
Earlier work this paper cites.
M. Horodecki, P. Horodecki, and R. Horodecki, “General teleportation channel, singlet fraction, and quasidistillation,” Physical Review A , vol. 60, pp. 1888–1898, Sep. 1999
1999
Earlier work this paper cites.
B. M. Terhal, D. P. DiVincenzo, and D. W. Leung, “Hiding bits in Bell states,” Physical Review Letters , vol. 86, no. 25, pp. 5807–5810, Jun. 2001
2001
Earlier work this paper cites.
D. P. DiVincenzo, D. W. Leung, and B. M. Terhal, “Quantum data hiding,” IEEE Transactions on Information Theory , vol. 48, no. 3, pp. 580–598, 2002
2002
Earlier work this paper cites.
T. Eggeling and R. F. Werner, “Hiding classical data in multipartite quantum states,” Physical Review Letters , vol. 89, no. 9, p. 097905, Aug. 2002
2002
Earlier work this paper cites.
J. Watrous, “Limits on the power of quantum statistical zero-knowledge,” Proceedings of IEEE Symposium on Foundations of Computer Science , pp. 459–468, November 2002, arXiv:quant-ph/0202111
2002
Earlier work this paper cites.
A. Evfimievski, J. Gehrke, and R. Srikant, “Limiting privacy breaches in privacy preserving data mining,” in Proceedings of ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , 2003, pp. 211–222
2003
Earlier work this paper cites.
P. Hayden, D. Leung, P. W. Shor, and A. Winter, “Randomizing quantum states: Constructions and applications,” Communications in Mathematical Physics , vol. 250, no. 2, pp. 371–391, 2004
2004
Earlier work this paper cites.
P. Hayden, D. Leung, and G. Smith, “Multiparty data hiding of quantum information,” Physical Review A , vol. 71, no. 6, p. 062339, Jun. 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, “A sharp continuity estimate for the von Neumann entropy,” Journal of Physics A: Mathematical and Theoretical , vol. 40, no. 28, p. 8127, July 2007
2007
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.
W. Matthews, S. Wehner, and A. Winter, “Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding,” Communications in Mathematical Physics , vol. 291, no. 3, pp. 813–843, 2009
2009
Earlier work this paper cites.
J. Watrous, “Semidefinite programs for completely bounded norms,” Theory of Computing , vol. 5, no. 11, pp. 217–238, 2009
2009
Earlier work this paper cites.
——, “Zero-knowledge against quantum attacks,” SIAM Journal on Computing , vol. 39, no. 1, pp. 25–58, 2009, arXiv:quant-ph/0511020
2009
Earlier work this paper cites.
D. Aharonov, V. Jones, and Z. Landau, “A polynomial quantum algorithm for approximating the Jones polynomial,” Algorithmica , vol. 55, no. 3, pp. 395–421, 2009
2009
Earlier work this paper cites.
T. Nuradha and Z. Goldfeld, “An information-theoretic characterization of pufferfish privacy,” in Proceedings of IEEE International Symposium on Information Theory (ISIT) . IEEE, 2022, pp. 2005–2010
2010
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.
D. Kifer and B.-R. Lin, “An axiomatic view of statistical privacy and utility,” Journal of Privacy and Confidentiality , vol. 4, no. 1, 2012
2012
Cited alongside, same era.
R. Bassily, A. Groce, J. Katz, and A. Smith, “Coupled-worlds privacy: Exploiting adversarial uncertainty in statistical data privacy,” in Proceedings of IEEE Symposium on Foundations of Computer Science . IEEE, 2013, pp. 439–448
2013
Cited alongside, same era.
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
Cited alongside, same era.
R. L. Frank and E. H. Lieb, “Monotonicity of a relative Rényi entropy,” Journal of Mathematical Physics , vol. 54, p. 122201, 2013
2013
Cited alongside, same era.
W. Liang, H. Chen, R. Liu, Y. Wu, and C. Li, “A pufferfish privacy mechanism for monitoring web browsing behavior under temporal correlations,” Computers & Security , vol. 92, p. 101754, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
M. Jagielski, J. Ullman, and A. Oprea, “Auditing differentially private machine learning: How private is private SGD?” Advances in Neural Information Processing Systems , vol. 33, pp. 22 205–22 216, 2020
2020
Later among the works it cites.
Y. Zeng, Y. Sang, S. Luo, and M. Song, “A pufferfish privacy mechanism for the trajectory clustering task,” in Parallel Architectures, Algorithms and Programming . Singapore: Springer Singapore, 2021, pp. 307–317
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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
Cited alongside, same era.
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.
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.
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.
Ú. 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.
S. Lloyd, M. Mohseni, and P. Rebentrost, “Quantum principal component analysis,” Nature Physics , vol. 10, no. 9, pp. 631–633, Jul. 2014
2014
Cited alongside, same era.
S. Kessler, E. Buchmann, and K. Böhm, “Deploying and evaluating pufferfish privacy for smart meter data,” in IEEE Intl Conf on Ubiquitous Intelligence and Computing and IEEE Intl Conf on Autonomic and Trusted Computing and IEEE Intl Conf on Scalable Computing and Communications and Its Associated Workshops (UIC-ATC-ScalCom) , 2015, pp. 229–238
2015
Cited alongside, same era.
M. Tomamichel, Quantum Information Processing with Finite Resources: Mathematical Foundations . Springer, 2015, vol. 5
2015
Cited alongside, same era.
Y. Quek, S. Arunachalam, and J. A. Smolin, “Private learning implies quantum stability,” in Proceedings of International Conference on Advances in Neural Information Processing Systems , vol. 34, 2021, pp. 20 503–20 515
2021
Later among the works it cites.
Y. Du, M.-H. Hsieh, T. Liu, D. Tao, and N. Liu, “Quantum noise protects quantum classifiers against adversaries,” Physical Review Research , vol. 3, no. 2, p. 023153, 2021
2021
Later among the works it cites.
E. Perrier, “Quantum fair machine learning,” in Proceedings of AAAI/ACM Conference on AI, Ethics, and Society , 2021, pp. 843–853
2021
Later among the works it cites.
R. Salzmann, N. Datta, G. Gour, X. Wang, and M. M. Wilde, “Symmetric distinguishability as a quantum resource,” New Journal of Physics , vol. 23, no. 8, p. 083016, 2021
2021
Later among the works it cites.
G. De Palma, M. Marvian, D. Trevisan, and S. Lloyd, “The quantum Wasserstein distance of order 1,” IEEE Transactions on Information Theory , vol. 67, no. 10, pp. 6627–6643, 2021
2021
Later among the works it cites.
R. Chen, Z. Song, X. Zhao, and X. Wang, “Variational quantum algorithms for trace distance and fidelity estimation,” Quantum Science and Technology , vol. 7, no. 1, pp. 015–019, 2021
2021
Later among the works it cites.
M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, “Variational quantum algorithms,” Nature Reviews Physics , vol. 3, pp. 625–644, Aug. 2021
2021
Later among the works it cites.
W. Zhang, O. Ohrimenko, and R. Cummings, “Attribute privacy: Framework and mechanisms,” in Proceedings of ACM Conference on Fairness, Accountability, and Transparency , 2022, pp. 757–766
2022
Later among the works it cites.
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.
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.
B. Pejó and D. Desfontaines, Guide to Differential Privacy Modifications: A Taxonomy of Variants and Extensions . Springer Briefs in Computer Science Serries. Springer International Publishing AG, Cham, 2022
2022
Later among the works it cites.
S. Nietert, Z. Goldfeld, and R. Cummings, “Outlier-robust optimal transport: Duality, structure, and statistical analysis,” in Proceedings of International Conference on Artificial Intelligence and Statistics , vol. 151, 2022, pp. 11 691–11 719
2022
Later among the works it cites.
2022
Later among the works it cites.
K. Bharti, A. Cervera-Lierta, T. H. Kyaw, T. Haug, S. Alperin-Lea, A. Anand, M. Degroote, H. Heimonen, J. S. Kottmann, T. Menke, W.-K. Mok, S. Sim, L.-C. Kwek, and A. Aspuru-Guzik, “Noisy intermediate-scale quantum (NISQ) algorithms,” Reviews of Modern Physics , vol. 94, no. 1, p. 015004, Feb. 2022
2022
Later among the works it cites.
R. M. Cardell-Oliver and B. Ke, “Towards an activity-aware pufferfish framework for local privacy of household smart water meter data,” in Proceedings of the ACM International Conference on Systems for Energy-Efficient Buildings, Cities, and Transportation , 2023, pp. 328–332
2023
Closest in time.
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
Closest in time.
2023
Closest in time.
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
Closest in time.
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
Closest in time.
S. Rethinasamy, R. Agarwal, K. Sharma, and M. M. Wilde, “Estimating distinguishability measures on quantum computers,” Physical Review A , vol. 108, no. 1, p. 012409, Jul. 2023
2023
Closest in time.
B. Regula, L. Lami, and M. M. Wilde, “Postselected quantum hypothesis testing,” IEEE Transactions on Information Theory , vol. 70, no. 5, pp. 3453–3469, 2024
2024
Closest in time.
Q. Wang and Z. Zhang, “Fast quantum algorithms for trace distance estimation,” IEEE Transactions on Information Theory , vol. 70, no. 4, pp. 2720–2733, 2024
2024
Closest in time.