首页> 外文期刊>Cryptography >Quantum Bounds on Detector Efficiencies for Violating Bell Inequalities Using Semidefinite Programming
【24h】

Quantum Bounds on Detector Efficiencies for Violating Bell Inequalities Using Semidefinite Programming

机译:使用SEMIDEFINITE编程违反贝尔不等式的探测器效率的量子界

获取原文
           

摘要

Loophole-free violations of Bell inequalities are crucial for fundamental tests of quantum nonlocality. They are also important for future applications in quantum information processing, such as device-independent quantum key distribution. Based on a detector model which includes detector inefficiencies and dark counts, we estimate the minimal requirements on detectors needed for performing loophole-free bipartite and tripartite Bell tests. Our numerical investigation is based on a hierarchy of semidefinite programs for characterizing possible quantum correlations. We find that for bipartite setups with two measurement choices and our detector model, the optimal inequality for a Bell test is equivalent to the Clauser–Horne inequality.
机译:无漏洞违规对贝尔不等式的行为至关重要,对量子非划分的基本测试至关重要。它们对于量子信息处理中的未来应用也很重要,例如独立于设备无关量子密钥分布。基于包括检测器效率低下和黑暗计数的探测器模型,我们估计了对无漏洞的双链和三方钟测试所需的探测器的最小要求。我们的数值调查基于SemideFinite程序的层次结构,用于表征可能的量子相关性。我们发现,对于具有两种测量选择和探测器模型的二角形设置,钟测试的最佳不等式相当于克劳斯和Ndash; Horne不平等。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号