单量子位量子信道容量数值计算的误差分析

Kimikazu Kato, H. Imai, K. Imai
{"title":"单量子位量子信道容量数值计算的误差分析","authors":"Kimikazu Kato, H. Imai, K. Imai","doi":"10.1109/ISVD.2007.21","DOIUrl":null,"url":null,"abstract":"Numerical estimation of quantum channel capacity is an important problem both theoretically and practically. Oto et al. showed an effective approximation algorithm to compute a capacity of a one-qubit quantum channel. In this paper, we show an explicit upper bound for the error of their algorithm. The algorithm might be repeatedly used in the verification of a certain equation or inequality. The bound of the error we give is a criterion to decide when to stop that iteration, and eventually it can improve the performance of the whole process of the calculation.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity\",\"authors\":\"Kimikazu Kato, H. Imai, K. Imai\",\"doi\":\"10.1109/ISVD.2007.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Numerical estimation of quantum channel capacity is an important problem both theoretically and practically. Oto et al. showed an effective approximation algorithm to compute a capacity of a one-qubit quantum channel. In this paper, we show an explicit upper bound for the error of their algorithm. The algorithm might be repeatedly used in the verification of a certain equation or inequality. The bound of the error we give is a criterion to decide when to stop that iteration, and eventually it can improve the performance of the whole process of the calculation.\",\"PeriodicalId\":148710,\"journal\":{\"name\":\"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISVD.2007.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVD.2007.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

量子信道容量的数值估计是一个重要的理论和实践问题。Oto等人展示了一种有效的近似算法来计算一个单量子位量子信道的容量。本文给出了该算法误差的显式上界。该算法在验证某一方程或不等式时可能被重复使用。我们给出的误差范围是决定何时停止迭代的一个准则,最终可以提高整个计算过程的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity
Numerical estimation of quantum channel capacity is an important problem both theoretically and practically. Oto et al. showed an effective approximation algorithm to compute a capacity of a one-qubit quantum channel. In this paper, we show an explicit upper bound for the error of their algorithm. The algorithm might be repeatedly used in the verification of a certain equation or inequality. The bound of the error we give is a criterion to decide when to stop that iteration, and eventually it can improve the performance of the whole process of the calculation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信