|View source on GitHub|
Represents Boolean functions as a series of CNOT and rotation gates. The Boolean functions are
passed as Sympy expressions and then turned into an optimized set of gates.
 On the representation of Boolean and real functions as Hamiltonians for quantum computing by Stuart Hadfield, https://arxiv.org/pdf/1804.09130.pdf  https://www.youtube.com/watch?v=AOKM9BkweVU is a useful intro  https://github.com/rsln-s/IEEE_QW_2020/blob/master/Slides.pdf  Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas by Jonathan Welch, Daniel Greenbaum, Sarah Mostame, and Alán Aspuru-Guzik, https://arxiv.org/abs/1306.3991
class BooleanHamiltonian: An operation that represents a Hamiltonian from a set of Boolean functions.