Future quantum information networks will likely consist of quantum and
classical agents, who have the ability to communicate in a variety of ways with
trusted and untrusted parties and securely delegate computational tasks to
untrusted large-scale quantum computing servers. Multipartite quantum
entanglement is a fundamental resource for such a network and hence it is
imperative to study the possibility of verifying a multipartite entanglement
source in a way that is efficient and provides strong guarantees even in the
presence of multiple dishonest parties. In this work, we show how an agent of a
quantum network can perform a distributed verification of a multipartite
entangled source with minimal resources, which is, nevertheless, resistant
against any number of dishonest parties. Moreover, we provide a tight tradeoff
between the level of security and the distance between the state produced by
the source and the ideal maximally entangled state. Last, by adding the
resource of a trusted common random source, we can further provide security
guarantees for all honest parties in the quantum network simultaneously.Comment: The statement of Theorem 2 has been revised and a new proof is given.
Other results unchange
