Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies

TL;DR

This paper introduces an ILP-based method to optimize quantum circuit placement for arbitrary topologies, minimizing depth while ensuring nearest neighbor interactions, crucial for scalable quantum computing.

Contribution

It presents the first ILP formulation for depth-optimized quantum circuit placement on arbitrary topologies, extending beyond linear arrangements.

Findings

Effective ILP formulation for arbitrary topologies

Achieves minimal logical depth in quantum circuits

Applicable to diverse network topologies and benchmarks

Abstract

A significant hurdle towards realization of practical and scalable quantum computing is to protect the quantum states from inherent noises during the computation. In physical implementation of quantum circuits, a long-distance interaction between two qubits is undesirable since, it can be interpreted as a noise. Therefore, multiple quantum technologies and quantum error correcting codes strongly require the interacting qubits to be arranged in a nearest neighbor (NN) fashion. The current literature on converting a given quantum circuit to an NN-arranged one mainly considered chained qubit topologies or Linear Nearest Neighbor (LNN) topology. However, practical quantum circuit realizations, such as Nuclear Magnetic Resonance (NMR), may not have an LNN topology. To address this gap, we consider an arbitrary qubit topology. We present an Integer Linear Programming (ILP) formulation for achieving minimal logical depth while guaranteeing the nearest neighbor arrangement between the interacting qubits. We substantiate our claim with studies on diverse network topologies and prominent quantum circuit benchmarks.