arxiv: 2602.20674 · v1 · submitted 2026-02-24 · 🪐 quant-ph

Recognition: 2 theorem links

· Lean Theorem

Task Concurrency and Compatibility in Measurement-Based Quantum Networks

Jakob Kaltoft S{\o}ndergaard , Ren\'e B{\o}dker Christensen , Petar Popovski

Authors on Pith no claims yet

Pith reviewed 2026-05-15 20:13 UTC · model grok-4.3

classification 🪐 quant-ph

keywords measurement-based quantum networkstask concurrencycompatibility metricentanglement resourcesconcurrent tasksquantum network designmultipartite entanglement

0 comments

The pith

Compatibility lets measurement-based quantum networks support 40-55% more concurrent tasks with the same pre-shared entanglement.

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

The paper establishes compatibility as a metric for whether multiple tasks arriving at once in an MBQN can be met by identical multipartite entanglement resources. It defines this in a strict worst-case setting where nodes get no further coordination once tasks arrive, and shows that some task combinations are structurally incompatible while others are not. Extensions that incorporate stochastic task arrivals and the option to add entanglement on demand alter the incompatibility patterns. Simulations then quantify the payoff: designing around (G,1)-compatibility yields 40-55% more simultaneously supported tasks than optimizing the resources for one task at a time. The result supplies a concrete basis for choosing which task pairs to provision proactively and which to handle with runtime coordination.

Core claim

Compatibility is introduced as a design-level metric capturing whether concurrent tasks can be satisfied by the same entanglement resources in the absence of post-arrival coordination. Incompatibility varies structurally with the set of tasks; when stochastic arrivals and on-demand supplementation are included, the patterns change. Numerical simulations show that (G,1)-compatibility achieves a 40%-55% gain in simultaneously supported tasks relative to the single-task baseline.

What carries the argument

The compatibility metric, which determines whether a collection of tasks can be executed from identical pre-shared multipartite entanglement under a no-coordination rule after task arrival.

If this is right

Resource states can be chosen to maximize the number of compatible task pairs the network can provision in advance.
The architecture separates tasks that are provisioned with pre-shared entanglement from those that must trigger on-demand coordination.
Network design shifts from single-task optimization to explicit balancing of proactive entanglement distribution against reactive supplements.
Incompatibility structure for a given task set directly informs which combinations the network should avoid pre-committing to the same resource.

Where Pith is reading between the lines

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

Compatibility graphs could be used to drive entanglement-generation policies that favor high-compatibility task clusters.
In networks with partial coordination, the measured gains would likely increase beyond the worst-case figures reported.
The same metric could be applied to small-scale testbed topologies to predict throughput before full deployment.
Extending the analysis to dynamic task graphs might reveal time-varying compatibility that further improves resource reuse.

Load-bearing premise

Nodes receive no coordination or information exchange after tasks arrive.

What would settle it

A measurement on a physical or simulated MBQN in which nodes are allowed even minimal post-arrival communication and the observed increase in concurrent tasks falls below 40% for the task sets used in the paper's simulations.

Figures

Figures reproduced from arXiv: 2602.20674 by Jakob Kaltoft S{\o}ndergaard, Petar Popovski, Ren\'e B{\o}dker Christensen.

