pith. sign in

arxiv: 2502.00446 · v3 · submitted 2025-02-01 · 🪐 quant-ph

Identifying vulnerable nodes and detecting malicious entanglement patterns to handle st-connectivity attacks in quantum networks

Iain Burge , Michel Barbeau , Joaquin Garcia-Alfaro This is my paper

Pith reviewed 2026-05-23 03:38 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum networksst-connectivityShapley valuesQSVMentanglement swappingnode centralitymalicious attacksquantum security
0
0 comments X

The pith

A quantum method uses st-connectivity subroutines and Shapley approximation to find high-importance nodes in quantum networks and QSVM to detect entanglement attacks.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a quantum computing approach to approximate the importance of nodes that maintain s-t connectivity in quantum networks. It relies on subroutines for st-connectivity problems, Shapley value approximation, and maximum finding to identify nodes that adversaries could target. This identification is paired with QSVM classifiers that detect malicious entanglement swapping in repeaters and flag anomalous behavior. A reader would care because the method offers a route to prioritize protection of key nodes and respond to attacks in quantum communication systems, with explored complexity advantages over classical approaches.

Core claim

The authors describe a quantum approach that uses subroutines for st-connectivity, approximating Shapley values, and finding the maximum of a list to quickly identify high-importance nodes that maintain s-t connectivity in a quantum network. QSVM classifiers detect malicious entanglement swapping in repeaters and report anomalous situations from malicious manipulation of entanglement swapping. The method is positioned as a way to handle st-connectivity attacks by first locating vulnerable nodes and then monitoring them.

What carries the argument

Quantum subroutines for st-connectivity and Shapley value approximation, combined with QSVM classifiers for entanglement attack detection.

If this is right

  • High-importance nodes maintaining s-t connectivity can be identified rapidly for targeted monitoring or protection against adversaries.
  • QSVM classifiers can complement the node identification by detecting and reporting anomalous entanglement swapping behavior in repeaters.
  • The overall quantum approach may provide complexity benefits relative to classical and probabilistic methods for the same tasks.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The node identification step could be integrated into dynamic rerouting protocols that respond automatically when high-centrality nodes show anomalies.
  • If the subroutines scale, similar quantum centrality approximations might apply to other security problems such as identifying cut vertices in quantum graphs.
  • Real-device tests would need to account for how decoherence affects the accuracy of the Shapley approximations before deployment.

Load-bearing premise

The quantum subroutines for st-connectivity and Shapley-value approximation deliver sufficiently accurate and efficient results on the scale and noise levels of actual quantum networks.

What would settle it

Execute the described quantum subroutines on a simulator or device for a small known network graph, compute the approximated Shapley values for nodes, and check whether the highest-ranked nodes match the classically computed central nodes that preserve s-t connectivity within the stated approximation error.

Figures

Figures reproduced from arXiv: 2502.00446 by Iain Burge, Joaquin Garcia-Alfaro, Michel Barbeau.

Figure 1
Figure 1. Figure 1: Practical example (see our companion Github repository for further details). (a) Shapley Values for the intermediate nodes between s and t. (b) Coalitions of Nodes (in which coalitions of nodes are represented by binary string 1100000) [PITH_FULL_IMAGE:figures/full_fig_p011_1.png] view at source ↗
read the original 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 keeping nodes s and t connected. Once we have identified high-importance nodes, we require methods to identify when those nodes are compromised. We describe how Quantum Support Vector Machine (QSVM) classifiers can be used to detect malicious behavior in quantum networks. In particular, we describe the detection of entanglement attacks in quantum repeaters. We show that our initial assessment approach can be complemented by QSVM classifiers to identify and report anomalous situations related to malicious manipulation of entanglement swapping. Finally, we explore the potential complexity benefits of our quantum approach compared with classical and probabilistic methods. We also release all the simulation code in a companion GitHub repository.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes a quantum approach to approximate the importance of nodes maintaining s-t connectivity in quantum networks, relying on quantum subroutines for st-connectivity, Shapley-value approximation, and list-maximum finding to identify high-centrality nodes vulnerable to adversarial targeting. It further describes the use of QSVM classifiers to detect malicious entanglement-swapping attacks in repeaters and explores potential complexity advantages over classical methods, with all simulation code released in a companion repository.

Significance. If the quantum subroutines deliver the claimed efficiency and accuracy gains on hardware-scale networks, the work could provide a practical tool for securing quantum networks against targeted disruptions, complementing classical centrality measures with game-theoretic notions. The open release of simulation code is a clear strength for reproducibility and further development.

