Quantum Connectivity Measure (QCM)

• Quantum Connectivity Measure (QCM) is a family of metrics that assess effective quantum link quality by averaging connection strengths above a task threshold.
• Alternative paradigms use weighted algebraic connectivity, separator rank, and spectral diagnostics to capture quantum graph and network structure.
• Operational measures employ correlator tests and local probes to reveal functional entanglement connectivity and validate network integrity.

Searching arXiv for recent and foundational papers on “Quantum Connectivity Measure” and related formulations. Quantum Connectivity Measure (QCM) does not denote a single universally standardized quantity across the literature. Instead, it refers to a family of quantum connectivity constructs that quantify connectedness, effective link quality, or multipartite connectivity structure in distinct settings: quantum networks, quantum graphs, graph states, entanglement-percolation models, and entanglement classification. In the most explicit network-level usage, QCM is introduced as a measure of the average connection quality between pairs of network nodes, filtered by a task threshold (Mondal et al., 31 Mar 2026). In other lines of work, closely related quantities are defined through algebraic connectivity in quantum key distribution networks (Liu, 2020), through final-state entanglement multiplied by network integrity in entanglement percolation (Girolamo et al., 24 Feb 2025), through operator-algebraic connectedness and separator rank in quantum graphs (Chávez-Domínguez et al., 2019, Courtney et al., 28 May 2025), through correlator signatures in graph states (Vesperini et al., 2023), and through the connectivity order of entangled states and measurement devices (Dugowson, 2014). The term therefore designates a research theme rather than a single invariant, with each formulation tailored to the operational notion of connectivity relevant to the underlying model.

1. Network-level QCM as functional quantum connectivity

The clearest explicit definition of QCM appears in the theory of quantum networks, where classical path existence is distinguished from the ability to establish entanglement of sufficient quality to execute a target quantum information processing task (Mondal et al., 31 Mar 2026). In that framework, QCM for a node subset $\mathcal{N}\subseteq V$ is defined by

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$

Here $\mathcal{N}_P=|\mathcal{N}|(|\mathcal{N}|-1)/2$ is the number of node pairs, $\mathcal{S}_{ij}$ is the effective connection strength between nodes $i$ and $j$, $\Theta[\mathcal{S}_{ij}-\epsilon]$ is the Heaviside step function, and $\epsilon\in[0,1]$ is the task threshold. The supplementary presentation gives the same definition as

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}) = \frac{2}{|\mathcal{N}|(|\mathcal{N}|-1)} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}\,\Theta(\mathcal{S}_{ij}-\epsilon).$

The effective connection strength is protocol-dependent. For a pair $i,j$, if $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$0 denotes the optimal path and $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$1 the protocol map from edge parameters to end-to-end connection strength, then

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$2

For pure bipartite states with entanglement swapping, the map is multiplicative in concurrence: $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$3

This formulation makes QCM a measure of average effective entanglement connection strength, but only counting node pairs whose end-to-end connection exceeds the threshold required by the task (Mondal et al., 31 Mar 2026). It is therefore neither a purely topological observable nor merely a mean entanglement statistic. It combines path structure, edge-resource quality, and task feasibility in one quantity.

The same work introduces two naturally derived companions. The quantum-connected fraction (QCF) is

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$4

or equivalently in the supplementary normalization,

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$5

QCF counts the fraction of pairs above threshold, whereas QCM weights those pairs by their connection strength. The quantum clustering coefficient (QCC) is defined locally by applying QCM to the neighbor set $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$6: $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$7

The distinction from classical connectivity metrics is central. A network can be topologically connected yet functionally disconnected for quantum tasks if entanglement quality is too low. In the homogeneous fully connected case,

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$8

Thus even a complete graph can be functionally disconnected when average edge concurrence is below threshold (Mondal et al., 31 Mar 2026). This directly addresses a common misconception: topological completeness does not imply quantum-functional connectivity.

2. Alternative network metrics described as quantum connectivity measures

