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.

References:

[1] On the representation of Boolean and real functions as Hamiltonians for quantum computing by Stuart Hadfield, https://arxiv.org/pdf/1804.09130.pdf [2] https://www.youtube.com/watch?v=AOKM9BkweVU is a useful intro [3] https://github.com/rsln-s/IEEE_QW_2020/blob/master/Slides.pdf [4] 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

Classes

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

[{ "type": "thumb-down", "id": "missingTheInformationINeed", "label":"Missing the information I need" },{ "type": "thumb-down", "id": "tooComplicatedTooManySteps", "label":"Too complicated / too many steps" },{ "type": "thumb-down", "id": "outOfDate", "label":"Out of date" },{ "type": "thumb-down", "id": "samplesCodeIssue", "label":"Samples / code issue" },{ "type": "thumb-down", "id": "otherDown", "label":"Other" }]
[{ "type": "thumb-up", "id": "easyToUnderstand", "label":"Easy to understand" },{ "type": "thumb-up", "id": "solvedMyProblem", "label":"Solved my problem" },{ "type": "thumb-up", "id": "otherUp", "label":"Other" }]