mlsanityData to 7 Oct 2026

On the qubit routing problem

arXiv 1902.08091 ↗First posted 21 Feb 2019quant-ph cs.DS cs.PLcited by 11

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Feb 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 2; 2025: 2; 2026: 2.

11 papers.