2016
DOI: 10.1016/j.eswa.2016.04.038
|View full text |Cite
|
Sign up to set email alerts
|

Harmony-search algorithm for 2D nearest neighbor quantum circuits realization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
24
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 47 publications
(24 citation statements)
references
References 35 publications
0
24
0
Order By: Relevance
“…The local ordering of qubits, that is, the insertion of swap gates described here is inspired by the recent works like [28, 29]. We use a window for determining good swap order (SO), but with weight assignment, which is an alternative to an unweighted window of circuit tail gates.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The local ordering of qubits, that is, the insertion of swap gates described here is inspired by the recent works like [28, 29]. We use a window for determining good swap order (SO), but with weight assignment, which is an alternative to an unweighted window of circuit tail gates.…”
Section: Methodsmentioning
confidence: 99%
“…The authors also performed experiments on different window sizes, where window defines the number of gates to be considered in circuit tail after the current gate, for cost evaluation. Alfailakawi et al [29] proposed a meta harmony‐search‐based heuristic algorithm to obtain the initial placement, and a problem‐specific local heuristic search to swap qubits. The algorithm was used for 2D architecture and reported improvement over the previous works.…”
Section: Related Workmentioning
confidence: 99%
“…Despite significant research performed on quantum algorithms and their underlying physics, only a few studies have explored quantum circuit design flow. During recent years, some works have been performed on the quantum circuit physical design in one‐dimension nearest‐neighbor quantum architectures , and some others studied physical design of quantum circuits on two‐dimension nearest‐neighbor architectures . Because the focus of this paper is on the two‐dimension nearest‐neighbor architectures, the studies performed on these architectures are reviewed in this section.…”
Section: Related Workmentioning
confidence: 99%
“…To convert sub‐graphs to each other, we generated swap network. However, it was not clear how circuit partitioning into multiple instances was performed . This approach uses an XY technique for channel routing.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation