Scalable Graph State Generation with O(1) Local Feedforward in Quantum Networks

• URL: http://arxiv.org/abs/2606.16375v1
• Date: Mon, 15 Jun 2026 08:10:59 GMT
• Title: Scalable Graph State Generation with O(1) Local Feedforward in Quantum Networks
• Abstract summary: We propose a protocol to reduce routing decision delays to levels far below the coherence time of qubits.<n>The proposed protocol performs well in terms of both resource efficiency and time feasibility.<n>This protocol provides a clear path to achieving high-fidelity star subgraphs.
• Score: 20.203909213101337
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The development of quantum networks faces a key challenge: the contradiction between probabilistic long-range entanglement generation and finite coherence time. Existing routing protocols typically focus on global state computation or path optimization. As the network scales up, classical delays accumulate and exacerbate decoherence, leading to a decrease in entanglement fidelity. To reduce routing decision delays to levels far below the coherence time of qubits, we propose a protocol based on local measurement and classical feedforward. This protocol reduces the local decision complexity to amortized O(1) level, ensuring that the decision delay is always much smaller than the coherence time of qubits. We map this protocol onto a dual-species trapped-ion platform and perform hybrid simulations. The results show that the proposed protocol performs well in terms of both resource efficiency and time feasibility. Noise analysis indicates that readout fidelity is the main bottleneck of this protocol, but noise suppression can be achieved by employing an erasure transformation in the dual-species architecture, combined with spatial multiplexing and branch independence, thereby ensuring the generation of high-fidelity star subgraphs. This protocol provides a clear path to achieving high-fidelity star subgraphs. These subgraphs can serve as general modules, merging to construct arbitrary subgraphs, providing a feasible solution for future fault-tolerant distributed quantum computing.

Related papers

• Promise and Challenges of Distimation [0.11242503819703255]
  Estimating the quality of raw entangled states and distilling high-fidelity entanglement traditionally require two separate link-layer protocols in a quantum network stack.<n>The recently introduced distimation concept merges these two protocols by directly extracting state estimation data from the classical syndromes generated during entanglement distillation.<n>This article surveys the core principles of distimation, quantifies expected gains for realistic architectures, and outlines a research roadmap toward making distimation a standard building block in future quantum networks.
  arXiv  Detail & Related papers  (2026-08-09T14:49:02Z)
• Making Quantum Networks Work: Routing, Calibration, and Programmable Quantum Repeaters [9.753976630302075]
  The quantum internet enables distribution of quantum states across distant nodes, supporting secure communication, distributed computing, and quantum sensing.<n>Unlike classical networks, it is constrained by the no cloning theorem, probabilistic entanglement generation, decoherence, and hardware drift.<n>This thesis studies the architecture, routing, and operation of quantum networks under realistic constraints.
  arXiv  Detail & Related papers  (2026-06-21T03:06:25Z)
• Optimal GHZ-State Distribution in LOSR Quantum Networks via Local Decoding from Information Sets [40.76168869865134]
  We prove the conjecture for regular and uniform networks of arbitrary size.<n>By identifying the hyperedges of the network with the coordinates of a linear code, we show that whenever the edges incident to each node form an information set, a fixed collection of local unitaries transforms the source state into an (N)-party GHZ state with fidelity (dm-M)<n>These results demonstrate that multipartite sources, together with shared randomness, can replace real-time classical communication for entanglement distribution.
  arXiv  Detail & Related papers  (2026-06-19T14:53:28Z)
• Plan First, Diffuse Later: Extrinsic Graph Guidance for Long-Horizon Diffusion Planning [44.52185127499181]
  Compositional diffusion models offer a promising route to long-horizon planning.<n>But enforcing local behavior over long chains is often insufficient for a coherent global structure to emerge.<n>Recent works tackle this limitation through intrinsic search, which explores multiple paths during the denoising process.
  arXiv  Detail & Related papers  (2026-05-16T07:53:04Z)
• Centralizing Task-based Approach to Quantum Network Control [71.48385446560893]
  layered architectures impose stringent design and timing constraints on quantum networks.<n>We simulate a resource-centric, task-based approach to quantum network control by utilizing a centralized controller.
  arXiv  Detail & Related papers  (2026-05-05T03:57:17Z)
• Impact of Topology on Multipartite Entanglement Distribution Protocols in Quantum Networks [41.99844472131922]
  Quantum networks will rely on entanglement distribution to enable multi-user applications such as distributed quantum computing and cryptography.<n>We present a systematic study of four routing protocols for entanglement distribution over 81 real network topologies.<n>We identify four distinct topology-dependent performance regimes, where: (i) all protocols perform poorly, (ii) tree-based protocols dominate, (iii) multi-path protocols dominate, or (iv) all protocols perform well.
  arXiv  Detail & Related papers  (2026-03-26T21:21:18Z)
• Efficient construction of fault-tolerant neutral-atom cluster states [0.0]
  We propose a protocol to generate and merge high-fidelity many-atom entangled states into a 3D cluster state.<n>Our simulations indicate that a state-of-the-art high-finesse optical cavity is sufficient for constructing a scalable fault-tolerant cluster state.
  arXiv  Detail & Related papers  (2025-07-26T16:55:52Z)
• Deterministic generation of multi-qubit entangled states among distant parties using indefinite causal order [1.556591713973462]
  We present protocols for generating $N$-qubit entangled states across multiple network nodes.<n>The results indicate that our protocols significantly improve the efficiency of long-distance entanglement generation.
  arXiv  Detail & Related papers  (2025-03-05T11:40:19Z)
• Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks [9.971549076128268]
  We explore two minimal asynchronous protocols for entanglement in quantum networks. A parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation.
  arXiv  Detail & Related papers  (2024-05-03T18:04:11Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Convergence Acceleration in Wireless Federated Learning: A Stackelberg Game Approach [46.72890704790504]
  This paper studies issues that arise with respect to the joint optimization for convergence time in federated learning over wireless networks (FLOWN) We consider the criterion and protocol for selection of participating devices in FLOWN under the energy constraint and derive its impact on device selection. We propose a new age-of-update (AoU) based device selection algorithm.
  arXiv  Detail & Related papers  (2022-09-14T13:20:26Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Over-the-Air Federated Learning via Second-Order Optimization [37.594140209854906]
  Federated learning (FL) could result in task-oriented data traffic flows over wireless networks with limited radio resources. We propose a novel over-the-air second-order federated optimization algorithm to simultaneously reduce the communication rounds and enable low-latency global model aggregation.
  arXiv  Detail & Related papers  (2022-03-29T12:39:23Z)
• Improved analytical bounds on delivery times of long-distance entanglement [0.0]
  We provide improved analytical bounds on the average and on the quantiles of the completion time of entanglement distribution protocols. A canonical example of such a protocol is a nested quantum repeater scheme which consists of heralded entanglement generation and entanglement swaps.
  arXiv  Detail & Related papers  (2021-03-21T18:14:56Z)

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.