Emergent Operational Entanglement Graphs and Sub-Quadratic Authentication Scaling in Realistic E91 Quantum Networks

Jos\'e Luis Rosales

arxiv: 2605.27434 · v1 · pith:2YKIXNLKnew · submitted 2026-05-22 · 🪐 quant-ph

Emergent Operational Entanglement Graphs and Sub-Quadratic Authentication Scaling in Realistic E91 Quantum Networks

Jos\'e Luis Rosales This is my paper

Pith reviewed 2026-06-30 16:03 UTC · model grok-4.3

classification 🪐 quant-ph

keywords E91 quantum key distributionentanglement swappingBell correlationsquantum networksauthentication scalingPauli transfer matrixoperational entanglement graphs

0 comments

The pith

Exponential decay of Bell correlations produces sparse entanglement graphs and Θ(N log N) authentication in E91 networks

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

This paper establishes that Bell correlations in realistic E91 quantum networks decay exponentially along entanglement swapping paths due to loss and decoherence. The result is finite operational correlation lengths that produce sparse rather than dense entanglement graphs. As a direct consequence, the number of CHSH-usable Bell pairs grows only linearly with the number of users, and authentication complexity follows Θ(N log N) scaling when sparse-mixing conditions hold. A reader would care because this challenges the common assumption that quantum networks must incur quadratic authentication costs, suggesting instead that physical constraints naturally limit the resources needed for large metropolitan deployments. The work also introduces an ancilla-assisted verification method suited to these infrastructures.

Core claim

Pauli transfer matrix transport shows that Bell correlations decay exponentially along entanglement-swapping paths, which generates finite operational correlation lengths and sparse operational entanglement graphs. In sparse metropolitan quantum networks the number of CHSH-usable Bell pairs therefore scales linearly with network size. Authentication complexity scales as Θ(N log N) under sparse-mixing assumptions. An ancilla-assisted distributed Bell-state verification framework is presented for realistic E91 quantum metropolitan infrastructures.

What carries the argument

Pauli transfer matrix (PTM) transport modeling the exponential decay of Bell correlations

Load-bearing premise

The network obeys sparse-mixing assumptions that allow the authentication scaling to follow from the linear growth of usable pairs.

What would settle it

Observation of quadratic or super-linear growth in the number of CHSH-usable Bell pairs or in authentication requirements as network size increases in a lossy, decohering E91 setup.

read the original abstract

Large-scale entanglement-based quantum key distribution (QKD) networks are commonly assumed to require authentication resources scaling quadratically with the number of users. We show that realistic quantum communication networks operating under loss, decoherence, and LOCC constraints exhibit fundamentally different scaling laws. Using Pauli transfer matrix (PTM) transport, we demonstrate that Bell correlations decay exponentially along entanglement-swapping paths, generating finite operational correlation lengths and sparse operational entanglement graphs. In sparse metropolitan quantum networks, the number of CHSH-usable Bell pairs consequently scales linearly with network size, while authentication complexity scales as \[ \Theta(N\log N), \] under sparse-mixing assumptions. We further present an ancilla-assisted distributed Bell-state verification framework for realistic E91 quantum metropolitan infrastructures. Our results suggest that scalable authentication in quantum communication networks emerges directly from the physics of entanglement transport.

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 Θ(N log N) scaling claim rests on sparse-mixing assumptions that the abstract does not derive from PTM transport or exponential decay.

read the letter

The paper's core point is that PTM transport makes Bell correlations decay exponentially along swapping paths in lossy E91 networks, which produces finite correlation lengths and therefore sparse operational graphs. From that it concludes the number of usable CHSH pairs grows only linearly with N and, under additional sparse-mixing assumptions, authentication cost drops to Θ(N log N). That is the new claim; the usual quadratic overhead is replaced by something milder once the physics of transport is taken seriously.

The exponential decay itself is standard, but the mapping to operational entanglement graphs and the concrete linear-pair count is a reasonable step that follows from the model. The ancilla-assisted verification framework is also a concrete addition for metropolitan settings.