A different network-level construction appears in preliminary work on quantum key distribution networks, where a quantum-network connectivity measure is obtained by embedding quantum physical parameters into a weighted graph Laplacian and then using weighted algebraic connectivity (Liu, 2020). The core metric is

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$9

This is the weighted algebraic connectivity of a graph whose edge weights reflect channel capacity or link quality and whose vertices encode node properties through $\mathcal{N}_P=|\mathcal{N}|(|\mathcal{N}|-1)/2$0.

The physical layer is expressed through the quantities $\mathcal{N}_P=|\mathcal{N}|(|\mathcal{N}|-1)/2$1, $\mathcal{N}_P=|\mathcal{N}|(|\mathcal{N}|-1)/2$2, $\mathcal{N}_P=|\mathcal{N}|(|\mathcal{N}|-1)/2$3, $\mathcal{N}_P=|\mathcal{N}|(|\mathcal{N}|-1)/2$4, $\mathcal{N}_P=|\mathcal{N}|(|\mathcal{N}|-1)/2$5, $\mathcal{N}_P=|\mathcal{N}|(|\mathcal{N}|-1)/2$6, and $\mathcal{N}_P=|\mathcal{N}|(|\mathcal{N}|-1)/2$7. The paper defines

$\mathcal{N}_P=|\mathcal{N}|(|\mathcal{N}|-1)/2$8

with error model

$\mathcal{N}_P=|\mathcal{N}|(|\mathcal{N}|-1)/2$9

leading to

$\mathcal{S}_{ij}$0

The link-quality update is smoothed through

$\mathcal{S}_{ij}$1

with

$\mathcal{S}_{ij}$2

Here the connectivity metric indicates transmission throughput in a grid quantum network and is used to study how tuning physical parameters affects resilience under node or edge removal (Liu, 2020). The use of the Fiedler value places this QCM variant closer to weighted spectral graph theory than to end-to-end entanglement-quality averaging. A plausible implication is that the literature contains at least two distinct network-level QCM paradigms: thresholded pairwise connection-quality averaging (Mondal et al., 31 Mar 2026) and weighted algebraic connectivity derived from quantum-physical link models (Liu, 2020).

A third network quantity close to a QCM is introduced for entanglement percolation in qubit-based planar quantum networks (Girolamo et al., 24 Feb 2025). There, the key connectivity metric is

$\mathcal{S}_{ij}$3

where

$\mathcal{S}_{ij}$4

The distance is defined operationally by the minimum number of swapping operations: $\mathcal{S}_{ij}$5 This metric combines final-state entanglement and network integrity after the percolation process. It is explicitly used to classify percolation strategies and identify distinct regimes separated by threshold values of the initial Schmidt parameter $\mathcal{S}_{ij}$6 (Girolamo et al., 24 Feb 2025). Relative to the QCM of (Mondal et al., 31 Mar 2026), this quantity is pair-specific rather than network-averaged and incorporates resource destruction directly through $\mathcal{S}_{ij}$7.

3. Quantum graphs: connectivity witnesses, separator rank, and Laplacians

In quantum graph theory, QCM is not usually defined as a named scalar, but the literature provides several mathematically precise connectivity diagnostics that serve the same role (Chávez-Domínguez et al., 2019, Courtney et al., 28 May 2025). In the operator-system model, a quantum graph on $\mathcal{S}_{ij}$8 is a linear subspace $\mathcal{S}_{ij}$9 that is closed under adjoints and contains the identity: $i$0 Connectedness is defined by

$i$1

The central equivalent criterion is that $i$2 is disconnected if and only if there exists a nontrivial projection $i$3 such that

$i$4

This is the main connectivity witness in the operator-system setting (Chávez-Domínguez et al., 2019).

The same paper defines a separator: a projection $i$5 is a separator of $i$6 if $i$7 is either disconnected or $i$8-dimensional. A quantum graph is $i$9-connected if every separator has rank at least $j$0. For a classical graph $j$1 and its quantum graph $j$2,

