Entanglement capacity of complex networks from quantum walks

TL;DR

This paper introduces a new entanglement measure for complex networks based on bipartitions, revealing how network structure influences quantum entanglement generated by quantum walks.

Contribution

It generalizes coin-walker entanglement to irregular networks using bipartitions, linking network connectivity to entanglement bounds and structure-dependent quantum correlations.

Findings

Network connectivity bounds maximum entanglement.

Graph matchings govern entanglement generation.

Improved connectivity in random graphs reduces attainable entanglement.

Abstract

Discrete-time quantum walks provide a natural framework for quantum transport on complex networks. On regular structures, coin-walker entanglement has been widely used to characterize quantum transport and to support quantum algorithmic protocols. However, this notion relies on a fixed Hilbert space factorization separating coin and position and is therefore not directly applicable to more complex, irregular structures. Here we introduce an entanglement measure for general networks based on a bipartition that assigns each node two roles, acting as both a source and a target. The resulting bipartition defines the source-target entanglement, a measure for general networks, motivated by coin-walker entanglement. We show that the connectivity of the network imposes an upper bound on this entanglement and identify graph matchings as the underlying structure governing entanglement generation. We further illustrate that in random graphs improving graph connectivity reduces the attainable entanglement, establishing a structure-dependent constraint on quantum correlations.