The weak point is exactly where the stress-test note says: the Θ(N log N) result is conditioned on sparse-mixing assumptions whose functional form is not derived from the PTM equations, network topology, or measured loss parameters. Without that link, the sub-quadratic scaling is an extra modeling choice rather than a direct prediction. The abstract supplies no error analysis or validation that the mixing length stays independent of N.

This is for people who build or analyze entanglement-based metropolitan networks and need scaling estimates that respect realistic decoherence. A reader already working on PTM or graph models of quantum networks will get the most out of it. The paper deserves a serious referee to check whether the full text supplies the missing derivation for the mixing parameter or whether the claim stays conditional.

Referee Report

1 major / 0 minor

Summary. The manuscript claims that realistic E91 quantum metropolitan networks under loss, decoherence, and LOCC constraints exhibit exponential decay of Bell correlations along entanglement-swapping paths when analyzed via Pauli transfer matrix (PTM) transport. This produces finite operational correlation lengths and sparse operational entanglement graphs. Consequently, the number of CHSH-usable Bell pairs scales linearly with network size N, while authentication complexity scales as Θ(N log N) under sparse-mixing assumptions. The paper additionally presents an ancilla-assisted distributed Bell-state verification framework.

Significance. If the sparse-mixing assumptions can be derived from the PTM equations or network parameters rather than imposed externally, the result would indicate that authentication resources in entanglement-based QKD networks need not scale quadratically, offering a physics-based route to better scalability than the conventional assumption. The exponential-decay and linear-pair claims appear consistent with PTM transport under standard loss models, but the sub-quadratic authentication result is the novel element whose validity depends on the mixing parameter.

major comments (1)

[Abstract, final paragraph] Abstract, final paragraph: The Θ(N log N) authentication scaling is conditioned on 'sparse-mixing assumptions,' yet no derivation of the mixing parameter (or demonstration that it remains independent of N) is supplied from the PTM transport model, loss/decoherence rates, or network topology. Exponential decay alone yields the linear CHSH-pair count but does not entail the sub-quadratic authentication step without this additional, undemonstrated condition.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful review and constructive criticism. We respond to the major comment point-by-point below.

read point-by-point responses

Referee: [Abstract, final paragraph] Abstract, final paragraph: The Θ(N log N) authentication scaling is conditioned on 'sparse-mixing assumptions,' yet no derivation of the mixing parameter (or demonstration that it remains independent of N) is supplied from the PTM transport model, loss/decoherence rates, or network topology. Exponential decay alone yields the linear CHSH-pair count but does not entail the sub-quadratic authentication step without this additional, undemonstrated condition.

Authors: We agree with the referee that the manuscript does not provide an explicit derivation of the sparse-mixing parameter from the PTM transport model. The exponential decay of correlations is rigorously shown via PTM, leading to the linear scaling of usable pairs. The authentication scaling is presented under the additional assumption of sparse mixing, which is physically motivated by the finite correlation length in lossy networks but not derived in detail. In the revised manuscript, we will add a derivation showing how the mixing parameter arises from the PTM equations and remains independent of N for fixed physical parameters. revision: yes

Circularity Check

1 steps flagged

Θ(N log N) authentication scaling conditioned on undeclared sparse-mixing assumptions not derived from PTM transport

specific steps

other [Abstract]
"while authentication complexity scales as Θ(N log N), under sparse-mixing assumptions. ... Our results suggest that scalable authentication in quantum communication networks emerges directly from the physics of entanglement transport."

The Θ(N log N) scaling is presented as following from the PTM-derived exponential decay and sparse operational graphs, yet is explicitly conditioned on 'sparse-mixing assumptions' whose form is not derived from the PTM model or any other equations in the text. This makes the sub-quadratic result partly defined by the modeling assumption rather than predicted by the entanglement transport physics.

full rationale

