基于图态的稠密网络编码实现鲁棒纠缠见证
Robust Entanglement Witnessing via Dense Network Coding with Graph States
浏览论文内容
中文总结 AI 辅助
本文提出一种基于图态纠缠的稠密网络编码协议，用于在噪声环境中实现鲁棒纠缠见证，推导了经典网络的成功概率界限，并证明噪声鲁棒性随发送方数量指数增强，适用于半设备无关的图态可见度估计。
中文摘要 AI 辅助
在存在噪声的情况下，用于见证纠缠的实用测试对于验证和应用基于纠缠的通信网络应用是必需的。量子稠密网络编码是一种通信协议，它利用纠缠态制备结合量子通信，在具有多个发送方和一个接收方的网络中，将评估某些双射函数所需的通信量减半。在本工作中，我们考虑一种使用图态纠缠来实现仿射变换族的稠密网络编码协议，我们推导了经典网络所能达到的成功概率的界限，并表明噪声鲁棒性随发送方数量呈指数放大。我们将我们的结果应用于一个半设备无关协议中，用于稳健地估计图态和测量基的有效可见度。总体而言，我们的方法对噪声具有鲁棒性，可以支持未表征态制备或测量的使用，并且可以应用于任何图态。
英文摘要
Practical tests for witnessing entanglement in the presence of noise are needed to verify and apply entanglement-based applications in real-world communication networks. Quantum dense network coding is a communication protocol that uses an entangled state preparation together with quantum communication to halve the amount of communication needed to evaluate certain bijective functions in networks having multiple senders and one receiver. In this work, we consider a dense network coding protocol that uses graph state entanglement to implement a family of affine transformations, we derive a bound on the success probability that can be achieved by classical networks, and we show that the noise robustness exponentially amplifies with the number of senders. We apply our results in a semi-device-independent protocol for robustly estimating the effective visibility of graph states and measurement bases. Overall, our approaches are robust to noise, can support the usage of uncharacterized state preparations or measurements, and can be applied to any graph state.
发表机构
- Aliro Technologies, Inc.（Aliro科技有限公司）
- Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）
机构由 AI 辅助整理，请以论文原文为准。
