-
Notifications
You must be signed in to change notification settings - Fork 368
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
Parallelize sampling measure #2049
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM. BitVector
looks very reasonable than reg_t
, indeed.
Just FYI. The reason why |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM
Summary
This PR optimizes performance of sampling measure #2021 by
Details and comments
This PR adds new basic class
BitVector
to store bit counts obtained by sampling measure.Bits counts were stored as array of 64-bits integer previously that wastes large memory space and memory bandwidth.
BitVector
has a variable length bit string that requires fewer memory.(
BitVector
can be used for stabilizer method, but not included in this PR)There were some loops not parallelized before:
are now parallelized by OpenMP.