Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Make heuristic score sorting robust in 1q optimization pass #9239

Closed
wants to merge 1 commit into from
Closed

Make heuristic score sorting robust in 1q optimization pass #9239

wants to merge 1 commit into from

Commits on Dec 2, 2022

  1. Make heuristic score sorting robust in 1q optimization pass 

    In Qiskit#8197 the Optimize1qGatesDecomposition was updated to be target aware
and as part of that a new heuristic scoring was added to determine which
decomposition was the best performing and should be used. However, in
the case of an error rate of 0.0 the desired behavior was to pick the
decomposition which was shortest. In Qiskit#8197 this was accomplished by just
doing `-100 + len(decomposition)` which worked in the general case as
long as the gate counts are < 100 (which in practice will always be the
case). For robustness this changes the return for the scoring function
to be `(error_rate, sequence_length)` to give us the sorting without
changing the measured error rate.
    @mtreinish
    mtreinish committed Dec 2, 2022
    Configuration menu
    Copy the full SHA
    16db4aa View commit details
    Browse the repository at this point in the history