Entanglement capacity of complex networks from quantum walks

• URL: http://arxiv.org/abs/2605.00772v1
• Date: Fri, 01 May 2026 16:40:13 GMT
• Title: Entanglement capacity of complex networks from quantum walks
• Abstract summary: 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.<n>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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• The minimal example of quantum network Bell nonlocality [35.32674634043692]
  We show that quantum nonlocality is possible in the triangle network where the parties have no input choices and produce only binary-valued outcomes.<n>We develop an efficient method for parameterizing quantum distributions in networks, inspired by the formalism of higher-order quantum operations.
  arXiv  Detail & Related papers  (2026-05-01T18:00:00Z)
• Implementing a Universal Set of Geometric Quantum Gates through Dressed-State assisted STA [39.27725073249277]
  We analyze the implementation of single-qubit gates in a two-level system driven by a microwave field.<n>We show how the dynamical phase can be canceled to obtain purely geometric operations.<n>We extend the protocol to construct non two-qubit gates, highlighting its feasibility for scalable quantum information processing.
  arXiv  Detail & Related papers  (2025-09-10T16:14:34Z)
• Satellite-Aided Entanglement Distribution for Optimized Quantum Networks [30.362736262973463]
  Quantum internet needs to ensure timely provision of entangled qubits to be used in tasks that involve distributed quantum computing or sensing.<n>Pre-distribution of entanglements should aim to minimize the amount of qubits used, as this decreases the risk of decoherence and thus degradation of the entangled state.<n>Satellite-aided Entanglement Distribution (SED) can significantly enhance the performance of small quantum networks.
  arXiv  Detail & Related papers  (2025-02-25T11:21:20Z)
• Clustering-induced localization of quantum walks on networks [0.0]
  Quantum walks on networks are a paradigmatic model in quantum information theory.<n>We show how localization emerges in highly clustered networks.<n>We then show that localization also occurs in Kleinberg small-world networks and Holme--Kim power-law cluster networks.
  arXiv  Detail & Related papers  (2024-12-05T16:40:57Z)
• Distributing quantum correlations through local operations and classical resources [0.0]
  Global quantum correlations, as characterized by the discord, can be distributed to quantum memories using a mixed state of information carriers.<n>We show that even more discord can be generated when the resource state undergoes correlated dephasing noise.
  arXiv  Detail & Related papers  (2024-08-10T08:42:06Z)
• Quantum Networks Enhanced by Distributed Quantum Memories [0.0]
  We show that a network-wide synergistic usage of quantum memories distributed in a quantum communication network offers a fundamental advantage. We first map the problem of quantum communication with local usage of memories into a classical continuum percolation model. This improved mapping can be formulated in terms of graph-merging rules, analogous to the decimation rules of the renormalization group treatment of disordered quantum magnets.
  arXiv  Detail & Related papers  (2024-03-25T02:16:25Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• A scheme to create and verify scalable entanglement in optical lattice [17.18535438442883]
  We propose an efficient scheme to generate and characterize global entanglement in the optical lattice. With only two-layer quantum circuits, the generation utilizes two-qubit entangling gates based on the superexchange interaction in double wells. Our entanglement generation and verification protocols provide the foundation for the further quantum information processing in optical lattice.
  arXiv  Detail & Related papers  (2022-09-04T04:48:05Z)
• Strong entanglement distribution of quantum networks [3.6720510088596297]
  Large-scale quantum networks have been employed to overcome practical constraints of transmissions and storage for single entangled systems. We show any connected network consisting of generalized EPR states and GHZ states satisfies strong CKW monogamy inequality in terms of bipartite entanglement measure. We classify entangled quantum networks by distinguishing network configurations under local unitary operations.
  arXiv  Detail & Related papers  (2021-09-27T08:45:18Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Quantum Entropic Causal Inference [30.939150842529052]
  We put forth a new theoretical framework for merging quantum information science and causal inference by exploiting entropic principles. We apply our proposed framework to an experimentally relevant scenario of identifying message senders on quantum noisy links.
  arXiv  Detail & Related papers  (2021-02-23T15:51:34Z)
• Maximal qubit violation of n-local inequalities in quantum network [0.0]
  Source independent quantum networks are considered as a natural generalization to the Bell scenario. We consider the complexities in the quantum networks with an arbitrary number of parties distributed in chain-shaped and star-shaped networks.
  arXiv  Detail & Related papers  (2020-11-06T18:45:07Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.