论文标题

在不信任网络中对图状态的验证

Verification of graph states in an untrusted network

论文作者

Unnikrishnan, Anupama, Markham, Damian

论文摘要

图状态是一类大的多部分纠缠量子状态,构成了量子计算,通信,误差校正,计量学等方案的基础。在这项工作中,我们考虑对不受信任源产生的图形验证,并在可能不诚实的政党网络之间共享。这对证明图表在各种分布式任务中的应用有影响。我们提出了一项方案,该方案对于大型有用的图状态(包括群集状态,GHz状态,周期图状态等)方面有效。对于一般图形状态,尽管图形状态的大小有成本的增加,但仍保持有关安全参数的效率。协议是实用的,仅需要图形状态的多个副本,本地测量和经典通信。

Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states generated by an untrusted source and shared between a network of possibly dishonest parties. This has implications in certifying the application of graph states for various distributed tasks. We present a protocol which is globally efficient for a large family of useful graph states, including cluster states, GHZ states, cycle graph states and more. For general graph states, efficiency with respect to the security parameter is maintained, though there is a cost increase with the size of the graph state. The protocols are practical, requiring only multiple copies of the graph state, local measurements and classical communication.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源