major comments (2)
  1. [Abstract / method description] Abstract and method description: the claim that the approach 'quickly identifies' high-importance nodes that maintain s-t connectivity rests on the unverified performance of the cited quantum subroutines (st-connectivity, Shapley approximation, max-finding) under realistic conditions. No circuit constructions, gate counts, depth analysis, or noise-resilience results are supplied, leaving the assumption that these subroutines work at the scale and error rates of actual quantum networks (tens of nodes, non-zero error) untested and load-bearing for the central claim.
  2. [QSVM detection section] The QSVM-based detection of entanglement attacks is presented at a high level without reported classification accuracies, feature choices, or comparison to classical SVM baselines on simulated or hardware data, which is required to substantiate the complementary detection step.
minor comments (2)
  1. Notation for the game-theoretic centrality (e.g., how the characteristic function is defined for the s-t connectivity game) should be introduced explicitly with an equation, even if the quantum approximation is the focus.
  2. The complexity comparison paragraph would benefit from a table summarizing asymptotic scaling for the quantum vs. classical/probabilistic methods.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive report. We address each major comment below and indicate the revisions made to the manuscript.

read point-by-point responses

  1. Referee: [Abstract / method description] Abstract and method description: the claim that the approach 'quickly identifies' high-importance nodes that maintain s-t connectivity rests on the unverified performance of the cited quantum subroutines (st-connectivity, Shapley approximation, max-finding) under realistic conditions. No circuit constructions, gate counts, depth analysis, or noise-resilience results are supplied, leaving the assumption that these subroutines work at the scale and error rates of actual quantum networks (tens of nodes, non-zero error) untested and load-bearing for the central claim.

    Authors: We agree the central claim relies on the cited subroutines without new circuit-level analysis in the manuscript. The work is a high-level algorithmic framework that invokes established quantum routines from the literature; the released simulation code emulates the end-to-end pipeline classically. In revision we have added an explicit 'Assumptions and Limitations' subsection that (i) cites the original papers supplying circuit constructions and complexity bounds for st-connectivity, Shapley approximation, and list-maximum finding, (ii) states the assumed noise model and network size, and (iii) qualifies the 'quickly identifies' phrasing to 'theoretically offers a complexity advantage assuming the cited subroutines achieve their reported performance.' Full hardware benchmarking remains outside the present scope. revision: partial

  2. Referee: [QSVM detection section] The QSVM-based detection of entanglement attacks is presented at a high level without reported classification accuracies, feature choices, or comparison to classical SVM baselines on simulated or hardware data, which is required to substantiate the complementary detection step.

    Authors: The QSVM section was intentionally concise to focus on the integration concept. The companion repository already contains the QSVM implementation and simulated repeater data. In the revised manuscript we have expanded the section to report (i) the chosen features (entanglement fidelity, swap success rate, and Bell-state measurement statistics), (ii) 5-fold cross-validation accuracies on the simulated attack dataset, and (iii) direct comparison against a classical RBF-SVM baseline using the same feature vectors. These numbers are extracted from the released code and added as a new table and paragraph. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The manuscript describes a high-level quantum approach composing existing subroutines (st-connectivity, Shapley-value approximation, max-finding, QSVM) to identify high-centrality nodes and detect entanglement attacks. No equations, fitted parameters, or self-citations are presented that would reduce any claimed prediction or result to the input by construction. The central claims rest on the independent performance of the cited subroutines rather than on any renaming, self-definition, or load-bearing self-reference within the paper itself. Simulation code is released externally, further separating the composition from any internal circular reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the unproven assumption that the cited quantum subroutines remain accurate when composed for this security task; no free parameters or invented entities are named in the abstract.

axioms (1)
  • domain assumption Quantum subroutines for st-connectivity and Shapley-value approximation can be composed to yield useful node-importance scores in quantum networks.
    Invoked in the description of the approximation method (abstract).

