Classes | |
| class | Gate |
| Single- and multi-qubit gate of varying complexity. More... | |
| class | Qubit |
| class | Vector |
| Dynamic size vector of complex numbers. More... | |
Typedefs | |
| typedef double | fptype |
| typedef std::complex< fptype > | field |
| typedef Eigen::Matrix< field, Eigen::Dynamic, 1 > | VectorXc |
| typedef Eigen::Matrix< field, Eigen::Dynamic, Eigen::Dynamic > | MatrixXc |
Functions | |
| bool | is_zero (const fptype x) |
Checks if x is approximately zero. | |
| bool | is_one (const fptype x) |
Checks if x is approximately one. | |
| int | log2 (const unsigned value) |
Computes the binary logarithm of the integer value. | |
| int | bwise_bin_dot (const long x, const long y) |
Computes the modulo-2 sum of the products of corresponding bits of the integers x and y. | |
Variables | |
| const double | c_pi |
| const double | c_sqrt1_2 |
| typedef double QuCoSi::fptype |
| typedef std::complex<fptype> QuCoSi::field |
| typedef Eigen::Matrix<field, Eigen::Dynamic, 1> QuCoSi::VectorXc |
| typedef Eigen::Matrix<field, Eigen::Dynamic, Eigen::Dynamic> QuCoSi::MatrixXc |
| bool QuCoSi::is_zero | ( | const fptype | x | ) | [inline] |
| bool QuCoSi::is_one | ( | const fptype | x | ) | [inline] |
| int QuCoSi::log2 | ( | const unsigned | value | ) | [inline] |
| int QuCoSi::bwise_bin_dot | ( | const long | x, | |
| const long | y | |||
| ) | [inline] |
Computes the modulo-2 sum of the products of corresponding bits of the integers x and y.
Let x and y be positive integers and 
are the bits of x and y in the binary numeral system (that is 
), then this function computes the modulo-2 sum of the products of corresponding bits of x and y denoted by 
:
![\[ x \cdot y = \bigoplus_{i=0}^n x_i \, y_i = x_0 \, y_0 \oplus x_1 \, y_1 \oplus \ldots \oplus x_n \, y_n \ . \]](form_3.png)
Here is the caller graph for this function:
x and y | const double QuCoSi::c_pi |
| const double QuCoSi::c_sqrt1_2 |
1.7.1