-
Notifications
You must be signed in to change notification settings - Fork 2.4k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
LookaheadSwap mapper hangs in some cases #2171
Comments
|
mtreinish
pushed a commit
to Qiskit/qiskit-metapackage
that referenced
this issue
Mar 13, 2020
The lookahead swap mapping passes timeout consistently and have generated no data (likely due to Qiskit/qiskit#2171 ) but cost roughly an hour of benchmarking runtime per terra commit. This commit disables these benchmarks while the problems are investigated.
jakelishman
pushed a commit
to jakelishman/qiskit-terra
that referenced
this issue
Aug 1, 2023
…it-metapackage#845) The lookahead swap mapping passes timeout consistently and have generated no data (likely due to Qiskit#2171 ) but cost roughly an hour of benchmarking runtime per terra commit. This commit disables these benchmarks while the problems are investigated.
jakelishman
pushed a commit
to jakelishman/qiskit-terra
that referenced
this issue
Aug 11, 2023
…it-metapackage#845) The lookahead swap mapping passes timeout consistently and have generated no data (likely due to Qiskit#2171 ) but cost roughly an hour of benchmarking runtime per terra commit. This commit disables these benchmarks while the problems are investigated.
SamD-1998
pushed a commit
to SamD-1998/qiskit-terra
that referenced
this issue
Sep 7, 2023
…it-metapackage#845) The lookahead swap mapping passes timeout consistently and have generated no data (likely due to Qiskit#2171 ) but cost roughly an hour of benchmarking runtime per terra commit. This commit disables these benchmarks while the problems are investigated.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
The
LookaheadSwap
mapper will, for some input circuits and coupling maps, loop infinitely while attempting to build a mapping.The lookahead algorithm can end up in an effective local minimum where 1) no depth-1 swaps lead to an improvement in score over the current layout, and 2) the swaps required to advance the circuit fall outside of the search width pruning (maybe depending on the order returned by
coupling.get_edges()
).The LookaheadSwap has no priority queue or backtracking mechanism beyond the size of search depth, so it will continue to examine the first set of swaps indefinitely. An iteration limit would be an easy way to likely detect and alert users to these cases. Alternately, the algorithm could choose to not prune in cases where there is no clear ranking of swaps, or randomly select a subset to consider further.
e.g.
The text was updated successfully, but these errors were encountered: