9.2 Boolean operations and bit logic gates
As we saw in section 2.5, there is a direct correspondence between Booleans and
bits, equating True to 1 and False to 0. I first learned about
Booleans and their operations in a logic course in my college Philosophy department. [MOL] You can also take a mathematical approach and look at
Boolean algebra. Bits and circuits are fundamental to electrical engineering and computer
science. Perceived distinctions among these approaches can be misleading because we talk about
the same ideas using different words.
In this section, I work with bits and use their associated gate language.
I cover logic gates and circuits in Chapter 2 of Dancing with Qubits. [DWQ]
9.2.1 1-bit gates
The simplest 1-bit gate is id, which leaves each of 0 and 1 alone. It is the identity gate. A much more useful gate is not, which maps 0 to 1 and 1 to 0.
...
