Skip to main content

View on GitHub

Open this notebook in GitHub to run it yourself
The multiplication operation, denoted '*', is a series of additions (“long multiplication”). The multiplier has different implementations, depending on the type of adder in use. Note that integer and fixed-point numbers are represented in a two-complement method during function evaluation. The binary number is extended in the case of a register size mismatch. For example, the positive signed number (110)2=6(110)_2=6 is expressed as (00110)2(00110)_2 when working with a five-qubit register. Similarly, the negative signed number (110)2=2(110)_2=-2 is expressed as (11110)2(11110)_2.

Examples

The calculation of -5 * 3 = - 1
  1. The left arg -5 is represented as 1011 and 3 as
1
  1. The number of digits needed to store the answer is 4+2-1 =
  2. The multiplication is done in the ‘regular’ manner where each number is extended to five bits and only five digits are kept in the intermediary results.
×11011×00011×11011×10119×10001\begin{array}{c} \phantom{\times}11011\\ \underline{\times\phantom{000}11}\\ \phantom{\times}11011\\ \underline{\phantom\times1011\phantom9}\\ \phantom\times10001 \end{array}

Examples

Example 1: Two Quantum Variables Multiplication

This code example generates a quantum program that multiplies two arguments. Both of them are defined as quantum variables of size
Output:

Example 2: Float and Quantum Variable Multiplication

This code example generates a quantum program that multiplies two arguments. Here, the left argument is a fixed-point number (11.1)2(11.1)_2 (3.5), and the right argument is a quantum variable of size
Output: