Entanglement-Efficient Distribution of Quantum Circuits over Large-Scale Quantum Networks

• URL: http://arxiv.org/abs/2507.16036v2
• Date: Wed, 23 Jul 2025 08:24:17 GMT
• Title: Entanglement-Efficient Distribution of Quantum Circuits over Large-Scale Quantum Networks
• Authors: Felix Burt, Kuan-Cheng Chen, Kin K. Leung,
• Abstract summary: We investigate the performance in terms of entanglement requirements and time of various quantum circuits over different network topologies.<n>We show that coarsened methods can achieve improved solution quality in most cases with significantly lower run-times than direct partitioning methods.
• Score: 2.9078970632232104
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However, connecting large numbers of QPUs will eventually result in connectivity constraints at the network level, where the difficulty of entanglement sharing increases with network path lengths. This increases the complexity of the quantum circuit partitioning problem, since the cost of generating entanglement between end nodes varies with network topologies and existing links. We address this challenge using a simple modification to existing partitioning schemes designed for all-to-all connected networks, that efficiently accounts for both of these factors. We investigate the performance in terms of entanglement requirements and optimisation time of various quantum circuits over different network topologies, achieving lower entanglement costs in the majority of cases than state-of-the-art methods. We provide techniques for scaling to large-scale quantum networks employing both network and problem coarsening. We show that coarsened methods can achieve improved solution quality in most cases with significantly lower run-times than direct partitioning methods.

Related papers

• Embedding of Tree Tensor Networks into Shallow Quantum Circuits [0.0]
  This study proposes a method to embed Tree Networks (TTNs) into shallow quantum circuits.<n>Our numerical results show that embedding TTNs provides better initial quantum circuits than Matrix Product States (MPS)<n>This study is expected to extend the application of VQAs to two-dimensional systems and those with long-range correlations.
  arXiv  Detail & Related papers  (2025-01-31T02:38:17Z)
• Exact Quantum Algorithm for Unit Commitment Optimization based on Partially Connected Quantum Neural Networks [12.688426228429604]
  In this paper, we focus on the implement of the unit commitment problem by exact quantum algorithms based on the quantum neural network (QNN) The results show that the exact solutions can be obtained by the improved algorithm and the depth of the quantum circuit can be reduced simultaneously.
  arXiv  Detail & Related papers  (2024-11-18T08:29:50Z)
• Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization [0.8121127831316319]
  We propose a method for constructing quantum circuits which greatly reduces inter-device communication costs. We show that we can construct tractable circuits nearly three times the size of previous QDCA methods while retaining a similar or greater level of quality.
  arXiv  Detail & Related papers  (2024-05-01T20:49:50Z)
• Routing in Quantum Repeater Networks with Mixed Efficiency Figures [10.955844285189373]
  We focus on some key parameters in an operational quantum network such as the fraction of nodes with a higher efficiency.<n>Our simulations show that incorporating knowledge of node quality helps boost the fidelity of some of the routing paths.<n>The study also highlights the critical role of the fraction of high-quality nodes in end-to-end fidelity and explores the trade-offs between upgrading all nodes to high quality or retaining a subset of lower-quality nodes.
  arXiv  Detail & Related papers  (2023-10-13T10:13:16Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• 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)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Entanglement Rate Optimization in Heterogeneous Quantum Communication Networks [79.8886946157912]
  Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes.
  arXiv  Detail & Related papers  (2021-05-30T11:34:23Z)
• Robustness of Noisy Quantum Networks [0.0]
  We show that quantum networks based on typical noisy quantum-repeater nodes are prone to discontinuous phase transitions. Our results indicate that a scale-free topology is a crucial design principle to establish a robust large-scale quantum internet.
  arXiv  Detail & Related papers  (2021-03-04T19:01:49Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)

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.