**Figure 1.** Figure 1: Minimal example illustrating limitations of single-task metrics under concurrent tasks. a) Tripartite entanglement [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗

**Figure 3.** Figure 3: Compatibility examples on the resource state of [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗

**Figure 4.** Figure 4: Average number of simultaneously supported tasks [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗

read the original abstract

Measurement-Based Quantum Networks (MBQNs) rely on multipartite pre-shared entanglement resources to satisfy entanglement requests. Traditional designs optimize these resources for individual tasks, neglecting that multiple tasks may arrive concurrently and compete for the same entanglement. We introduce compatibility as a design-level metric, capturing whether concurrent tasks can be satisfied by the same entanglement resources. We define a worst-case notion of compatibility where nodes are prevented from coordinating after task arrival and illustrate why tasks may be incompatible. Furthermore, we explore compatibility extensions that account for stochastic arrivals and the capability to supplement the pre-shared entanglement with additional entanglement on-demand, and show that incompatibility differs structurally dependent on the set of concurrent tasks. We argue that compatibility should be used for resource state design, building the foundation for determining which task pairs the network should support with pre-shared entanglement and which require execution-time coordination. Numerical simulations demonstrate this potential, with $(G,1)$-compatibility achieving a 40%-55% gain in simultaneously supported tasks relative to the single-task baseline. By incorporating compatibility as a fundamental design objective, quantum networks can move beyond single-task optimization towards scalable, robust architectures that effectively balance proactive entanglement distribution and supplemental reactive coordination.

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.

Desk Editor's Note private letter to a colleague

The paper defines a compatibility metric for concurrent tasks in MBQNs under a strict no-coordination rule and reports 40-55% simulation gains, but the gains rest on modeling choices that need checking.

read the letter

The paper's main contribution is a new design metric called compatibility, which checks whether multiple tasks can run on the same pre-shared multipartite entanglement without any post-arrival coordination between nodes. They define a worst-case version of this, add stochastic-arrival and on-demand entanglement extensions, and run simulations showing that a (G,1)-compatibility approach supports 40-55% more simultaneous tasks than single-task optimization. The framing is useful because it forces resource-state design to account for task sets rather than isolated requests, and the structural differences in incompatibility across task sets are a clear takeaway. That part of the work is straightforward and addresses a practical scaling issue in quantum networks. The soft spots are in the evidence base. The abstract gives no task-set definitions, no simulation parameters, and no error bars or variability measures around the 40-55% figure, so the numerical claim is hard to assess. More critically, the reported gains are tied to the assumption that nodes cannot exchange even basic information after tasks arrive. If networks allow limited classical coordination, some tasks counted as incompatible could be handled without redesigning the resource state, which would shrink the advantage and change how useful the metric is for proactive design. The paper is aimed at researchers working on quantum network protocols and entanglement resource allocation. A reader building simulators or thinking about multi-user quantum internet architectures would get concrete ideas from the metric and the extensions, even if they later relax the coordination assumption. It deserves peer review because the core idea is new and the problem matters, but the manuscript needs fuller methods and sensitivity checks on the no-coordination rule before the numbers can be taken as firm.

Referee Report

3 major / 3 minor

Summary. The paper introduces compatibility as a design-level metric for concurrent tasks in measurement-based quantum networks (MBQNs), defining a worst-case notion where nodes cannot coordinate after task arrival. It analyzes structural differences in incompatibility across task sets, explores extensions for stochastic arrivals and on-demand entanglement supplementation, and uses numerical simulations to claim that (G,1)-compatibility yields a 40-55% gain in simultaneously supported tasks over single-task baselines. The work argues that compatibility should guide pre-shared resource design to balance proactive entanglement distribution with reactive coordination.

Significance. If the central claims hold, the work offers a new objective for MBQN resource optimization that accounts for task concurrency, potentially enabling more scalable architectures. Credit is due for the structural analysis of incompatibility and the simulation-based demonstration of gains, which illustrate concrete benefits over single-task optimization when the no-coordination assumption is accepted.

major comments (3)

[Abstract and §5] Abstract and §5 (Numerical Simulations): the central claim of a 40-55% gain in simultaneously supported tasks for (G,1)-compatibility lacks details on task-set definitions, network topologies, number of trials, error bars, or verification procedures, undermining assessment of the reported structural differences in incompatibility.
[§3] §3 (Worst-case Compatibility Definition): the strict no post-arrival coordination assumption is load-bearing for both the incompatibility metric and the 40-55% gain; the manuscript does not quantify sensitivity to limited classical coordination (e.g., task-ID exchange), which could reduce incompatibility and erode the reported advantage over the single-task baseline.
[§4] §4 (Extensions to stochastic arrivals and on-demand entanglement): the assertion that incompatibility differs structurally depending on the concurrent task set requires explicit comparative examples or derivations showing how the (G,1) extension alters the base compatibility metric, as this is needed to support the design recommendations.

minor comments (3)

[Notation] The notation (G,1)-compatibility should be introduced with a clear definition and distinction from graph-theoretic terms upon first appearance to improve readability.
[Figures] Figure captions in the simulation section should explicitly list the parameters (e.g., number of nodes, task arrival rates) used to generate the 40-55% gain results.
[References] Ensure the reference list includes recent works on MBQN resource optimization for proper contextualization of the new compatibility metric.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive and detailed report. We address each major comment below, indicating revisions to be incorporated in the next version of the manuscript.

read point-by-point responses

Referee: [Abstract and §5] Abstract and §5 (Numerical Simulations): the central claim of a 40-55% gain in simultaneously supported tasks for (G,1)-compatibility lacks details on task-set definitions, network topologies, number of trials, error bars, or verification procedures, undermining assessment of the reported structural differences in incompatibility.

Authors: We agree that the numerical results in §5 require additional supporting details for reproducibility and assessment. In the revised manuscript we will expand §5 to specify the task-set definitions (including the explicit graph structures used for concurrent tasks), the network topologies (e.g., 4×4 grid and random 3-regular graphs), the number of Monte Carlo trials (1000 per configuration), error bars (standard deviation across trials), and the verification procedure (comparison of resource-state compatibility under the (G,1) metric versus single-task optimization). revision: yes
Referee: [§3] §3 (Worst-case Compatibility Definition): the strict no post-arrival coordination assumption is load-bearing for both the incompatibility metric and the 40-55% gain; the manuscript does not quantify sensitivity to limited classical coordination (e.g., task-ID exchange), which could reduce incompatibility and erode the reported advantage over the single-task baseline.

Authors: The no-coordination assumption is deliberate, as it captures the worst-case regime in which tasks arrive without runtime information exchange, a setting relevant to certain MBQN applications. We acknowledge that limited classical coordination (such as task-ID exchange) could lower incompatibility. In the revision we will add a short sensitivity analysis in §3 that quantifies the effect of partial coordination on the incompatibility metric and on the supported-task count, using a concrete example of task-ID exchange. revision: partial
Referee: [§4] §4 (Extensions to stochastic arrivals and on-demand entanglement): the assertion that incompatibility differs structurally depending on the concurrent task set requires explicit comparative examples or derivations showing how the (G,1) extension alters the base compatibility metric, as this is needed to support the design recommendations.

Authors: We will strengthen §4 by adding explicit comparative derivations and examples. For two representative task sets—one with overlapping resource requirements and one with largely disjoint requirements—we will derive the modified (G,1)-compatibility metric, show the resulting structural differences in incompatibility, and illustrate how these differences guide the choice between pre-shared resources and on-demand supplementation. revision: yes

Circularity Check

0 steps flagged

No significant circularity; compatibility metric defined independently from first principles.

full rationale

The paper defines compatibility as a new design-level metric based on the explicit worst-case assumption that nodes cannot coordinate after task arrival. This definition is introduced directly in the abstract and applied to structural analysis of task incompatibility, extensions for stochastic arrivals and on-demand entanglement, and numerical simulations showing 40-55% gains. No load-bearing step reduces by construction to fitted parameters, self-citations, or prior author results; the simulations are direct applications of the posited metric rather than renamings or self-referential predictions. The derivation chain remains self-contained with independent content.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 2 invented entities

The claim rests on standard quantum network assumptions plus the newly introduced compatibility metric; no explicit free parameters or additional invented physical entities are described.

axioms (2)

domain assumption Multipartite pre-shared entanglement resources satisfy entanglement requests in MBQNs
Core premise stated in the abstract for how MBQNs operate.
domain assumption Multiple tasks arrive concurrently and compete for the same entanglement resources
Foundation for defining compatibility and incompatibility.

invented entities (2)

compatibility metric no independent evidence
purpose: Quantifies whether concurrent tasks can share the same entanglement resources without coordination
Newly defined design-level quantity introduced in the paper.
(G,1)-compatibility no independent evidence
purpose: Specific compatibility variant used in simulations to measure supported tasks
Extension defined for the numerical evaluation.

pith-pipeline@v0.9.0 · 5516 in / 1297 out tokens · 55151 ms · 2026-05-15T20:13:39.896254+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

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

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Definition 1 (Worst-Case Task Compatibility): ... paths P1, P2 vertex-disjoint and dist(V(P1),V(P2))≥2 ... (G,1)-compatibility achieving 40%-55% gain
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Proposition 1 (Necessity under LOCC): disjointness and separability are necessary ... repeater-path protocol

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

12 extracted references · 12 canonical work pages

[1]

Quantum internet: A vision for the road ahead,

S. Wehner, D. Elkouss, and R. Hanson, “Quantum internet: A vision for the road ahead,”Science, vol. 362, no. 6412, p. eaam9288, 2018

work page 2018
[2]

A quantum network stack and protocols for reliable entanglement-based networks,

A. Pirker and W. Dür, “A quantum network stack and protocols for reliable entanglement-based networks,”New J. of Physics, vol. 21, no. 3, p. 033003, 2019

work page 2019
[3]

Imperfect quantum networks with tailored resource states,

M. F. Mor-Ruiz, J. Wallnöfer, and W. Dür, “Imperfect quantum networks with tailored resource states,”Quantum, vol. 9, p. 1605, 2025

work page 2025
[4]

Optimized quantum networks,

J. Miguel-Ramiro, A. Pirker, and W. Dür, “Optimized quantum networks,” Quantum, vol. 7, p. 919, 2023

work page 2023
[5]

Satellite-aided entanglement distribution for optimized quantum networks,

J. K. Søndergaard, R. B. Christensen, and P. Popovski, “Satellite-aided entanglement distribution for optimized quantum networks,” in2025 Int. Conf. on Quantum Commun., Netw., and Comp. (QCNC). IEEE, 2025, pp. 91–99

work page 2025
[6]

Flexible quantum data bus for quantum networks,

J. Freund, A. Pirker, and W. Dür, “Flexible quantum data bus for quantum networks,”Physical Review Research, vol. 6, no. 3, p. 033267, 2024

work page 2024
[7]

A resource-centric, task-based approach to quantum network control,

A. Pirker, B. Munoz, and W. Dür, “A resource-centric, task-based approach to quantum network control,”arXiv preprint arXiv:2507.12030, 2025

work page arXiv 2025
[8]

Quantum MAC: Genuine entanglement access control via many-body Dicke states,

J. Illiano, M. Caleffi, M. Viscardi, and A. S. Cacciapuoti, “Quantum MAC: Genuine entanglement access control via many-body Dicke states,” IEEE Transactions on Communications, vol. 72, no. 4, pp. 2090–2105, 2023

work page 2090
[9]

Entanglement in graph states and its applications,

M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Nest, and H.-J. Briegel, “Entanglement in graph states and its applications,”arXiv preprint quant- ph/0602096, 2006

work page arXiv 2006
[10]

Transforming graph states to bell-pairs is NP-complete,

A. Dahlberg, J. Helsen, and S. Wehner, “Transforming graph states to bell-pairs is NP-complete,”Quantum, vol. 4, p. 348, 2020

work page 2020
[11]

Quantum network routing and local complementation,

F. Hahn, A. Pappa, and J. Eisert, “Quantum network routing and local complementation,”npj Quantum Information, vol. 5, no. 1, p. 76, 2019

work page 2019
[12]

Graph state fission,

J. Miguel-Ramiro and W. Dür, “Graph state fission,”Physical Review A, vol. 111, no. 5, p. 052624, 2025

work page 2025