arXiv:2605.15029

A Resource-Driven Framework for Configurable Entanglement in Quantum Networks

Francesco Mazza, Claudio Pellitteri, Angela Sara Cacciapuoti, Marcello Caleffi

quant-phcs.NISubmitted May 14, 2026• Announced May 15, 2026• 0 citations

Abstract

Shared multipartite entanglement defines a ``whatever channel'', i.e., a latent communication substrate that does not determine a priori which end-to-end entangled links are activated, but can be configured to support different entanglement-connectivity graphs through Local Operations and Classical Communication (LOCC). Building on this, we propose a resource-driven framework in which multipartite entanglement is treated as a programmable resource that induces a space of admissible entanglement-graph configurations. Within this framework, connectivity provisioning emerges as a particular instance of a more general resource reconfiguration process. To support this paradigm, we introduce a set of structural design parameters that characterize the operational degrees of freedom of the resource and define the admissible transformations independently of the specific mechanism used to realize them. We then formalize Entanglement Rolling as a measurement-based protocol that operates over the induced configuration space, enabling the systematic reconfiguration of the shared resource across a family of multipartite states. Finally, we analyze the proposed framework under realistic noise conditions. Leveraging the Noisy Stabilizer Formalism (NSF), we derive closed-form noise maps that characterize the effect of noise on the resource transformations and show that the proposed approach maintains reliable performance under relevant noise processes.

Comments: This work has been funded by the European Union under the ERC grant QNattyNet, n. 101169850

Related papers

Resource states and temporal order of the measurement-based model of quantum computation

Poya Haghnegahdar

Measurement-based quantum computation (MBQC) performs quantum algorithms by local, adaptive measurements on an initially entangled many-body "resource" state. This thesis investigates MBQC through two tightly coupled lenses: (i) which physical states and phases of matter constitute universal resources, and (ii) how the temporal order induced by measurement adaptivity constrains and, in turn, is constrained by those resources. Resources from valence-bond constructions. We develop hybrid AKLT-type (valence-bond) resources on two-dimensional lattices and show how a generalized POVM reduces higher-spin degrees of freedom to effective qubits while preserving computational viability. We analyze worst-case and frustrated geometries (e.g., kagome and decorated lattices), identify planarity-restoring local operations, and use percolation-style diagnostics on the induced graph states to certify universality beyond idealized cluster-state settings. A two-parameter phase with noisy POVMs. Extending ground states across a phase connected to the AKLT point, we introduce a measurement-noise–aware framework with probabilistic restoration and closed-form weight formulae derived via a graphical (g-)calculus. Large-scale numerics that account for correlations map a two-parameter phase diagram and delineate regimes of universal vs. non-universal post-measurement graphs. These results exhibit a robust universal region that persists away from ideal measurements and clarify how noise and Hamiltonian deformation jointly control computational power. Temporal order and determinism. We develop a stabilizer-and-influence-matrix formalism that places temporal dependencies on the same footing as resource structure. Four theorems establish a two-way determination between (a) the classical processing relations (including the influence matrix that generates the partial order of measurements) and (b) the resource stabilizer in a normal form, up to local equivalence. This links gauge freedoms, byproduct handling, and flow/gflow–style constraints into a unified picture of when adaptive measurement schedules yield deterministic computation. Together, these contributions clarify when physically motivated ground states serve as universal MBQC resources under realistic measurement noise, and how temporal constraints fundamentally shape the space of admissible computations in MBQC.

Jan 1, 20260 citations

Optimized Quantum Networks

Jorge Miguel-Ramiro, Alexander Pirker, Wolfgang Dür

The topology of classical networks is determined by physical links between nodes, and after a network request the links are used to establish the desired connections. Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests, which can substitute links and allow one to fulfill multiple network requests with the same resource state. We utilize this to design entanglement-based quantum networks tailored to their desired functionality, independent of the underlying physical structure. The kind of entanglement to be stored is chosen to fulfill all desired network requests (i.e. parallel bipartite or multipartite communications between specific nodes chosen from some finite set), but in such a way that the storage requirement is minimized. This can be accomplished by using multipartite entangled states shared between network nodes that can be transformed by local operations to different target states. We introduce a clustering algorithm to identify connected clusters in the network for a given desired functionality, i.e. the required network topology of the entanglement-based network, and a merging algorithm that constructs multipartite entangled resource states with reduced memory requirement to fulfill all desired network requests. This leads to a significant reduction in required time and resources, and provides a powerful tool to design quantum networks that is unique to entanglement-based networks.

arXiv:2107.10275QuantumFeb 9, 202336 citations

Useful entanglement can be extracted from noisy graph states

Konrad Szymański, Lina Vandré, Otfried Gühne

