Skip to main content

View on GitHub

Open this notebook in GitHub to run it yourself
The Bitwise Or (denoted as ’|’) is implemented by applying the following truth table between each pair of qubits (or qubit and bit) in variables A and B. 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 variable size mismatch. For example, the positive signed number (110)2=6(110)_2=6 is expressed as (00110)2(00110)_2 when operating with a five-qubit variable. Similarly, the negative signed number (110)2=2(110)_2=-2 is expressed as (11110)2(11110)_2. Examples: 5 | 3 = 7 since 101 | 011 = 111 5 | -3 = -3 since 0101 | 1101 = 1101 -5 | -3 = -1 since 1011 | 1101 = 1111

Examples

Example 1: Two Quantum Variables

This example generates a quantum program that performs bitwise ‘or’ between two variables. The left arg is a signed with five qubits and the right arg is unsigned with three qubits.
Output:

Example 2: Integer and Quantum Variable

This example generates a quantum program that performs a bitwise ‘or’ between a quantum variable and an integer. The left arg is an integer equal to three and the right arg is an unsigned quantum variable with three qubits.
Output: