CollComm: Enabling Efficient Collective Quantum Communication Based on EPR buffering

• URL: http://arxiv.org/abs/2208.06724v2
• Date: Tue, 30 Aug 2022 17:26:20 GMT
• Title: CollComm: Enabling Efficient Collective Quantum Communication Based on EPR buffering
• Authors: Anbang Wu, Yufei Ding, Ang Li
• Abstract summary: 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.
• Score: 19.579129303545535
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The noisy and lengthy nature of quantum communication hinders the development of distributed quantum computing. The inefficient design of existing compilers for distributed quantum computing worsens the situation. Previous compilation frameworks couple communication hardware with the implementation of expensive remote gates. However, we discover that the efficiency of quantum communication, especially collective communication, can be significantly boosted by decoupling communication resources from remote operations, that is, the communication hardware would be used only for preparing remote entanglement, and the computational hardware, the component used to store program information, would be used for conducting remote gates. Based on the observation, we develop a compiler framework to optimize the collective communication happening in distributed quantum programs. In this framework, we decouple the communication preparation process in communication hardware from the remote gates conducted in computational hardware by buffering EPR pairs generated by communication hardware in qubits of the computational hardware. Experimental results show that the proposed framework can halve the communication cost of various distributed quantum programs, compared to state-of-the-art compilers for distributed quantum computing.

Related papers

• SeQUeNCe GUI: An Extensible User Interface for Discrete Event Quantum Network Simulations [55.2480439325792]
  SeQUeNCe is an open source simulator of quantum network communication. We implement a graphical user interface which maintains the core principles of SeQUeNCe.
  arXiv  Detail & Related papers  (2025-01-15T19:36:09Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Architectures and circuits for distributed quantum computing [0.0]
  This thesis treats networks providing quantum computation based on distributed paradigms. The main contribution of this thesis is on the definition of compilers that minimize the impact of telegates on the overall fidelity.
  arXiv  Detail & Related papers  (2023-07-16T00:03:59Z)
• MECH: Multi-Entry Communication Highway for Superconducting Quantum Chiplets [8.331379159321271]
  As the computing scale increases, communication between qubits would become a more severe bottleneck. We propose a multi-entry communication highway (MECH) mechanism to trade ancillary qubits for program. This implies a more efficient and less error-prone compilation of quantum programs.
  arXiv  Detail & Related papers  (2023-05-09T03:20:56Z)
• 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)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• AutoComm: A Framework for Enabling Efficient Communication in Distributed Quantum Programs [15.05397810840915]
  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.
  arXiv  Detail & Related papers  (2022-07-24T06:49:58Z)
• 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)
• A MLIR Dialect for Quantum Assembly Languages [78.8942067357231]
  We demonstrate the utility of the Multi-Level Intermediate Representation (MLIR) for quantum computing. We extend MLIR with a new quantum dialect that enables the expression and compilation of common quantum assembly languages. We leverage a qcor-enabled implementation of the QIR quantum runtime API to enable a retargetable (quantum hardware agnostic) compiler workflow.
  arXiv  Detail & Related papers  (2021-01-27T13:00:39Z)
• Compiler Design for Distributed Quantum Computing [6.423239719448169]
  We discuss the main challenges arising with compiler design for distributed quantum computing. We analytically derive an upper bound of the overhead induced by quantum compilation for distributed quantum computing. The derived bound accounts for the overhead induced by the underlying computing architecture as well as the additional overhead induced by the sub-optimal quantum compiler.
  arXiv  Detail & Related papers  (2020-12-17T15:48:32Z)

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.