Entanglement Verification in Quantum Networks with Tampered Nodes

Abstract

In this paper, we consider the problem of entanglement verification across the quantum memories of any two nodes of a quantum network. Its solution can be a means for detecting (albeit not preventing) the presence of intruders that have taken full control of a node, either to make a denial-of-service attack or to reprogram the node. Looking for strategies that only require local operations and classical communication (LOCC), we propose two entanglement verification protocols characterized by increasing robustness and efficiency.

14 pages, 7 figures

References in corpus (10)

• A Survey on Quantum Channel Capacities
• SimulaQron - A simulator for developing quantum internet software
• On experimental procedures for entanglement verification
• Decentralized Base-Graph Routing for the Quantum Internet
• Opportunistic Entanglement Distribution for the Quantum Internet
• Entanglement Availability Differentiation Service for the Quantum Internet
• Quantum Proofs
• Entanglement verification with finite data
• Multilayer Optimization for the Quantum Internet
• A Poisson Model for Entanglement Optimization in the Quantum Internet

Cited by in corpus (3)

• Distributed Quantum Computing: a Survey
• Tools for quantum network design
• A Modular Quantum Compilation Framework for Distributed Quantum Computing