{"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}
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.