2020
DOI: 10.1109/tcad.2020.2970594
|View full text |Cite
|
Sign up to set email alerts
|

A Dynamic Look-Ahead Heuristic for the Qubit Mapping Problem of NISQ Computers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
21
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 29 publications
(23 citation statements)
references
References 24 publications
0
21
0
Order By: Relevance
“…It provides a good initial mapping method and a mapping transition algorithm. Another algorithm dynamic lookahead (DL) [34] based on SABRE shows an improvement in terms of number of additional gates. Moreover, the mapping method presented in [19] uses the hardware calibration data to try to find a good mapping.…”
Section: A Methodologymentioning
confidence: 99%
See 2 more Smart Citations
“…It provides a good initial mapping method and a mapping transition algorithm. Another algorithm dynamic lookahead (DL) [34] based on SABRE shows an improvement in terms of number of additional gates. Moreover, the mapping method presented in [19] uses the hardware calibration data to try to find a good mapping.…”
Section: A Methodologymentioning
confidence: 99%
“…Most of the previous works [23]- [27] using the second method only adapt for nearest-neighbor connectivity and cannot be directly applicable to actual quantum architectures with nonuniform connections. Recently, publications [14], [28]- [34] that are not restricted to a specific architecture have been released. The algorithm presented in [28] uses a heuristic to find the best permutation at each step of the mapping procedure.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Most of the previous works [2,26,34,37,42] using the second method only adapt for nearest-neighbour connectivity and cannot be directly applicable to actual quantum architectures with nonuniform connections. Recently, publications [10,19,23,29,38,[44][45][46] that are not restricted to a specific architecture have been released. The algorithm presented in [46] uses a heuristic to find the best permutation at each step of the mapping procedure.…”
Section: Introductionmentioning
confidence: 99%
“…A major improvement has been shown by [29] which uses a "forwardbackward-forward" mapping algorithm. Moreover, the "look-ahead" strategy has been introduced in the heuristic cost function for further optimisation in some existing works, notably [23,29,[44][45][46]. For qubit movement, most of these methods only use SWAP gate.…”
Section: Introductionmentioning
confidence: 99%