Sequential Quantum Gate Decomposer  v1.9.3
Powerful decomposition of general unitarias into one- and two-qubit gates gates
List of all members | Public Attributes
row_indices Struct Reference

Structure containing row limits for the partitioning of the matrix product calculations. More...

#include <dot.h>

Public Attributes

int Arows
 The number of rows in matrix A participating in the multiplication sub-problem. More...
 
int Arows_end
 The last row in matrix A participating in the multiplication sub-problem. (The rows are picked from a closed-open range [Arows_start, Arows_end) ) More...
 
int Arows_start
 The firs row in matrix A participating in the multiplication sub-problem. More...
 
int Brows
 The number of rows in matrix B participating in the multiplication sub-problem. More...
 
int Brows_end
 The last row in matrix B participating in the multiplication sub-problem. (The rows are picked from a closed-open range [Brows_start, Brows_end) ) More...
 
int Brows_start
 The firs row in matrix B participating in the multiplication sub-problem. More...
 
int Crows
 The number of rows in matrix C participating in the multiplication sub-problem. More...
 
int Crows_end
 The last row in matrix C participating in the multiplication sub-problem. (The rows are picked from a closed-open range [Crows_start, Crows_end) ) More...
 
int Crows_start
 The firs row in matrix C participating in the multiplication sub-problem. More...
 

Detailed Description

Structure containing row limits for the partitioning of the matrix product calculations.

(the partitioning follows the divide-and-conquer strategy)

Definition at line 94 of file dot.h.

Member Data Documentation

◆ Arows

int row_indices::Arows

The number of rows in matrix A participating in the multiplication sub-problem.

Definition at line 101 of file dot.h.

◆ Arows_end

int row_indices::Arows_end

The last row in matrix A participating in the multiplication sub-problem. (The rows are picked from a closed-open range [Arows_start, Arows_end) )

Definition at line 99 of file dot.h.

◆ Arows_start

int row_indices::Arows_start

The firs row in matrix A participating in the multiplication sub-problem.

Definition at line 97 of file dot.h.

◆ Brows

int row_indices::Brows

The number of rows in matrix B participating in the multiplication sub-problem.

Definition at line 107 of file dot.h.

◆ Brows_end

int row_indices::Brows_end

The last row in matrix B participating in the multiplication sub-problem. (The rows are picked from a closed-open range [Brows_start, Brows_end) )

Definition at line 105 of file dot.h.

◆ Brows_start

int row_indices::Brows_start

The firs row in matrix B participating in the multiplication sub-problem.

Definition at line 103 of file dot.h.

◆ Crows

int row_indices::Crows

The number of rows in matrix C participating in the multiplication sub-problem.

Definition at line 113 of file dot.h.

◆ Crows_end

int row_indices::Crows_end

The last row in matrix C participating in the multiplication sub-problem. (The rows are picked from a closed-open range [Crows_start, Crows_end) )

Definition at line 111 of file dot.h.

◆ Crows_start

int row_indices::Crows_start

The firs row in matrix C participating in the multiplication sub-problem.

Definition at line 109 of file dot.h.


The documentation for this struct was generated from the following file: