Qiskit / qiskit
88%
main: 88%

LAST BUILD BRANCH: patch-1
DEFAULT BRANCH: main
Repo Added
Files 870
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-13649-2270951e51232b2893899d1d8fd9b34cf4c5e113
branch: gh-readonly-queue/main/pr-13649-2270951e51232b2893899d1d8fd9b34cf4c5e113
CHANGE BRANCH
x

coverage: 87.938% (+0.009%) from 87.929%
14662699986

push

github

web-flow 
Improve 2q block collection via 1q quaternion-based collection (#13649)

* Add versor-based representation of 1q gates

1q gates are members of the group U(2), which we can represent as a
scalar phase term and a member of SU(2).  The members of SU(2) can be
represented by versors (also called unit quaternions, but I got tired of
typing that all the time...).

This adds a representation of versors and the group action to the Rust
code, and ways to convert from matrix-based forms to the them.

This commit introduces `nalgebra` as a dependency, to use its
quaternion logic.  This is a relatively heavy dependency, especially for
something as simple as quaternions, but some of this is in anticipation
of moving more matrix code to the static matrices of `nalgebra`, rather
than the too-dynamic-for-our-needs ones of `ndarray`; `faer` also offers
static matrices, but its APIs continue to heavily fluctuate between
versions, and it requires ever higher MSRVs.

* Use quaternions in 1q block collection

Switch the inner algorithm of `ConsolidateBlocks` to use the quaternion
form for single-qubit matrix multiplications.  This offered a few
percentage-points speedup for the block collection for typical
`rz-sx-rz-sx-rz`-type runs in quantum-volume-like collections.

* Avoid unnecessary allocations in qargs lookup

Switch the lookup logic for the qargs in the block collector to
determine the qargs ordering without additional heap allocations.  This
offers another modest (~4%) improvement in collection performance for
large runs.

* Avoid allocations in simple matrix operations

Producing the Kronecker product of the two single-qubit matrices from
the versor representation is trivially calculable, and can be written
into an existing allocation.  Similarly, switching the qubit order of a
2q matrix involves only six swaps, and does not need to allocate a new
matrix if one is already available.

There are lots of places remaining in this code where more matrix
allocations ... (continued)

261 of 315 new or added lines in 3 files covered. (82.86%)

2 existing lines in 2 files now uncovered.

74375 of 84577 relevant lines covered (87.94%)

433593.1 hits per line

Relevant lines Covered
84577 RELEVANT LINES 74375 COVERED LINES
433593.1 HITS PER LINE
Source Files on gh-readonly-queue/main/pr-13649-2270951e51232b2893899d1d8fd9b34cf4c5e113

Recent builds

Builds Branch Commit Type Ran Committer Via Coverage
14662699986 gh-readonly-queue/main/pr-13649-2270951e51232b2893899d1d8fd9b34cf4c5e113 Improve 2q block collection via 1q quaternion-based collection (#13649) * Add versor-based representation of 1q gates 1q gates are members of the group U(2), which we can represent as a scalar phase term and a member of SU(2). The members of SU... push web-flow github
87.94
See All Builds (13883)