Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity

TL;DR

This paper introduces a novel lightcone bound for quantum circuit mapping based on quantum uncomplexity, providing a new way to estimate minimal overhead in quantum hardware implementation.

Contribution

It presents a new lightcone bound derived from quantum uncomplexity and develops an initial placement algorithm, demonstrating its effectiveness through extensive benchmarking.

Findings

The lightcone bound outperforms brute-force and Qiskit in estimating minimal overhead.

The method is validated on over 600 realistic benchmarks.

First practical application of quantum circuit uncomplexity in quantum computing.

Abstract

Efficiently mapping quantum circuits onto hardware is an integral part of the quantum compilation process, wherein a circuit is modified in accordance with the stringent architectural demands of a quantum processor. Many techniques exist for solving the quantum circuit mapping problem, in addition to several theoretical perspectives that relate quantum circuit mapping to problems in classical computer science. This work considers a novel perspective on quantum circuit mapping, in which the routing process of a simplified circuit is viewed as a composition of quantum operations acting on density matrices representing the quantum circuit and processor. Drawing on insight from recent advances in quantum circuit complexity and information geometry, we show that a minimal SWAP-gate count for executing a quantum circuit on a device emerges via the minimization of the distance between quantum states using the quantum Jensen-Shannon divergence, which we dub the lightcone bound. Additionally, we develop a novel initial placement algorithm based on a graph similarity search that selects the partition nearest to a graph isomorphism between interaction and coupling graphs. From these two ingredients, we construct an algorithm for calculating the lightcone bound, which is directly compared alongside the IBM Qiskit compiler for over $600$ realistic benchmark experiments, as well as against a brute-force method for smaller benchmarks. In our simulations, we unambiguously find that neither the brute-force method nor the Qiskit compiler surpasses our bound, signaling utility for estimating minimal overhead when realizing quantum algorithms on constrained quantum hardware. This work also constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing. We anticipate that this method may have diverse applicability outside of the scope of quantum information science.