{"title":"概率隐形传态中的可逆纠缠匹配方法","authors":"Mei-xia ZHAO","doi":"10.1016/S1005-8885(13)60210-1","DOIUrl":null,"url":null,"abstract":"<div><p>This paper proposes an invertible entanglement matching method to realize an optimal probabilitic teleportation by introducing an auxiliary quantum channel. This requires the channel parameter matrix (CPM) of the auxiliary quantum channel to be equal to the invertible matrix of CPM of the transmission channel. By using this method, the probability of successful teleportation is more than 1/2.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"20 ","pages":"Pages 113-116"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(13)60210-1","citationCount":"0","resultStr":"{\"title\":\"Invertible entanglement matching method in probabilitic teleportation\",\"authors\":\"Mei-xia ZHAO\",\"doi\":\"10.1016/S1005-8885(13)60210-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper proposes an invertible entanglement matching method to realize an optimal probabilitic teleportation by introducing an auxiliary quantum channel. This requires the channel parameter matrix (CPM) of the auxiliary quantum channel to be equal to the invertible matrix of CPM of the transmission channel. By using this method, the probability of successful teleportation is more than 1/2.</p></div>\",\"PeriodicalId\":35359,\"journal\":{\"name\":\"Journal of China Universities of Posts and Telecommunications\",\"volume\":\"20 \",\"pages\":\"Pages 113-116\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S1005-8885(13)60210-1\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of China Universities of Posts and Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1005888513602101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of China Universities of Posts and Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1005888513602101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
Invertible entanglement matching method in probabilitic teleportation
This paper proposes an invertible entanglement matching method to realize an optimal probabilitic teleportation by introducing an auxiliary quantum channel. This requires the channel parameter matrix (CPM) of the auxiliary quantum channel to be equal to the invertible matrix of CPM of the transmission channel. By using this method, the probability of successful teleportation is more than 1/2.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
