ECDQC: Efficient Compilation for Distributed Quantum Computing with Linear Layout

TL;DR

This paper introduces an efficient compilation method for distributed quantum computing on linear architectures, optimizing circuit performance and scalability by exploiting topology symmetry and qubit management techniques.

Contribution

It presents a novel compilation approach that leverages linear topology symmetry and dangling qubits to reduce non-local interactions and improve efficiency in distributed quantum algorithms.

Findings

Significantly reduces compilation time and gate count.

Decreases circuit depth for large-scale quantum algorithms.

Enhances scalability and robustness of distributed quantum computing.

Abstract

In this paper, we propose an efficient compilation method for distributed quantum computing (DQC) using the Linear Nearest Neighbor (LNN) architecture. By exploiting the LNN topology's symmetry, we optimize quantum circuit compilation for High Local Connectivity, Sparse Full Connectivity (HLC-SFC) algorithms like Quantum Approximate Optimization Algorithm (QAOA) and Quantum Fourier Transform (QFT). We also utilize dangling qubits to minimize non-local interactions and reduce SWAP gates. Our approach significantly decreases compilation time, gate count, and circuit depth, improving scalability and robustness for large-scale quantum computations.