Structs

  • Iterator which provides the indices of nonzero columns for a given row of a COp
  • Iterator which provides the indices of nonzero columns for a given function.
  • Iterator which provides the indices of nonzero columns for a given row of a matrix
  • Iterator which provides the indices of nonzero columns for a given row for a collection of ops.
  • Iterator which provides the indices of nonzero columns for a given row of a sparse matrix
  • Iterator which provides the indices of nonzero columns for a given row of a SwapOp

Enums

  • Ops which can be applied to quantum states.

Functions

  • Apply function f to the iterator for op, return result.
  • Fold across rows hitting nonzero columns.
  • Get the number of indices represented by op
  • Using the function f which maps from a column and row to a complex value for the op matrix, sums for all nonzero entries for a given op more efficiently than trying each column between 0 and 2^nindices. This really needs to be cleaned up, but runs in a tight loop. This makes it hard since Box is unfeasible and the iterator types aren’t the same size.
  • Like sum_for_op_cols but takes multiple ops at once.