# On the qubit routing problem

## TL;DR

This paper presents a new architecture-agnostic method for mapping quantum circuits onto devices with limited qubit connectivity, improving efficiency by reducing two-qubit gate depth and count.

## Contribution

It introduces a novel methodology integrated into tket compiler for optimized qubit routing across various quantum hardware architectures.

## Key findings

- Reduces two-qubit gate depth significantly
- Decreases two-qubit gate count
- Effective across different hardware architectures

## Abstract

We introduce a new architecture-agnostic methodology for mapping abstract quantum circuits to realistic quantum computing devices with restricted qubit connectivity, as implemented by Cambridge Quantum Computing's tket compiler. We present empirical results showing the effectiveness of this method in terms of reducing two-qubit gate depth and two-qubit gate count, compared to other implementations.