Cluster states and graph states in general offer a useful model of the stabilizer formalism and a path toward the development of measurement-based quantum computation. Their defining structure – the stabilizer group – encodes all possible correlations that can be observed during measurement. The measurement outcomes which are consistent with the stabilizer structure make error correction possible. Here, we leverage both properties to design feasible families of states that can be used as robust building blocks of quantum computation. This procedure reduces the effect of experimentally relevant noise models on the extraction of smaller entangled states from the larger noisy graph state. In particular, we study the extraction of Bell pairs from linearly extended graph states – this has the immediate consequence for state teleportation across the graph. We show that robust entanglement can be extracted by proper design of the linear graph with only a minimal overhead of the physical qubits. This scenario is relevant to systems in which the entanglement can be created between neighboring sites. The results shown in this work provide a mathematical framework for noise reduction in measurement-based quantum computation. With proper connectivity structures, the effect of noise can be minimized for a large class of realistic noise processes.

arXiv:2402.00937QuantumJan 21, 20260 citations

Distillation of multipartite entangled states for arbitrary subsets of parties in noisy quantum networks of increasing size

Aitor Balmaseda, Julio I. de Vicente

Quantum network states are multipartite states built from distributing pairwise entanglement among parties and underpin the paradigm of quantum networks for quantum information processing. In this work we introduce the problem of partial distillability in noisy quantum networks. This corresponds to the possibility of distilling by local operations and classical communication an arbitrary pure state for an arbitrary subset of parties starting from a single copy of a quantum network state of an increasing number of parties that share noisy (i.e. mixed) bipartite entangled states. Here, distillation means that the target state is obtained with fidelity as close to 1 as desired as the size of the network increases when the pairwise entangled links support a constant amount of noise. While we prove an obstruction to multipartite distillation protocols after teleportation with channels with constant noise, we show that partial distillability is indeed possible if certain well-established graph-theoretic parameters that measure the connectivity in the network grow fast enough with its size. We give necessary as well as sufficient conditions for partial distillability in terms of these parameters and we moreover provide explicit constructions of networks with partial distillability and a relatively slow connectivity growth.

arXiv:2505.15676Physical Review ASep 3, 20250 citations

Quantum Bell nonlocality as a form of entanglement

Eric Chitambar, Gilad Gour, Kuntal Sengupta +1 more

Bell nonlocality describes a manifestation of quantum mechanics that cannot be explained by any local hidden variable model. Its origin lies in the nature of quantum entanglement, although understanding the precise relationship between nonlocality and entanglement has been a notorious open problem. In this paper, we develop a dynamical framework in which quantum Bell nonlocality emerges as a special form of entanglement and both are unified as resources under local operations and classical communication (LOCC). Our framework is built on the notion of classical and quantum processes, which are defined as channels that map elements between specific intervals in space and time. Entanglement is identified as a process that cannot be generated by LOCC while Bell nonlocality is the subset of these processes that have an instantaneous input-to-output delay time. LOCC preprocessing is a natural set of free operations in this theory, thereby providing previous nonlocality activation results a clear resource-theoretic foundation. We provide a systematic method to quantify the Bell nonlocality of a bipartite quantum channel. It is shown that both the relative entropy and the max relative entropy of nonlocality are nonadditive for a family of bipartite classical channels. This family includes the channel obtained when using the singlet state to maximally violate the CHSH inequality. We also find that the regularized relative entropy of Bell nonlocality provides an upper bound on the asymptotic rate of converting (i.e., simulating) many copies of one classical instantaneous resource to another.

arXiv:2012.06918Physical Review ANov 15, 202112 citations

Optimising multipartite entanglement manipulation in quantum networks

Shashank Shekhar, David Elkouss, Siddhartha Santra

Long-range, genuine multipartite entanglement (GME) between distant parties in a quantum network is a crucial resource for distributed quantum information processing. Through controlled manipulation of short-range GME states in the network via stochastic local operations aided by classical communication (SLOCC), long-range GME can be established between selected target nodes on demand. Optimizing such multipartite entanglement distribution protocols under constraints imposed by the network architecture, target-node set, and available resource budget is a key challenge in resource-efficient manipulation of GME. We present a general operational framework for manipulating GME in quantum networks by classifying the relevant networking operations into three broad primitives-inflation, deflation, and purification-reflecting their effect on the proliferation of GME through general bounds and illustrative examples. We show how these primitives can be combined to construct a broad class of multipartite quantum repeater protocols, enabling their systematic optimization, and demonstrate the framework with a simple example. Applying our approach to networks of Dür-Cirac-Tarrach states reveals a rich landscape of achievable end-to-end GME and accessible entanglement classes. More generally, our framework provides a systematic approach to the construction and optimization of multipartite quantum repeater protocols for scalable and resource-efficient GME distribution in quantum networks.

quant-pharXiv:2610.21420Oct 16, 20260 citations