Architectures and efficient algorithms on the distributed neutral atom platforms
POSTER
Abstract
Although promising quantum algorithms like Shor’s algorithm and quantum simulations only require more than one thousand “perfect” logical qubits, the propensity of errors in quantum systems requires the use of quantum error correction (QEC), which leads to more than one million physical qubits. The transformation from current 10000 qubits to millions of qubits is expected to be accompanied by the distributed quantum computation, where the quantum algorithm is distributed to inter-connected modules. However, it is generally assumed that the quantum interconnects between the modules will not perform as well in terms of rate and/or fidelity as intra-module operations. Hence, special architectures and compilations are required to handle the inter-module latency/infidelity. In this poster, we design the architecture of distributed quantum computers on the neutral atom platform and invent new compilations for both Shor's algorithm and quantum simulation of molecules based on this architecture. Our compilations reduce the required amount of inter-module connection and hide the inter-module latency behind the intra-module operations. We found a "free" distribution on both Shor"s algorithm and quantum simulation, and we expect our compilations to shed light on the future of distributed quantum computation.
Presenters
-
Tian Xue
- University of Illinois at Urbana-Champaign