Use this file to discover all available pages before exploring further.
View on GitHub
Open this notebook in GitHub to run it yourself
The Bitwise And (denoted as ’&’) is implemented by applying this truth table between each pair of qubits in register A and B (or qubit and bit).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 is expressed as (00110)2 when operating with a five-qubit register.
Similarly, the negative signed number (110)2=−2 is expressed as (11110)2.Examples:5 & 3 = 1 since 101 & 011 = 0015 & -3 = 5 since 0101 & 1101 = 0101-5 & -3 = -7 since 1011 & 1101 = 1001
This example generates a quantum program that performs a bitwise ‘and’ between a quantum variable and an integer.The left arg is an integer equal to 3
and the right arg is an unsigned quantum variable with three qubits.
@qfuncdef main(a: Output[QNum], res: Output[QNum]) -> None: a |= 5 res |= 3 & aqmod = create_model(main)