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.
@article{arxiv.1902.08091,
title = {On the qubit routing problem},
author = {Alexander Cowtan and Silas Dilkes and Ross Duncan and Alexandre Krajenbrink and Will Simmons and Seyon Sivarajah},
journal= {arXiv preprint arXiv:1902.08091},
year = {2019}
}
Comments
v2: wrong chart replaced with correct version; minor edits for clarity