$j$3

The paper explicitly identifies the minimum rank of a separator, or equivalently the largest $j$4 such that $j$5 is $j$6-connected, as the natural quantum analogue of classical vertex connectivity (Chávez-Domínguez et al., 2019). This suggests a QCM in the sense of a separator-rank invariant.

The quantum adjacency matrix framework extends these ideas to general quantum graphs and to the non-tracial setting (Courtney et al., 28 May 2025). There, a quantum graph is $j$7, with $j$8 a quantum Schur idempotent: $j$9 In the tracial setting, an undirected quantum graph is connected if the quantum adjacency matrix $\Theta[\mathcal{S}_{ij}-\epsilon]$0 does not commute with any non-trivial projection $\Theta[\mathcal{S}_{ij}-\epsilon]$1: $\Theta[\mathcal{S}_{ij}-\epsilon]$2 In the non-tracial setting, connectivity is reformulated using the KMS inner product and the KMS implementation $\Theta[\mathcal{S}_{ij}-\epsilon]$3, for example through the condition that no non-trivial projection $\Theta[\mathcal{S}_{ij}-\epsilon]$4 satisfies

$\Theta[\mathcal{S}_{ij}-\epsilon]$5

equivalently

$\Theta[\mathcal{S}_{ij}-\epsilon]$6

The same work establishes the equivalence

$\Theta[\mathcal{S}_{ij}-\epsilon]$7

and characterizes connectivity through the graph Laplacian $\Theta[\mathcal{S}_{ij}-\epsilon]$8: an undirected quantum graph is connected if and only if $\Theta[\mathcal{S}_{ij}-\epsilon]$9 is a simple eigenvalue of $\epsilon\in[0,1]$0 (Courtney et al., 28 May 2025). These results indicate several possible QCM-like choices: irreducibility, nullity of the Laplacian, or support growth of powers $\epsilon\in[0,1]$1. The literature therefore supports a structural rather than uniquely numerical interpretation of QCM in quantum graph theory.

4. State-based and correlator-based measures of connectivity

For graph states, connectivity can be probed operationally through Pauli correlators rather than through a global scalar (Vesperini et al., 2023). The state preparation is

$\epsilon\in[0,1]$2

with genuine graph states corresponding to $\epsilon\in[0,1]$3. The neighborhood notation is

$\epsilon\in[0,1]$4

The central result is that specific Pauli correlators are nonzero only when the graph has specific connectivity relations. Exact formulas include

$\epsilon\in[0,1]$5

so the $\epsilon\in[0,1]$6 correlator detects twin vertices;

$\epsilon\in[0,1]$7

so the $\epsilon\in[0,1]$8 correlator detects a leaf vertex; and

$\epsilon\in[0,1]$9

so the $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}) = \frac{2}{|\mathcal{N}|(|\mathcal{N}|-1)} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}\,\Theta(\mathcal{S}_{ij}-\epsilon).$0 correlator detects adjacent twins (Vesperini et al., 2023).

The same work gives a direct adjacency test after measuring all other qubits in the $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}) = \frac{2}{|\mathcal{N}|(|\mathcal{N}|-1)} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}\,\Theta(\mathcal{S}_{ij}-\epsilon).$1-basis: $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}) = \frac{2}{|\mathcal{N}|(|\mathcal{N}|-1)} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}\,\Theta(\mathcal{S}_{ij}-\epsilon).$2 This is an operational connectivity witness rather than an aggregate scalar. The paper emphasizes that for genuine graph states these correlators take only the values

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}) = \frac{2}{|\mathcal{N}|(|\mathcal{N}|-1)} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}\,\Theta(\mathcal{S}_{ij}-\epsilon).$3

which simplifies data analysis (Vesperini et al., 2023).

