4.7 Article

Optimal provable robustness of quantum classification via quantum hypothesis testing

期刊

NPJ QUANTUM INFORMATION
卷 7, 期 1, 页码 -

出版社

NATURE RESEARCH
DOI: 10.1038/s41534-021-00410-5

关键词

-

资金

  1. Shanghai Pujiang Talent Grant [20PJ1408400]
  2. NSFC International Young Scientists Project [12050410230]
  3. Innovation Program of the Shanghai Municipal Education Commission [2021-01-07-00-02E00087]
  4. Shanghai Municipal Science and Technology Major Project [2021SHZDZX0102]

向作者/读者索取更多资源

Quantum machine learning models have the potential to be faster and more accurate than classical models, but they are also vulnerable to input perturbations. A fundamental link between binary quantum hypothesis testing and provably robust quantum classification has been formalized, leading to a tight robustness condition that puts constraints on the amount of noise a classifier can tolerate. This robustness condition against worst-case noise scenarios extends to known noise sources, providing a framework to study the reliability of quantum classification protocols beyond adversarial attacks.
Quantum machine learning models have the potential to offer speedups and better predictive accuracy compared to their classical counterparts. However, these quantum algorithms, like their classical counterparts, have been shown to also be vulnerable to input perturbations, in particular for classification problems. These can arise either from noisy implementations or, as a worst-case type of noise, adversarial attacks. In order to develop defense mechanisms and to better understand the reliability of these algorithms, it is crucial to understand their robustness properties in the presence of natural noise sources or adversarial manipulation. From the observation that measurements involved in quantum classification algorithms are naturally probabilistic, we uncover and formalize a fundamental link between binary quantum hypothesis testing and provably robust quantum classification. This link leads to a tight robustness condition that puts constraints on the amount of noise a classifier can tolerate, independent of whether the noise source is natural or adversarial. Based on this result, we develop practical protocols to optimally certify robustness. Finally, since this is a robustness condition against worst-case types of noise, our result naturally extends to scenarios where the noise source is known. Thus, we also provide a framework to study the reliability of quantum classification protocols beyond the adversarial, worst-case noise scenarios.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据