On the qubit routing problem

Alexander Cowtan, Silas Dilkes, Ross Duncan, Alexandre Krajenbrink, Will Simmons, Seyon Sivarajah

Research output: Contribution to journalArticle

8 Citations (Scopus)
90 Downloads (Pure)

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 t|keti 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.

Original languageEnglish
Article number5
Number of pages32
JournalLeibniz International Proceedings in Informatics (LIPIcs)
Volume135
DOIs
Publication statusPublished - 1 May 2019
Event14th Conference on the theory of Quantum Computation, Communication and Cryptography - University of Maryland, Maryland, United States
Duration: 3 Jun 20197 Jun 2019

Keywords

  • computer system organisation
  • quantum computing
  • qubit routing
  • compiling
  • retargetable compliers

Fingerprint Dive into the research topics of 'On the qubit routing problem'. Together they form a unique fingerprint.

  • Profiles

    No photo of Ross Duncan

    Ross Duncan

    Person: Academic, Research Only

    Cite this

    Cowtan, A., Dilkes, S., Duncan, R., Krajenbrink, A., Simmons, W., & Sivarajah, S. (2019). On the qubit routing problem. Leibniz International Proceedings in Informatics (LIPIcs), 135, [5]. https://doi.org/10.4230/LIPIcs.TQC.2019.5