AutoComm: A Framework for Enabling Efficient Communication in Distributed Quantum Programs

• URL: http://arxiv.org/abs/2207.11674v2
• Date: Fri, 21 Oct 2022 21:01:07 GMT
• Title: AutoComm: A Framework for Enabling Efficient Communication in Distributed Quantum Programs
• Authors: Anbang Wu, Hezi Zhang, Gushu Li, Alireza Shabani, Yuan Xie, Yufei Ding
• Abstract summary: Non-local quantum communication between quantum devices is much more expensive and error-prone than the local quantum communication within each quantum device. In this paper, we identify burst communication, a specific qubit-node communication pattern that widely exists in many distributed programs. We then propose AutoComm, an automatic compiler framework to first extract the burst communication patterns from the input programs, and then optimize the communication steps of burst communication discovered.
• Score: 15.05397810840915
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Distributed quantum computing (DQC) is a promising approach to extending the computational power of near-term quantum devices. However, the non-local quantum communication between quantum devices is much more expensive and error-prone than the local quantum communication within each quantum device. Previous work on the DQC communication optimization focus on optimizing the communication protocol for each individual non-local gate and then adopt quantum compilation designs which are designed for local multi-qubit gates (such as controlled-x or CX gates) in a single quantum computer. The communication patterns in distributed quantum programs are not yet well studied, leading to a far-from-optimal communication cost. In this paper, we identify burst communication, a specific qubit-node communication pattern that widely exists in many distributed programs and can be leveraged to guide communication overhead optimization. We then propose AutoComm, an automatic compiler framework to first extract the burst communication patterns from the input programs, and then optimize the communication steps of burst communication discovered. Experimental results show that our proposed AutoComm can reduce the communication resource consumption and the program latency by 75.6% and 71.4% on average, respectively.

Related papers

• Generalised Circuit Partitioning for Distributed Quantum Computing [0.30723404270319693]
  This work introduces a graph-based formulation which allows joint optimisation of gate and state teleportation cost. Using a basic genetic algorithm, improved performance over state-of-the-art methods is obtained in terms of both average e-bit cost and time scaling.
  arXiv  Detail & Related papers  (2024-08-02T17:59:51Z)
• S-QGPU: Shared Quantum Gate Processing Unit for Distributed Quantum Computing [22.22578354426069]
  We propose a distributed quantum computing architecture in which individual small-sized quantum computers are connected to a shared quantum gate processing unit. The S-QGPU comprises a collection of hybrid two-qubit gate modules for remote gate operations.
  arXiv  Detail & Related papers  (2023-09-15T19:54:07Z)
• 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)
• A Modular Quantum Compilation Framework for Distributed Quantum Computing [0.0]
  Distributed Quantum Computing is a scalable approach for increasing the number of available qubits for computational tasks. We present a modular quantum compilation framework for DQC that takes into account both network and device constraints. We also devised a strategy for remote scheduling that can exploit both TeleGate and TeleData operations.
  arXiv  Detail & Related papers  (2023-05-04T16:13:23Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• CollComm: Enabling Efficient Collective Quantum Communication Based on EPR buffering [19.579129303545535]
  We develop a compiler framework to optimize the collective communication happening in distributed quantum programs. Experimental results show that the proposed framework can halve the communication cost of various distributed quantum programs.
  arXiv  Detail & Related papers  (2022-08-13T20:19:09Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• 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)
• 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)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Two-way covert quantum communication in the microwave regime [0.0]
  Quantum communication addresses the problem of exchanging information across macroscopic distances. We advance a new paradigm for secure quantum communication by combining backscattering concepts with covert communication in the microwave regime. This work makes a decisive step toward implementing secure quantum communication concepts in the previously uncharted $1$-$10$ GHz frequency range.
  arXiv  Detail & Related papers  (2020-04-15T16:36:59Z)

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.