Efficient implementation of Quantum circuits with limited qubit interactions

TL;DR

This paper presents an efficient method for compiling quantum circuits on hardware with limited qubit interactions, using a specific interaction graph to minimize overhead.

Contribution

It introduces a novel interaction graph and compilation technique that reduces the overhead of implementing quantum circuits with limited qubit interactions.

Findings

Interaction graph where each qubit interacts with 4 others

Implementation overhead of 6 log n for any n-qubit circuit

Network of quantum nodes emulates a monolithic device efficiently

Abstract

The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum circuits so that gates are applied only locally. The graph requires each qubit to interact with 4 other qubits and yet the time-overhead for implementing any n-qubit quantum circuit is 6 log n. Building a network of quantum computing nodes according to this graph enables the network to emulate a single monolithic device with minimal overhead.