A different state-based classification appears in the theory of connectivity structures of quantum entanglement, where the “connectivity order” $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}) = \frac{2}{|\mathcal{N}|(|\mathcal{N}|-1)} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}\,\Theta(\mathcal{S}_{ij}-\epsilon).$4 of a quantum state or a measurement device plays the role of a QCM (Dugowson, 2014). For a finite set of subsystem indices

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}) = \frac{2}{|\mathcal{N}|(|\mathcal{N}|-1)} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}\,\Theta(\mathcal{S}_{ij}-\epsilon).$5

and a pure state

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}) = \frac{2}{|\mathcal{N}|(|\mathcal{N}|-1)} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}\,\Theta(\mathcal{S}_{ij}-\epsilon).$6

the paper constructs connectivity structures from the behavior of the state under determining measurements on complementary subsystems. Several families of subsets are introduced, including

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}) = \frac{2}{|\mathcal{N}|(|\mathcal{N}|-1)} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}\,\Theta(\mathcal{S}_{ij}-\epsilon).$7

with corresponding generated integral connectivity structures

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}) = \frac{2}{|\mathcal{N}|(|\mathcal{N}|-1)} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}\,\Theta(\mathcal{S}_{ij}-\epsilon).$8

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}) = \frac{2}{|\mathcal{N}|(|\mathcal{N}|-1)} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}\,\Theta(\mathcal{S}_{ij}-\epsilon).$9

$i,j$0

The connectivity order $i,j$1 is the height of the acyclic directed graph formed by irreducible connected subsets ordered by inclusion, and the overall connectivity order of a pure state is

$i,j$2

This yields, for example,

$i,j$3

for the specific states discussed in the paper (Dugowson, 2014). In this setting QCM classifies entanglement by hierarchical connectivity complexity rather than by link quality or operator irreducibility.

5. Algorithmic and spectroscopic procedures that implicitly support a QCM

Some papers do not define a scalar called QCM but supply measurement protocols whose outputs encode connectivity and could serve as its operational basis. One example is a constant-measurement quantum algorithm for graph connectedness (Mansky et al., 2024). There, the input undirected graph $i,j$4 is mapped to qubits and non-unitary two-qubit $i,j$5 spiders from ZX calculus. Starting from $i,j$6, the algorithm prepares a post-encoding state of the form

$i,j$7

where each factor corresponds to one connected component. Connectivity is thereby represented by the presence or absence of GHZ-like entanglement across qubits.

The algorithm uses the fusion rule of ZX calculus so that all spiders belonging to the same connected component contract into a single larger spider. Two measurements are sufficient to distinguish the connected case from the disconnected case with success probability

$i,j$8

For a disconnected graph with $i,j$9 components, the probability of failure after $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$00 measurements is

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$01

and for a connected graph,

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$02

The paper does not define a scalar QCM, but it explicitly identifies connectivity-related observables such as whether all qubits yield the same bitstring under repeated measurement, the XOR discrepancy

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$03

and the success/failure probabilities as functions of component number $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$04 and measurement count $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$05 (Mansky et al., 2024). This suggests a measurement-based QCM grounded in multipartite GHZ structure.

Another example is a local probe for connectivity in quantum complex networks (Nokkala et al., 2017). The network is a system of identical quantum harmonic oscillators with Hamiltonian

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$06

where $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$07 is the graph Laplacian. A local oscillator probe

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$08

is coupled to one node $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$09 through

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$10

By sweeping $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$11 and monitoring the probe’s mean excitation number

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$12

one detects resonances with network normal-mode frequencies $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$13, which satisfy

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$14

The Laplacian spectrum then constrains the degree sequence through

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$15

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$16

and

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$17

The output is a reconstructed degree sequence rather than a single QCM scalar, but the paper explicitly frames the protocol as a quantum-enabled connectivity metric because local dynamical measurements are converted into a global connectivity descriptor (Nokkala et al., 2017).

6. Scope, misconceptions, and cross-field distinctions

