Enum MatrixOp 

pub enum MatrixOp<P> {
    Matrix(Vec<usize>, Vec<P>),
    SparseMatrix(Vec<usize>, Vec<Vec<(usize, P)>>),
    Swap(Vec<usize>, Vec<usize>),
    Control(Vec<usize>, Vec<usize>, Box<MatrixOp<P>>),
}

Ops which can be applied to quantum states.

Variants

Matrix(Vec<usize>, Vec<P>)

Indices, Matrix data

SparseMatrix(Vec<usize>, Vec<Vec<(usize, P)>>)

Indices, per row [(col, value)]

Swap(Vec<usize>, Vec<usize>)

A indices, B indices

Control(Vec<usize>, Vec<usize>, Box<MatrixOp<P>>)

Control indices, Op indices, Op

Implementations

impl<P> MatrixOp<P>

pub fn num_indices(&self) -> usize

Get the number of indices represented by op

pub fn new_matrix<Indx, Dat>(indices: Indx, data: Dat) -> Self

where Indx: Into<Vec<usize>>, Dat: Into<Vec<P>>,

Make a new dense matrix op

pub fn new_sparse<Indx, Dat>(indices: Indx, data: Dat) -> Self

where Indx: Into<Vec<usize>>, Dat: Into<Vec<Vec<(usize, P)>>>,

Make a new sparse matrix op

pub fn new_swap<IndxA, IndxB>(a: IndxA, b: IndxB) -> Self

where IndxA: Into<Vec<usize>>, IndxB: Into<Vec<usize>>,

Make a new swap matrix op

pub fn new_control<IndxA, IndxB>(c: IndxA, r: IndxB, op: MatrixOp<P>) -> Self

where IndxA: Into<Vec<usize>>, IndxB: Into<Vec<usize>>,

Make a new control matrix op

impl<P> MatrixOp<P>

where P: Clone + Zero + One + Mul,

pub fn sum_for_op_cols<T, F>(&self, nindices: usize, row: usize, f: F) -> T

where T: Sum, F: Fn((usize, P)) -> T,

The function f maps a column to a complex value (given the row) for the op matrix. Sums for all nonzero entries for a given op

Trait Implementations

impl<P: Clone> Clone for MatrixOp<P>

fn clone(&self) -> MatrixOp<P>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<P> Debug for MatrixOp<P>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.