Compiling Permutations for Superconducting QPUs

In this paper we consider the compilation of quantum state permutations into quantum gates for physical quantum computers. A sequence of generic single-target gates, which realize the input permutation, are extracted using a decomposition based reversible logic synthesis algorithm. We present a compilation algorithm that translates single-target gates into a quantum circuit composed of the elementary quantum gate sets that are supported by IBM's 5-qubit and 16-qubit, and Rigetti's 8-qubit and 19-qubit superconducting transmon QPUs. Compared to generic state-of-the-art compilation techniques, our technique improves gate volume and gate depth by up to 59% and 53%, respectively.


Published in:
2019 Design, Automation & Test In Europe Conference & Exhibition (Date), 1349-1354
Presented at:
Design, Automation & Test in Europe Conference & Exhibition (DATE), Florence, ITALY, Mar 25-29, 2019
Year:
Jan 01 2019
Publisher:
New York, IEEE
ISSN:
1530-1591
ISBN:
978-3-9819263-2-3
Laboratories:




 Record created 2019-06-24, last modified 2019-08-30


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)