TL;DR
This paper presents a quantum method for identifying critical nodes and detecting malicious entanglement attacks in quantum networks, enhancing security and efficiency.
Contribution
It introduces a quantum approach for approximating node importance and detecting malicious behavior, including entanglement attacks, with potential complexity advantages.
Findings
Quantum approach efficiently identifies high-importance nodes.
QSVM classifiers detect malicious entanglement manipulation.
Simulation code is available on GitHub.
Abstract
Problems in distributed system security often map naturally to graphs. The concept of centrality assesses the importance of nodes in a graph. It is used in various applications. Cooperative game theory has also been used to create nuanced and flexible notions of node centrality. However, the approach is often computationally complex to implement classically. We describe a quantum approach to approximating the importance of quantum nodes that maintain a target connection in a quantum network. We detail a method for quickly identifying high-importance nodes that can be targeted by adversaries. The approximation method relies on quantum subroutines for st-connectivity, approximating Shapley values, and finding the maximum of a list. We consider a malicious actor targeting a subset of nodes to perturb the system functionality. Our method identifies the nodes that are most important in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
