Quantifying unknown entanglement by neural networks

IF 2.2 3区 物理与天体物理 Q1 PHYSICS, MATHEMATICAL Quantum Information Processing Pub Date : 2023-09-08 DOI:10.1007/s11128-023-04068-0
Xiaodie Lin, Zhenyu Chen, Zhaohui Wei
{"title":"Quantifying unknown entanglement by neural networks","authors":"Xiaodie Lin,&nbsp;Zhenyu Chen,&nbsp;Zhaohui Wei","doi":"10.1007/s11128-023-04068-0","DOIUrl":null,"url":null,"abstract":"<div><p>Quantum entanglement plays a crucial role in quantum information processing tasks and quantum mechanics; hence, quantifying unknown entanglement is a fundamental task. However, this is also challenging, as entanglement cannot be measured by any observables directly. In this paper, we train neural networks to quantify unknown entanglement, where the input features for neural networks are the outcome statistics data produced by measuring target quantum states with local or even single-qubit Pauli observables, and the training labels are well-chosen quantities. For bipartite quantum states, this quantity is coherent information, which is a lower bound for many popular entanglement measures, like the entanglement of distillation. For multipartite quantum states, we choose this quantity as the geometric measure of entanglement. It turns out that the neural networks we train have very good performance in quantifying unknown quantum entanglement and can beat previous approaches like semi-device-independent protocols for this problem easily in both precision and application range. We also observe an interesting phenomenon that on quantum states with stronger quantum nonlocality, the neural networks tend to have better performance, though we do not provide them any knowledge on quantum nonlocality.\n</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"22 9","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2023-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-023-04068-0.pdf","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11128-023-04068-0","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 1

Abstract

Quantum entanglement plays a crucial role in quantum information processing tasks and quantum mechanics; hence, quantifying unknown entanglement is a fundamental task. However, this is also challenging, as entanglement cannot be measured by any observables directly. In this paper, we train neural networks to quantify unknown entanglement, where the input features for neural networks are the outcome statistics data produced by measuring target quantum states with local or even single-qubit Pauli observables, and the training labels are well-chosen quantities. For bipartite quantum states, this quantity is coherent information, which is a lower bound for many popular entanglement measures, like the entanglement of distillation. For multipartite quantum states, we choose this quantity as the geometric measure of entanglement. It turns out that the neural networks we train have very good performance in quantifying unknown quantum entanglement and can beat previous approaches like semi-device-independent protocols for this problem easily in both precision and application range. We also observe an interesting phenomenon that on quantum states with stronger quantum nonlocality, the neural networks tend to have better performance, though we do not provide them any knowledge on quantum nonlocality.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用神经网络量化未知纠缠
量子纠缠在量子信息处理任务和量子力学中起着至关重要的作用;因此,量化未知纠缠是一项基本任务。然而,这也是具有挑战性的,因为纠缠不能通过任何可观测到的直接测量。在本文中,我们训练神经网络来量化未知纠缠,其中神经网络的输入特征是用局部甚至单量子比特泡利可观测量测量目标量子态产生的结果统计数据,训练标签是精心选择的量。对于二部量子态,这个量是相干信息,它是许多流行的纠缠度量的下界,如蒸馏纠缠。对于多部量子态,我们选择这个量作为纠缠的几何度量。事实证明,我们所训练的神经网络在量化未知量子纠缠方面具有很好的性能,并且在精度和应用范围上都可以轻松地击败以前的方法,如半设备无关协议。我们还观察到一个有趣的现象,即在量子非局域性较强的量子态上,神经网络往往有更好的性能,尽管我们没有提供任何量子非局域性的知识。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Quantum Information Processing
Quantum Information Processing 物理-物理:数学物理
CiteScore
4.10
自引率
20.00%
发文量
337
审稿时长
4.5 months
期刊介绍: Quantum Information Processing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Information Science. Topics of interest include quantum cryptography and communications, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, quantum computer science, quantum imaging and sensing, and experimental platforms for quantum information. Quantum Information Processing supports and inspires research by providing a comprehensive peer review process, and broadcasting high quality results in a range of formats. These include original papers, letters, broadly focused perspectives, comprehensive review articles, book reviews, and special topical issues. The journal is particularly interested in papers detailing and demonstrating quantum information protocols for cryptography, communications, computation, and sensing.
期刊最新文献
Fast generation of GHZ state by designing the evolution operators with Rydberg superatom Quantum conference key agreement with phase noise resistance A privacy-preserving quantum authentication for vehicular communication Layered quantum secret sharing scheme for private data in cloud environment system Performance analysis and modeling for quantum computing simulation on distributed GPU platforms
×
引用
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