The PTM transport derivation of exponential Bell correlation decay and resulting linear CHSH-pair scaling is self-contained and independent. However, the central sub-quadratic authentication claim is introduced only under 'sparse-mixing assumptions' whose functional form or value is not obtained from the PTM equations, network topology, or loss parameters. The abstract's assertion that scalable authentication 'emerges directly from the physics of entanglement transport' therefore incorporates an external modeling choice as part of the result, producing partial circularity in the overall scaling prediction.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 1 invented entities

The central claim rests on the domain assumption of exponential Bell-correlation decay and the ad-hoc sparse-mixing assumption; no free parameters are numerically fitted in the abstract, but the mixing condition functions as an invented modeling choice without independent evidence.

free parameters (1)

sparse-mixing parameter
The Θ(N log N) scaling is stated to hold only under this assumption; its value or functional form is not derived from first principles or external data in the abstract.

axioms (1)

domain assumption Bell correlations decay exponentially along entanglement-swapping paths under loss, decoherence, and LOCC constraints
Invoked to produce finite operational correlation lengths and sparse graphs.

invented entities (1)

operational entanglement graphs no independent evidence
purpose: To represent the sparse structure of CHSH-usable Bell pairs
New descriptive object introduced to explain the linear scaling of usable pairs.

pith-pipeline@v0.9.1-grok · 5676 in / 1519 out tokens · 70394 ms · 2026-06-30T16:03:57.936749+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

22 extracted references · 1 canonical work pages

[1]

the underlying physical network graph,
[2]

Hub Nacional de Excelencia en Comunicaciones Cuánticas

the operational Bell-connectivity graph. Definition 1(Operational Bell link).A Bell link be- tween nodesAandBis operational if the distributed state supports Bell correlations strong enough to enable E91-type authentication and QKD under realistic physi- cal constraints. Operational connectivity therefore depends not only on graph topology but also on: •c...
[3]

The quantum internet,

H. J. Kimble, “The quantum internet,” Nature453, 1023–1030 (2008)

2008
[4]

Quantum internet: A vision for the road ahead,

S. Wehneret al., “Quantum internet: A vision for the road ahead,” Science362, eaam9288 (2018)

2018
[5]

Quan- tum repeaters: From quantum networks to the quantum internet,

K. Azuma, A. Pirker, D. Markham, and W. Dür, “Quan- tum repeaters: From quantum networks to the quantum internet,” Reviews of Modern Physics95, 045006 (2023)

2023
[6]

MadQCI: a heterogeneous and scal- able SDN-QKD network deployed in production facili- ties,

V. Martínet al., “MadQCI: a heterogeneous and scal- able SDN-QKD network deployed in production facili- ties,” npj Quantum Inf.10, 80 (2024)

2024
[7]

Device-Independent Security of Quantum Cryptography against Collective Attacks,

A. Acínet al., “Device-Independent Security of Quantum Cryptography against Collective Attacks,” Phys. Rev. Lett.98, 230501 (2007)

2007
[8]

Practical challenges in quantum key distribution,

E. Diamanti, H.-K. Lo, B. Qi, and Z. Yuan, “Practical challenges in quantum key distribution,” npj Quantum Inf.2, 16025 (2016)

2016
[9]

Watrous,The Theory of Quantum Infor- mation(Cambridge University Press, Cam- bridge, 2018)

J. Watrous,The Theory of Quantum Infor- mation(Cambridge University Press, Cam- bridge, 2018). ISBN: 9781316848142, DOI: https://doi.org/10.1017/9781316848142 7

work page doi:10.1017/9781316848142 2018
[10]

Collective dynamics of ’small-world’ networks,

D. J. Watts and S. H. Strogatz, “Collective dynamics of ’small-world’ networks,” Nature393, 440–442 (1998)

1998
[11]

Entanglement percolation in quantum networks,

A. Acín, J. I. Cirac, and M. Lewenstein, “Entanglement percolation in quantum networks,” Nature Physics3, 256–259 (2007)

2007
[12]

Entanglement Percola- tion in Quantum Complex Networks,

