On the qubit routing problem

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

13 Citations (Scopus)
96 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
Title of host publication14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019)
EditorsWim van Dam, Laura Mancinska
Place of PublicationDagstuhl, Germany
Pages5:1--5:32
Number of pages32
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

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
ISSN (Print)1868-8969

Conference

Conference14th Conference on the theory of Quantum Computation, Communication and Cryptography
Abbreviated titleTQC 2019
Country/TerritoryUnited States
CityMaryland
Period3/06/197/06/19

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.

Cite this