• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

Qiskit / qiskit / 9003801577
90%
main: 88%

Build:
Build:
LAST BUILD BRANCH: substitute_pi4_rotations
DEFAULT BRANCH: main
Ran 08 May 2024 03:00PM UTC
Jobs 1
Files 832
Run time 3min
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

08 May 2024 02:42PM UTC coverage: 89.656% (+0.01%) from 89.643%
9003801577

push

github

web-flow
Add new method for single bitstring target when measuring stabilizerstate probabilities_dict (#12147)

* added new method, deterministic helper unction

added new method probabilities_dict_from_bitstrings, moved logic from probabilities_dict to probabilities_dict_from_bitstrings with ability to pass target, probabilities_dict will pass a target of None.

* Adding test timing, fixed algorithm for determining if should get probability for qubit

Added some timing of the tests to determine if the version with a specfic target runs faster then the non-targetted version (which must calculate all 2^n possibilities for stabilizer state test_probablities_dict_single_qubit. When given a target it can skip branches that were not wanting to be calculated

* Adding more tests, fixing deterministic issues with bad target

* Prob of targets with 0.0 probability

* target calc changes

* Simpler way to get all targets

* Need to improve performance with multiple targets

* Simplified the probabilities_dict_from_bitstrings method

simplified the method probabilities_dict_from_bitstrings, less checking was needed, simpler handling of no target value passed in

* Adding tests for targets

* Added tests to test_probablities_dict_qubits

* Add performance boost check when using targets for test_probablities_dict_qubits

* Added Caching to prevent duplicate branch calculations

In stabilizerstate, added the ability to cache previously calculated branches so they do not get recalculated when attempting to get target values, gives a better starting point to calculate from instead of starting from an unknown probability value of 1.0

* improve performance by performing expensive operations only when needed

when creating an array for the outcome in probability, it is only built if the cache key is not found

* Optimization for caching, deterministic calcs for branches, enabling/disabling cache

added more optimization for performance when performing calculations for branches... (continued)

29 of 29 new or added lines in 1 file covered. (100.0%)

1 existing line in 1 file now uncovered.

62214 of 69392 relevant lines covered (89.66%)

228729.15 hits per line

Uncovered Existing Lines

Lines Coverage ∆ File
1
93.38
1.78% crates/qasm2/src/lex.rs
Jobs
ID Job ID Ran Files Coverage
1 9003801577.1 08 May 2024 03:00PM UTC 832
89.66
GitHub Action Run
Source Files on build 9003801577
  • Tree
  • List 832
  • Changed 32
  • Source Changed 0
  • Coverage Changed 4
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Repo
  • 87c14cb2 on github
  • Prev Build on gh-readonly-queue/main/pr-12368-8b94fc36df05a9f5b2150e7a8ac1c36dca3286d1 (#9001766272)
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc