广义量子 Arimoto-Blahut 算法及其在量子信息瓶颈中的应用

IF 5.6 2区物理与天体物理 Q1 PHYSICS, MULTIDISCIPLINARY

Quantum Science and Technology Pub Date : 2024-09-03 DOI:10.1088/2058-9565/ad6eb1

Masahito Hayashi and Geng Liu

{"title":"广义量子 Arimoto-Blahut 算法及其在量子信息瓶颈中的应用","authors":"Masahito Hayashi and Geng Liu","doi":"10.1088/2058-9565/ad6eb1","DOIUrl":null,"url":null,"abstract":"Quantum information bottleneck was proposed by Grimsmo and Still (2016 Phys. Rev. A 94 012338) as a promising method for quantum supervised machine learning. To study this method, we generalize the quantum Arimoto–Blahut algorithm by Ramakrishnan et al (2021 IEEE Trans. Inf. Theory67 946) to a function defined over a set of density matrices with linear constraints so that our algorithm can be applied to optimizations of quantum operations. This algorithm has wider applicability, and we apply our algorithm to the quantum information bottleneck with three quantum systems. We numerically compare our obtained algorithm with the existing algorithm by Grimsmo and Still. Our numerical analysis shows that our algorithm is better than their algorithm.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":null,"pages":null},"PeriodicalIF":5.6000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalized quantum Arimoto–Blahut algorithm and its application to quantum information bottleneck\",\"authors\":\"Masahito Hayashi and Geng Liu\",\"doi\":\"10.1088/2058-9565/ad6eb1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quantum information bottleneck was proposed by Grimsmo and Still (2016 Phys. Rev. A 94 012338) as a promising method for quantum supervised machine learning. To study this method, we generalize the quantum Arimoto–Blahut algorithm by Ramakrishnan et al (2021 IEEE Trans. Inf. Theory67 946) to a function defined over a set of density matrices with linear constraints so that our algorithm can be applied to optimizations of quantum operations. This algorithm has wider applicability, and we apply our algorithm to the quantum information bottleneck with three quantum systems. We numerically compare our obtained algorithm with the existing algorithm by Grimsmo and Still. Our numerical analysis shows that our algorithm is better than their algorithm.\",\"PeriodicalId\":20821,\"journal\":{\"name\":\"Quantum Science and Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.6000,\"publicationDate\":\"2024-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Science and Technology\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.1088/2058-9565/ad6eb1\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Science and Technology","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1088/2058-9565/ad6eb1","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

量子信息瓶颈由 Grimsmo 和 Still（2016 Phys. Rev. A 94 012338）提出，是量子监督机器学习的一种有前途的方法。为了研究这种方法，我们将 Ramakrishnan 等人（2021 IEEE Trans. Inf. Theory67 946）的量子 Arimoto-Blahut 算法推广到一个定义在一组具有线性约束的密度矩阵上的函数，这样我们的算法就可以应用于量子运算的优化。这种算法具有更广泛的适用性，我们将算法应用于三个量子系统的量子信息瓶颈。我们用数值比较了我们获得的算法和 Grimsmo 和 Still 的现有算法。数值分析表明，我们的算法优于他们的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Generalized quantum Arimoto–Blahut algorithm and its application to quantum information bottleneck

Quantum information bottleneck was proposed by Grimsmo and Still (2016 Phys. Rev. A 94 012338) as a promising method for quantum supervised machine learning. To study this method, we generalize the quantum Arimoto–Blahut algorithm by Ramakrishnan et al (2021 IEEE Trans. Inf. Theory67 946) to a function defined over a set of density matrices with linear constraints so that our algorithm can be applied to optimizations of quantum operations. This algorithm has wider applicability, and we apply our algorithm to the quantum information bottleneck with three quantum systems. We numerically compare our obtained algorithm with the existing algorithm by Grimsmo and Still. Our numerical analysis shows that our algorithm is better than their algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Quantum Science and Technology Materials Science-Materials Science (miscellaneous)

CiteScore

11.20

自引率

3.00%

发文量

133

期刊介绍： Driven by advances in technology and experimental capability, the last decade has seen the emergence of quantum technology: a new praxis for controlling the quantum world. It is now possible to engineer complex, multi-component systems that merge the once distinct fields of quantum optics and condensed matter physics. Quantum Science and Technology is a new multidisciplinary, electronic-only journal, devoted to publishing research of the highest quality and impact covering theoretical and experimental advances in the fundamental science and application of all quantum-enabled technologies.