基于矩阵重新排列的纠缠度量

Sushamana Sharma, J. K. Sharma
{"title":"基于矩阵重新排列的纠缠度量","authors":"Sushamana Sharma, J. K. Sharma","doi":"10.51983/ajsat-2018.7.1.1024","DOIUrl":null,"url":null,"abstract":"Quantum information processing is the essential requirement of quantum technology. The foundation of information processing is the quantum entanglement. We propose a new entanglement measure to quantify entanglement and it is based on matrix realignment technique. A comparative study of proposed measure with concurrence for different types of entangled states is also discussed.","PeriodicalId":414891,"journal":{"name":"Asian Journal of Science and Applied Technology","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Entanglement Measure Based on Matrix Realignment\",\"authors\":\"Sushamana Sharma, J. K. Sharma\",\"doi\":\"10.51983/ajsat-2018.7.1.1024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quantum information processing is the essential requirement of quantum technology. The foundation of information processing is the quantum entanglement. We propose a new entanglement measure to quantify entanglement and it is based on matrix realignment technique. A comparative study of proposed measure with concurrence for different types of entangled states is also discussed.\",\"PeriodicalId\":414891,\"journal\":{\"name\":\"Asian Journal of Science and Applied Technology\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asian Journal of Science and Applied Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.51983/ajsat-2018.7.1.1024\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asian Journal of Science and Applied Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.51983/ajsat-2018.7.1.1024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

量子信息处理是量子技术的本质要求。信息处理的基础是量子纠缠。我们提出了一种新的基于矩阵重组技术的纠缠度量来量化纠缠。对不同类型纠缠态的并发测度进行了比较研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Entanglement Measure Based on Matrix Realignment
Quantum information processing is the essential requirement of quantum technology. The foundation of information processing is the quantum entanglement. We propose a new entanglement measure to quantify entanglement and it is based on matrix realignment technique. A comparative study of proposed measure with concurrence for different types of entangled states is also discussed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Exploring Attentional Dynamics in Animated Programming Environments: Trajectories, Variability, and Predictors The Mythical Construction of the Spread of Lassa Fever among Garri Marketers: Empirical Evidence from Edo State, Nigeria Effect of Ethanolic and Chloroform Extracts of Lantana Camara Flowers on the Second Instar Stage of Anopheles Mosquito Larvae Rejuvenation of Pesticide Polluted Soil from the Isolated Microbial Flora of Agricultural Field Characterization of Tannery Effluent and Efficiency Assessment of Central Effluent Treatment Plant (CETP) at Savar in Bangladesh
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1