Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits

Robert Wille, Oliver Keszocze, Marcel Walter, Patrick Rohrs, Anupam Chattopadhyay, Rolf Drechsler

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

107 Scopus citations

Abstract

Ensuring nearest neighbor compliance of quantum circuits by inserting SWAP gates has heavily been considered in the past. Here, quantum gates are considered which work on non-adjacent qubits. SWAP gates are applied in order to move these qubits onto adjacent positions. However, a decision how exactly the SWAPs are moved has mainly been made without considering the effect a movement of qubits may have on the remaining circuit. In this work, we propose a methodology for nearest neighbor optimization which addresses this problem by means of a look-ahead scheme. To this end, two representative implementations are presented and discussed in detail. Experimental evaluations show that, in the best case, reductions in the number of SWAP gates of 56% (compared to the state-of-the-art methods) can be achieved following the proposed methodology.

Original languageEnglish
Title of host publication2016 21st Asia and South Pacific Design Automation Conference, ASP-DAC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages292-297
Number of pages6
ISBN (Electronic)9781467395694
DOIs
StatePublished - 7 Mar 2016
Externally publishedYes
Event21st Asia and South Pacific Design Automation Conference, ASP-DAC 2016 - Macao, Macao
Duration: 25 Jan 201628 Jan 2016

Publication series

NameProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
Volume25-28-January-2016

Conference

Conference21st Asia and South Pacific Design Automation Conference, ASP-DAC 2016
Country/TerritoryMacao
CityMacao
Period25/01/1628/01/16

Fingerprint

Dive into the research topics of 'Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits'. Together they form a unique fingerprint.

Cite this