M. Cuquet and J. Calsamiglia, “Entanglement Percola- tion in Quantum Complex Networks,” Phys. Rev. Lett. 103, 240503 (2009)

2009
[13]

Routing entanglement in the quantum internet,

M. Pantet al., “Routing entanglement in the quantum internet,” npj Quantum Information5, 25 (2019)

2019
[14]

Spectral gap and expo- nential decay of correlations,

M. B. Hastings and T. Koma, “Spectral gap and expo- nential decay of correlations,” Communications in Math- ematical Physics265, 781–804 (2006)

2006
[15]

Matrix prod- uct states, projected entangled pair states, and varia- tional renormalization group methods for quantum spin systems,

F. Verstraete, V. Murg, and J. I. Cirac, “Matrix prod- uct states, projected entangled pair states, and varia- tional renormalization group methods for quantum spin systems,” Adv. Phys.57, 143–224 (2008)

2008
[16]

Vio- lating Bell inequality by mixed spin-1 2 states: necessary and sufficient condition,

R. Horodecki, P. Horodecki, and M. Horodecki, “Vio- lating Bell inequality by mixed spin-1 2 states: necessary and sufficient condition,” Physics Letters A200, 340–344 (1995)

1995
[17]

Fundamental limits of repeaterless quantum communications,

S. Pirandolaet al., “Fundamental limits of repeaterless quantum communications,” Nature Communications8, 15043 (2017)

2017
[18]

Random numbers certified by Bell’s theorem,

S. Pironioet al., “Random numbers certified by Bell’s theorem,” Nature464, 1021–1024 (2010). Appendix A: Distributed SWAP-Based Bell-State Verification In this Appendix we derive the distributed ancilla- assistedSWAPverificationprotocolusedinthemaintext and establish the corresponding separability bound

2010
[19]

Ancillary qubits aA, a B are initialized in the computational state |0⟩aA ⊗ |0⟩aB

Protocol Definition Consider two remote nodes, Alice and Bob, sharing an unknown two-qubit state ρAB, together with a trusted Bell reference pair |Φ+⟩A′B′ = 1√ 2 (|00⟩+|11⟩). Ancillary qubits aA, a B are initialized in the computational state |0⟩aA ⊗ |0⟩aB . The global initial state is therefore ρ0 =|00⟩⟨00| aAaB ⊗ρ AB ⊗ |Φ+⟩⟨Φ+|A′B′.(A1) Hadamard gates a...
[20]

Joint Ancilla Probabilities Define σ=ρ AB ⊗ |Φ+⟩⟨Φ+|A′B′. After the controlled-SWAP operations and the second Hadamard layer, the joint ancilla measurement probabil- ities satisfy PmA,mB = 1 4 h 1 + (−1)mA ⟨SA⟩+ (−1) mB ⟨SB⟩+ (−1) mA+mB ⟨SASB⟩ i ,(A4) where expectation values are evaluated with respect toσ 1. 1 The joint ancilla probability distribution i...
[21]

(A4) yields PmA,mB = 1 4 h 1 + (−1)mA F+ (−1) mB F+ (−1) mA+mB i

Evaluation of the SWAP Expectation Values Define the Bell fidelity F=⟨Φ +|ρ AB |Φ+⟩.(A5) Using the SWAP identity SAA′(|i⟩A|k⟩A′) =|k⟩ A|i⟩A′, one obtains ⟨SA⟩= Tr[S Aσ] =F.(A6) By symmetry, ⟨SB⟩=F.(A7) Similarly, since the Bell reference state is invariant un- der subsystem exchange, ⟨SASB⟩= 1.(A8) Substituting these results into Eq. (A4) yields PmA,mB = ...
[22]

Consider first a pure product state |ψ⟩A ⊗ |φ⟩B, with |ψ⟩=α|0⟩+β|1⟩,|φ⟩=γ|0⟩+δ|1⟩, and normalization conditions |α|2 +|β| 2 = 1,|γ| 2 +|δ| 2 = 1

