Module: cirq.ops.boolean_hamiltonian

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.


[1] On the representation of Boolean and real functions as Hamiltonians for quantum computing by Stuart Hadfield, [2] is a useful intro [3] [4] Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas by Jonathan Welch, Daniel Greenbaum, Sarah Mostame, and Alán Aspuru-Guzik,


class BooleanHamiltonian: An operation that represents a Hamiltonian from a set of Boolean functions.