A recurring misconception is that QCM denotes one established measure with fixed notation and universal semantics. The literature instead supports several non-equivalent meanings. In network science, QCM usually quantifies functional entanglement connectivity relative to a task threshold (Mondal et al., 31 Mar 2026), or weighted algebraic connectivity when quantum-physical link parameters are embedded into a Laplacian (Liu, 2020). In entanglement percolation, the closest analogue is a pairwise quantity $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$18 combining final entanglement and integrity (Girolamo et al., 24 Feb 2025). In quantum graph theory, connectivity is characterized by projection obstructions, irreducibility, and Laplacian nullity rather than by a single named formula (Chávez-Domínguez et al., 2019, Courtney et al., 28 May 2025). In graph states, connectivity is witnessed by exact correlator identities (Vesperini et al., 2023). In multipartite entanglement classification, the relevant invariant is the connectivity order $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$19 (Dugowson, 2014).

A second misconception is that quantum connectivity should reduce to ordinary graph connectivity. The network literature directly rejects this equivalence: a graph can be topologically connected but functionally disconnected for quantum tasks if end-to-end entanglement is below threshold (Mondal et al., 31 Mar 2026). The graph-state literature likewise shows that connectivity information can be encoded in correlators that detect twins, adjacent twins, or leaf structure, which are finer notions than component membership (Vesperini et al., 2023). The quantum-graph literature replaces classical vertex partitions by nontrivial projections and block-vanishing conditions such as

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$20

or

$\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$21

showing that the quantum generalization of connectivity is intrinsically operator-algebraic (Chávez-Domínguez et al., 2019, Courtney et al., 28 May 2025).

A third misconception is that any QCM is necessarily a scalar monotone. Several formulations are not scalar at all. Some are families of observables, some are generated connectivity structures, and some are decision procedures. This suggests that “Quantum Connectivity Measure” is best understood as an umbrella label for operational or structural formalisms that quantify how quantum subsystems, nodes, or operator blocks are connected under the physically relevant notion of connectivity for the model at hand.

7. Significance and methodological outlook

Across the surveyed work, QCM-like constructs serve three distinct but related purposes. First, they support network design, optimization, and benchmarking by quantifying which node pairs are quantum-functionally connected and with what average quality (Mondal et al., 31 Mar 2026), or by identifying how physical-layer parameter tuning affects weighted resilience (Liu, 2020). Second, they furnish algebraic and spectral invariants for generalized graph structures, including separator-based $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$22-connectedness, irreducibility of quantum adjacency matrices, and simple zero modes of quantum graph Laplacians (Chávez-Domínguez et al., 2019, Courtney et al., 28 May 2025). Third, they provide experimentally meaningful connectivity witnesses via correlators, local probes, or repeated measurement structure (Vesperini et al., 2023, Nokkala et al., 2017, Mansky et al., 2024).

The network-level framework of (Mondal et al., 31 Mar 2026) is notable for being explicitly multiscale: QCM applies to the whole network or to a subset $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$23, QCF captures prevalence of usable connections, and QCC quantifies functional interconnectivity among a node’s neighbors. The paper further notes that if the protocol map $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$24 is multiplicative, computing QCM reduces to a shortest-path problem on logarithmic weights, with all-pairs shortest-path complexity $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$25 and evaluation cost $\mathcal{Q}_\mathcal{N}(\{\mathcal{S}_{ij}\}_{i,j \in \mathcal{N}) := \frac{1}{\mathcal{N}_P} \sum_{i,j \in \mathcal{N} \mathcal{S}_{ij}~\Theta[\mathcal{S}_{ij}-\epsilon].$26 (Mondal et al., 31 Mar 2026). This makes the measure practically computable for large networks.

The broader literature indicates that future uses of the term QCM will likely continue to be model-specific. This suggests that rigorous usage should always specify the underlying object—network, quantum graph, graph state, percolation route, or entangled multipartite state—the operational notion of connectivity, and the exact diagnostic quantity. Without that qualification, “Quantum Connectivity Measure” remains ambiguous. With it, QCM provides a compact label for a growing family of mathematically distinct but conceptually aligned tools for quantifying quantum connectedness.