License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2019.5
URN: urn:nbn:de:0030-drops-103972
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10397/
Cowtan, Alexander ;
Dilkes, Silas ;
Duncan, Ross ;
Krajenbrink, Alexandre ;
Simmons, Will ;
Sivarajah, Seyon
On the Qubit Routing Problem
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|ket> 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.
BibTeX - Entry
@InProceedings{cowtan_et_al:LIPIcs:2019:10397,
author = {Alexander Cowtan and Silas Dilkes and Ross Duncan and Alexandre Krajenbrink and Will Simmons and Seyon Sivarajah},
title = {{On the Qubit Routing Problem}},
booktitle = {14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019)},
pages = {5:1--5:32},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-112-2},
ISSN = {1868-8969},
year = {2019},
volume = {135},
editor = {Wim van Dam and Laura Mancinska},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10397},
URN = {urn:nbn:de:0030-drops-103972},
doi = {10.4230/LIPIcs.TQC.2019.5},
annote = {Keywords: Quantum Computing, Qubit routing, Compilation}
}
Keywords: |
|
Quantum Computing, Qubit routing, Compilation |
Collection: |
|
14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019) |
Issue Date: |
|
2019 |
Date of publication: |
|
31.05.2019 |