Quantum Computing for Everyone (The MIT Press)

by Chris Bernhardt

The argument continued by showing that any boolean function could be constructed using combinations of not and and. Consequently, we can construct a circuit that computes any boolean function using just NOT and AND gates.