Asynchronous Telegate and Teledata Protocols for Distributed Quantum Computing
Jacob Peckham, Dwight Makaroff, Steven Rayan
TL;DR
Distributed quantum operations such as telegate and teledata incur high latency from entangled-photon and classical information distribution. The authors propose asynchronous variants that allow local operations to proceed while the remote operation finishes, by introducing nonunitary operators $F$ and $G$ and a pre-measurement block; a potential hardware interface is illustrated with a Quantum Network Card (QNC). The paper discusses the benefits and limitations of asynchronous protocols, including conditions under which latency hiding is effective and the need for $U^{-1} Z U$ sequences when a conditional $Z$ is required. A concrete system-level example (QNC) shows how entanglement routing, storage qubits, and local computation can be organized to support asynchronous distributed quantum operations. Overall, the work outlines a path toward reducing classical-communication bottlenecks in distributed quantum computing and highlights engineering challenges for realizing asynchronous protocols.
Abstract
The cost of distributed quantum operations such as the telegate and teledata protocols is high due to latencies from distributing entangled photons and classical information. This paper proposes an extension to the telegate and teledata protocols to allow for asynchronous classical communication which hides the cost of distributed quantum operations. We then discuss the benefits and limitations of these asynchronous protocols and propose a potential way to improve these asynchronous protocols using nonunitary operators. Finally, a quantum network card is described as an example of how asynchronous quantum operations might be used.