Separability Bound We now prove that any separable two-qubit state sat- isfies F≤ 1 2 . Consider first a pure product state |ψ⟩A ⊗ |φ⟩B, with |ψ⟩=α|0⟩+β|1⟩,|φ⟩=γ|0⟩+δ|1⟩, and normalization conditions |α|2 +|β| 2 = 1,|γ| 2 +|δ| 2 = 1. The overlap with the Bell state is ⟨Φ+|ψφ⟩= 1√ 2(αγ+βδ). The corresponding Bell fidelity becomes Fprod = 1 2 |αγ+βδ| 2.(A11...

[1] [1]

the underlying physical network graph,

[2] [2]

Hub Nacional de Excelencia en Comunicaciones Cuánticas

the operational Bell-connectivity graph. Definition 1(Operational Bell link).A Bell link be- tween nodesAandBis operational if the distributed state supports Bell correlations strong enough to enable E91-type authentication and QKD under realistic physi- cal constraints. Operational connectivity therefore depends not only on graph topology but also on: •c...

[3] [3]

The quantum internet,

H. J. Kimble, “The quantum internet,” Nature453, 1023–1030 (2008)

2008

[4] [4]

Quantum internet: A vision for the road ahead,

S. Wehneret al., “Quantum internet: A vision for the road ahead,” Science362, eaam9288 (2018)

2018

[5] [5]

Quan- tum repeaters: From quantum networks to the quantum internet,

K. Azuma, A. Pirker, D. Markham, and W. Dür, “Quan- tum repeaters: From quantum networks to the quantum internet,” Reviews of Modern Physics95, 045006 (2023)

2023

[6] [6]

MadQCI: a heterogeneous and scal- able SDN-QKD network deployed in production facili- ties,

V. Martínet al., “MadQCI: a heterogeneous and scal- able SDN-QKD network deployed in production facili- ties,” npj Quantum Inf.10, 80 (2024)

2024

[7] [7]

Device-Independent Security of Quantum Cryptography against Collective Attacks,

A. Acínet al., “Device-Independent Security of Quantum Cryptography against Collective Attacks,” Phys. Rev. Lett.98, 230501 (2007)

2007

[8] [8]

Practical challenges in quantum key distribution,

E. Diamanti, H.-K. Lo, B. Qi, and Z. Yuan, “Practical challenges in quantum key distribution,” npj Quantum Inf.2, 16025 (2016)

2016

[9] [9]

Watrous,The Theory of Quantum Infor- mation(Cambridge University Press, Cam- bridge, 2018)

J. Watrous,The Theory of Quantum Infor- mation(Cambridge University Press, Cam- bridge, 2018). ISBN: 9781316848142, DOI: https://doi.org/10.1017/9781316848142 7

work page doi:10.1017/9781316848142 2018

[10] [10]

Collective dynamics of ’small-world’ networks,

D. J. Watts and S. H. Strogatz, “Collective dynamics of ’small-world’ networks,” Nature393, 440–442 (1998)

1998

[11] [11]

Entanglement percolation in quantum networks,

A. Acín, J. I. Cirac, and M. Lewenstein, “Entanglement percolation in quantum networks,” Nature Physics3, 256–259 (2007)

2007

[12] [12]

Entanglement Percola- tion in Quantum Complex Networks,

M. Cuquet and J. Calsamiglia, “Entanglement Percola- tion in Quantum Complex Networks,” Phys. Rev. Lett. 103, 240503 (2009)

2009

[13] [13]

Routing entanglement in the quantum internet,

M. Pantet al., “Routing entanglement in the quantum internet,” npj Quantum Information5, 25 (2019)

2019

[14] [14]

Spectral gap and expo- nential decay of correlations,

M. B. Hastings and T. Koma, “Spectral gap and expo- nential decay of correlations,” Communications in Math- ematical Physics265, 781–804 (2006)

2006

[15] [15]

Matrix prod- uct states, projected entangled pair states, and varia- tional renormalization group methods for quantum spin systems,

F. Verstraete, V. Murg, and J. I. Cirac, “Matrix prod- uct states, projected entangled pair states, and varia- tional renormalization group methods for quantum spin systems,” Adv. Phys.57, 143–224 (2008)

2008

[16] [16]

Vio- lating Bell inequality by mixed spin-1 2 states: necessary and sufficient condition,

R. Horodecki, P. Horodecki, and M. Horodecki, “Vio- lating Bell inequality by mixed spin-1 2 states: necessary and sufficient condition,” Physics Letters A200, 340–344 (1995)

1995

[17] [17]

Fundamental limits of repeaterless quantum communications,

S. Pirandolaet al., “Fundamental limits of repeaterless quantum communications,” Nature Communications8, 15043 (2017)

2017

[18] [18]

Random numbers certified by Bell’s theorem,

S. Pironioet al., “Random numbers certified by Bell’s theorem,” Nature464, 1021–1024 (2010). Appendix A: Distributed SWAP-Based Bell-State Verification In this Appendix we derive the distributed ancilla- assistedSWAPverificationprotocolusedinthemaintext and establish the corresponding separability bound

2010

[19] [19]

Ancillary qubits aA, a B are initialized in the computational state |0⟩aA ⊗ |0⟩aB

Protocol Definition Consider two remote nodes, Alice and Bob, sharing an unknown two-qubit state ρAB, together with a trusted Bell reference pair |Φ+⟩A′B′ = 1√ 2 (|00⟩+|11⟩). Ancillary qubits aA, a B are initialized in the computational state |0⟩aA ⊗ |0⟩aB . The global initial state is therefore ρ0 =|00⟩⟨00| aAaB ⊗ρ AB ⊗ |Φ+⟩⟨Φ+|A′B′.(A1) Hadamard gates a...

[20] [20]

Joint Ancilla Probabilities Define σ=ρ AB ⊗ |Φ+⟩⟨Φ+|A′B′. After the controlled-SWAP operations and the second Hadamard layer, the joint ancilla measurement probabil- ities satisfy PmA,mB = 1 4 h 1 + (−1)mA ⟨SA⟩+ (−1) mB ⟨SB⟩+ (−1) mA+mB ⟨SASB⟩ i ,(A4) where expectation values are evaluated with respect toσ 1. 1 The joint ancilla probability distribution i...

[21] [21]

(A4) yields PmA,mB = 1 4 h 1 + (−1)mA F+ (−1) mB F+ (−1) mA+mB i

Evaluation of the SWAP Expectation Values Define the Bell fidelity F=⟨Φ +|ρ AB |Φ+⟩.(A5) Using the SWAP identity SAA′(|i⟩A|k⟩A′) =|k⟩ A|i⟩A′, one obtains ⟨SA⟩= Tr[S Aσ] =F.(A6) By symmetry, ⟨SB⟩=F.(A7) Similarly, since the Bell reference state is invariant un- der subsystem exchange, ⟨SASB⟩= 1.(A8) Substituting these results into Eq. (A4) yields PmA,mB = ...

[22] [22]

Consider first a pure product state |ψ⟩A ⊗ |φ⟩B, with |ψ⟩=α|0⟩+β|1⟩,|φ⟩=γ|0⟩+δ|1⟩, and normalization conditions |α|2 +|β| 2 = 1,|γ| 2 +|δ| 2 = 1

Separability Bound We now prove that any separable two-qubit state sat- isfies F≤ 1 2 . Consider first a pure product state |ψ⟩A ⊗ |φ⟩B, with |ψ⟩=α|0⟩+β|1⟩,|φ⟩=γ|0⟩+δ|1⟩, and normalization conditions |α|2 +|β| 2 = 1,|γ| 2 +|δ| 2 = 1. The overlap with the Bell state is ⟨Φ+|ψφ⟩= 1√ 2(αγ+βδ). The corresponding Bell fidelity becomes Fprod = 1 2 |αγ+βδ| 2.(A11...