pith-pipeline@v0.9.0 · 5787 in / 1190 out tokens · 20016 ms · 2026-05-23T03:38:32.647863+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages · 3 internal anchors

  1. [1]

    A Quantum Algorithm for finding the Maximum

    Ashish Ahuja and Sanjiv Kapoor. A quantum algorithm for finding the maximum. https: //arxiv.org/abs/quant-ph/9911082, 1999

    work page internal anchor Pith review Pith/arXiv arXiv 1999

  2. [2]

    Cyber-physical defense in the quantum era

    Michel Barbeau and Joaquin Garcia-Alfaro. Cyber-physical defense in the quantum era. Scientific Reports, 12(1):1905, 2022

    work page 1905

  3. [3]

    Authenticity, integrity, and replay protection in quantum data communications and networking.ACM Transactions on Quantum Computing, 3(2):1–22, 2022

    Michel Barbeau, Evangelos Kranakis, and Nicolas Perez. Authenticity, integrity, and replay protection in quantum data communications and networking.ACM Transactions on Quantum Computing, 3(2):1–22, 2022

    work page 2022

  4. [4]

    Span programs and quantum algorithms for st- connectivity and claw detection

    Aleksandrs Belovs and Ben W Reichardt. Span programs and quantum algorithms for st- connectivity and claw detection. In European Symposium on Algorithms , pages 193–204. Springer, 2012

    work page 2012

  5. [5]

    Quantum algorithms for shapley value calculation

    Iain Burge, Michel Barbeau, and Joaquin Garcia-Alfaro. Quantum algorithms for shapley value calculation. In 2023 IEEE International Conference on Quantum Computing and En- gineering (QCE), volume 1, pages 1–9. IEEE, 2023

    work page 2023

  6. [6]

    A shapley value estimation speedup for efficient explainable quantum AI

    Iain Burge, Michel Barbeau, and Joaquin Garcia-Alfaro. A shapley value estimation speedup for efficient explainable quantum AI. arXiv preprint arXiv:2412.14639, 2024

    work page arXiv 2024

  7. [7]

    Time and Space Efficient Quantum Algorithms for Detecting Cycles and Testing Bipartiteness

    Chris Cade, Ashley Montanaro, and Aleksandrs Belovs. Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness. arXiv preprint arXiv:1610.00581, 2016

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  8. [8]

    Advancements in Quantum Com- puting and AI May Impact PQC Migration Timelines, 2024

    Robert Campbell, Whitfield Diffie, and Charles Robinson. Advancements in Quantum Com- puting and AI May Impact PQC Migration Timelines, 2024

    work page 2024

  9. [9]

    The evolution of quantum key distribution networks: On the road to the QInternet

    Yuan Cao, Yongli Zhao, Qin Wang, Jie Zhang, Soon Xin Ng, and Lajos Hanzo. The evolution of quantum key distribution networks: On the road to the QInternet. IEEE Communications Surveys & Tutorials, 24(2):839–894, 2022

    work page 2022

  10. [10]

    Polynomial calculation of the Shapley value based on sampling

    Javier Castro, Daniel G ´omez, and Juan Tejada. Polynomial calculation of the Shapley value based on sampling. Computers & Operations Research, 36(5):1726–1730, 2009

    work page 2009

  11. [11]

    An automated deductive verification framework for circuit-building quantum pro- grams

    Christophe Chareton, S ´ebastien Bardin, Franc ¸ois Bobot, Valentin Perrelle, and Benoˆıt Val- iron. An automated deductive verification framework for circuit-building quantum pro- grams. In Programming Languages and Systems: 30th European Symposium on Program- ming, ESOP 2021, pages 148–177. Springer, 2021

    work page 2021

  12. [12]

    Efficient computation of the shapley value for game-theoretic network centrality

    Tomasz P Michalak, Karthik V Aadithya, Piotr L Szczepanski, Balaraman Ravindran, and Nicholas R Jennings. Efficient computation of the shapley value for game-theoretic network centrality. Journal of Artificial Intelligence Research, 46:607–650, 2013

    work page 2013

  13. [13]

    Quantum speedup of monte carlo methods

    Ashley Montanaro. Quantum speedup of monte carlo methods. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 471(2181):20150301, 2015

    work page 2015

  14. [14]

    From Existing Quantum Key Distribution Systems towards Future Quantum Networks

    Ludovic Noirie. From Existing Quantum Key Distribution Systems towards Future Quantum Networks. In 13th International Conference on Communications, Circuits, and Systems (ICCCAS 2024), 2024

    work page 2024

  15. [15]

    A remark on stirling’s formula

    Herbert Robbins. A remark on stirling’s formula. The American mathematical monthly , 62(1):26–29, 1955

    work page 1955

  16. [16]

    Lloyd S. Shapley. A Value for N-Person Games. RAND Corporation, Santa Monica, CA, 1952

    work page 1952

  17. [17]

    Quantum speed-up of Markov chain based algorithms

    Mario Szegedy. Quantum speed-up of Markov chain based algorithms. In 45th Annual IEEE symposium on foundations of computer science, pages 32–41. IEEE, 2004

    work page 2004

  18. [18]

    Game-theoretic Network Centrality: A Review

    Mateusz K Tarkowski, Tomasz P Michalak, Talal Rahwan, and Michael Wooldridge. Game- theoretic network centrality: A review. arXiv preprint arXiv:1801.00218, 2017

    work page internal anchor Pith review Pith/arXiv arXiv 2017