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

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 decisio...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the ASP-DAC ... Asia and South Pacific Design Automation Conference pp. 292 - 297
Main Authors: Wille, Robert, Keszocze, Oliver, Walter, Marcel, Rohrs, Patrick, Chattopadhyay, Anupam, Drechsler, Rolf
Format: Conference Proceeding Journal Article
Language:English
Published: IEEE 01.01.2016
Subjects:
Circuits
Computer architecture
Conferences
Design engineering
Fault tolerance
Fault tolerant systems
Gates (circuits)
Integrated circuits
Logic gates
Methodology
Optimization
Quantum computing
Qubits (quantum computing)
State of the art
ISSN:2153-697X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:2153-697X
DOI:10.1109/ASPDAC.2016.7428026