Qiskit / qiskit
88%
main: 88%

LAST BUILD BRANCH: gh-readonly-queue/main/pr-15094-96f5c08b3f54acfcc9552a34bf1bcc5402e07e7f
DEFAULT BRANCH: main
Repo Added
Files 868
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

LAST BUILD ON BRANCH gh-readonly-queue/main/pr-13411-fb7648e0bb875c4581433568005cedb9f5c5c2d1
branch: gh-readonly-queue/main/pr-13411-fb7648e0bb875c4581433568005cedb9f5c5c2d1
CHANGE BRANCH
x

coverage: 88.304% (-0.02%) from 88.32%
13288729037

push

github

web-flow 
Perform BarrierBeforeFinalMeasurements analysis in parallel (#13411)

* Use OnceLock instead of OnceCell

OnceLock is a thread-safe version of OnceCell that enables us to use
PackedInstruction from a threaded environment. There is some overhead
associated with this, primarily in memory as the OnceLock is a larger
type than a OnceCell. But the tradeoff is worth it to start leverage
multithreading for circuits.

Fixes #13219

* Update twirling too

* Perform BarrierBeforeFinalMeasurements analysis in paralle

With #13410 removing the non-threadsafe structure from our circuit
representation we're now able to read and iterate over a DAGCircuit from
multiple threads. This commit is the first small piece doing this, it
moves the analysis portion of the BarrierBeforeFinalMeasurements pass to
execure in parallel. The pass checks every node to ensure all it's
decendents are either a measure or a barrier before reaching the end of
the circuit. This commit iterates over all the nodes and does the check
in parallel.

* Remove allocation for node scan

* Refactor pass to optimize search and set parallel threshold

This commit updates the logic in the pass to simplify the search
algorithm and improve it's overall efficiency. Previously the pass would
search the entire dag for all barrier and measurements and then did a
BFS from each found node to check that all descendants are either
barriers or measurements. Then with the set of nodes matching that
condition a full topological sort of the dag was run, then the
topologically ordered nodes were filtered for the matching set. That
sorted set is then used for filtering

This commit refactors this to do a reverse search from the output
nodes which reduces the complexity of the algorithm. This new algorithm
is also conducive for parallel execution because it does a search
starting from each qubit's output node. Doing a test with a quantum
volume circuit from 10 to 1000 qubits which scales linearly in depth
and number of... (continued)

67 of 83 new or added lines in 2 files covered. (80.72%)

17 existing lines in 2 files now uncovered.

78893 of 89342 relevant lines covered (88.3%)

348923.74 hits per line

Relevant lines Covered
89342 RELEVANT LINES 78893 COVERED LINES
348923.74 HITS PER LINE
Source Files on gh-readonly-queue/main/pr-13411-fb7648e0bb875c4581433568005cedb9f5c5c2d1

Recent builds

Builds Branch Commit Type Ran Committer Via Coverage
13288729037 gh-readonly-queue/main/pr-13411-fb7648e0bb875c4581433568005cedb9f5c5c2d1 Perform BarrierBeforeFinalMeasurements analysis in parallel (#13411) * Use OnceLock instead of OnceCell OnceLock is a thread-safe version of OnceCell that enables us to use PackedInstruction from a threaded environment. There is some overhead as... push web-flow github
88.3
See All Builds (13861)