Make the full op matrix from `ops`. Not very efficient, use only for debugging.

Make a vector of vectors of rows (with `(column, value)`) built from a function `f` which takes row numbers. natural_order indicates that the lowest i

Make a circuit object out of an arbitrary matrix Single Qubit matrix is organized as |0><0|, |0><1|, |1><0|, |1><1|

Negate all the qubits in a register where the mask bit == 0.

Build a new iterator using the row index, the number of qubits in the matrix, and the complex values of the matrix.

Build a new iterator using the number of qubits in each sub iterator, and the outputs of said iterators on a given row.

Construct a new error.

Make a new control matrix op

Make a new dense matrix op

Make a new sparse matrix op

Make a new swap matrix op

Returns the depth of the current circuit (pipeline).

Applies a quantum fourier transform to registers `r`.

Rotate around x.

Rotate around x by pi/m

Rotate around y.

Rotate around y by pi/m

Rotate around z by pi/m

Given the full matrix `row` and `col`, find the given op's row and column using the full `n`, the op's `nindices`, the op's `indices'.

Split a register into two, selecting the indices from the `indices` iterator.

A toffoli or generalized CNOT gate op.

Construct a register with multiple qubits. Fails if n=0.

Create and apply a Y gate circuit object.