Valid and efficient entanglement verification with finite copies of a quantum state

IF 6.6 1区 物理与天体物理 Q1 PHYSICS, APPLIED
Paweł Cieśliński, Jan Dziewior, Lukas Knips, Waldemar Kłobus, Jasmin Meinecke, Tomasz Paterek, Harald Weinfurter, Wiesław Laskowski
{"title":"Valid and efficient entanglement verification with finite copies of a quantum state","authors":"Paweł Cieśliński, Jan Dziewior, Lukas Knips, Waldemar Kłobus, Jasmin Meinecke, Tomasz Paterek, Harald Weinfurter, Wiesław Laskowski","doi":"10.1038/s41534-024-00810-3","DOIUrl":null,"url":null,"abstract":"<p>Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme’s validity via the probability that the signal comes from a separable state, offering a meaningful figure of merit for big datasets. Yet, with limited samples, avoiding experimental data misinterpretations requires considering not only the probabilities concerning separable states but also the probability that the signal came from an entangled state, i.e. the detection scheme’s efficiency. We demonstrate this explicitly and apply a general method to optimize both the validity and the efficiency in small data sets providing examples using at most 20 state copies. The method is based on an analytical model of finite statistics effects on correlation functions which takes into account both a Frequentist as well as a Bayesian approach and is applicable to arbitrary entanglement witnesses.</p>","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":null,"pages":null},"PeriodicalIF":6.6000,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"npj Quantum Information","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1038/s41534-024-00810-3","RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme’s validity via the probability that the signal comes from a separable state, offering a meaningful figure of merit for big datasets. Yet, with limited samples, avoiding experimental data misinterpretations requires considering not only the probabilities concerning separable states but also the probability that the signal came from an entangled state, i.e. the detection scheme’s efficiency. We demonstrate this explicitly and apply a general method to optimize both the validity and the efficiency in small data sets providing examples using at most 20 state copies. The method is based on an analytical model of finite statistics effects on correlation functions which takes into account both a Frequentist as well as a Bayesian approach and is applicable to arbitrary entanglement witnesses.

Abstract Image

利用量子态的有限副本进行有效且高效的纠缠验证
检测多方量子态的纠缠本质上是一个概率过程,通常只需几个测量样本。纠缠检测的置信度通过信号来自可分离态的概率来量化方案的有效性,为大数据集提供了一个有意义的优点数字。然而,在样本有限的情况下,要避免实验数据被误读,不仅要考虑可分离状态的概率,还要考虑信号来自纠缠状态的概率,即检测方案的效率。我们明确地证明了这一点,并应用一种通用方法来优化小型数据集的有效性和效率,提供了最多使用 20 个状态副本的示例。该方法基于有限统计对相关函数影响的分析模型,同时考虑了频数法和贝叶斯法,适用于任意纠缠见证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
npj Quantum Information
npj Quantum Information Computer Science-Computer Science (miscellaneous)
CiteScore
13.70
自引率
3.90%
发文量
130
审稿时长
29 weeks
期刊介绍: The scope of npj Quantum Information spans across all relevant disciplines, fields, approaches and levels and so considers outstanding work ranging from fundamental research to applications and technologies.
×
引用
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学术官方微信