Topology-Dependent Enhancement of Entanglement Extraction in Repeater Graph States

• URL: http://arxiv.org/abs/2609.03496v1
• Date: Thu, 03 Sep 2026 08:00:55 GMT
• Title: Topology-Dependent Enhancement of Entanglement Extraction in Repeater Graph States
• Abstract summary: Quantum repeaters are essential for establishing long-distance quantum communication.<n>Traditional repeater architectures rely on physical quantum memory, which introduces decoherence.<n>The repeater graph state (RGS) architecture offers a promising memory-less alternative.
• Score: 0.1505138022798109
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum repeaters are essential for establishing long-distance quantum communication to overcome the exponential decay of entanglement due to photon loss. Traditional repeater architectures rely on physical quantum memory, which introduces decoherence and poses significant practical implementation challenges. The repeater graph state (RGS) architecture offers a promising memory-less alternative that is inherently resilient to photon losses. A key challenge in implementing RGS lies in the requirement for highly efficient graph state generators and complex qubit measurement. In this work, we aim to investigate the strategies for extracting the maximum number of Bell pairs from the RGS structure via its qubit connection to resolve the well-known bottleneck problem of RGS in which only a single Bell pair can be extracted from a complete bipartite graph state. From simulations, we observe that the maximum number of extracted Bell pairs depends on its connection topology, where the Bell-pair yield tends to be maximal at low to moderate edge densities. As the number of network hops increases, the RGS must be equipped with higher inner-qubit connectivity to maintain a sufficient yield of extractable Bell pairs. Thus, the expected resource requirement shifts toward the use of RGSs with higher inner-qubit connectivity.

Related papers

• Efficient Recommendations via Graph Coarsening and Label Propagation [50.71909189967895]
  Graph-based recommendations are widely adopted in real-world industrial applications.<n>One promising approach is graph coarsening, an adaptive graph reduction technique.<n>We propose a flexible two-stage diffusion framework that combines graph coarsening with multi-step label propagation.
  arXiv  Detail & Related papers  (2026-07-24T13:25:26Z)
• Beyond the Aggregation Dilemma: Prior-Retaining Decoupled Learning for Multimodal Graphs [69.56407708794845]
  MultimodalAttributed Graph Learning (MAGL) integrates node attributes with structural topology via graph aggregation.<n>As pretrained encoders evolve into Large Foundation Models (LFMs), the landscape of MAGL fundamentally shifts.<n>Under high-confidence LFM priors, mandatory aggregation introduces topological intrinsic noise that overwhelms discriminative signals.<n>We propose SUPRA (Shared-Unique Prior-Retaining Architecture), a decoupled dual-pathway paradigm.<n> SUPRA processes modality-specific features through topology-agnostics while capturing structural synergy via a lightweight shared GNN, with auxiliary deep supervision counteracting gradient starvation.
  arXiv  Detail & Related papers  (2026-05-23T17:42:25Z)
• Quantum Resource Estimation for Minimising Energy Grid Losses [0.0]
  This paper explores the use of gate-based quantum computing to solve DNR for power loss reduction.<n>It is applied to a real medium voltage (MV) network operated by Alliander, a Dutch distribution system operator.
  arXiv  Detail & Related papers  (2026-05-05T07:52:44Z)
• HELP: HyperNode Expansion and Logical Path-Guided Evidence Localization for Accurate and Efficient GraphRAG [53.30561659838455]
  Large Language Models (LLMs) often struggle with inherent knowledge boundaries and hallucinations.<n>Retrieval-Augmented Generation (RAG) frequently overlooks structural interdependencies essential for multi-hop reasoning.<n>Help achieves competitive performance across multiple simple and multi-hop QA benchmarks and up to a 28.8$times$ speedup over leading Graph-based RAG baselines.
  arXiv  Detail & Related papers  (2026-02-24T14:05:29Z)
• Plain Transformers are Surprisingly Powerful Link Predictors [57.01966734467712]
  Link prediction is a core challenge in graph machine learning, demanding models that capture rich and complex topological dependencies.<n>While Graph Neural Networks (GNNs) are the standard solution, state-of-the-art pipelines often rely on explicit structurals or memory-intensive node embeddings.<n>We present PENCIL, an encoder-only plain Transformer that replaces hand-crafted priors with attention over sampled local subgraphs.
  arXiv  Detail & Related papers  (2026-02-02T02:45:52Z)
• ScaleGNN: Towards Scalable Graph Neural Networks via Adaptive High-order Neighboring Feature Fusion [73.85920403511706]
  We propose ScaleGNN, a novel framework that adaptively fuses multi-hop node features for scalable and effective graph learning.<n>We show that ScaleGNN consistently outperforms state-of-the-art GNNs in both predictive accuracy and computational efficiency.
  arXiv  Detail & Related papers  (2025-04-22T14:05:11Z)
• A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks [0.6827423171182154]
  Greenberger--Horne--Zeilinger (GHZ) and other graph states are important resources in multiparty quantum network protocols and measurement-based quantum computing.<n>We consider the problem of generating such states from networks of bipartite entangled (Bell) pairs.<n>We present a protocol for producing GHZ states in arbitrary Bell-pair networks that is efficient with respect to all of these figures of merit.
  arXiv  Detail & Related papers  (2024-12-05T15:33:03Z)
• Generalized Quantum Repeater Graph States [1.7635061227370266]
  We present a new approach to ensure the loss tolerance of distributing a single ebit.<n>We demonstrate that our new scheme significantly outperforms the previous work with much flexibility.<n>These findings offer new insights into the scalability and reliability of loss-tolerant quantum networks.
  arXiv  Detail & Related papers  (2024-07-01T16:21:37Z)
• An Improved Design for All-Photonic Quantum Repeaters [0.8409980020848168]
  All-photonic quantum repeaters use multi-qubit photonic graph states, called repeater graph states (RGS), instead of matter-based quantum memories. We propose a new RGS design, which achieves a higher entanglement rate for all-photonic quantum repeaters using fewer qubits. We also propose a new adaptive scheme to perform logical BSM on the link qubits for loss-only errors.
  arXiv  Detail & Related papers  (2024-05-20T03:57:55Z)
• Architecture and protocols for all-photonic quantum repeaters [0.49157446832511503]
  All-photonic quantum repeater scheme promises resilience to photon losses and operational errors. We propose a new emitter-photonic qubit building block and an RGS protocol that addresses several key considerations. Our proposed building block significantly reduces the total number of emissive quantum memories required for end nodes.
  arXiv  Detail & Related papers  (2023-06-06T15:08:50Z)
• 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)

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.