Hamiltonians¶
The divi.hamiltonians module provides Hamiltonian construction,
QUBO-to-Ising conversion, trotterization strategies, and encoding utilities.
Cost-function domain logic: PennyLane Hamiltonian ops, Trotterization, binary-polynomial normalization + evaluation, and QUBO/HUBO-to-Ising conversion.
Functions¶
|
Bit-driver Hamiltonian |
|
Convert a PennyLane operator, |
|
Bit-flip mixer over |
|
Pre-extract polynomial terms into Numba-friendly CSR-style arrays. |
|
Edge-driver Hamiltonian rewarding edges whose endpoints match |
Convert HUBO input to a dimod BinaryPolynomial with BINARY vartype. |
|
|
Normalize QUBO/HUBO input into canonical binary-polynomial representation. |
Convert supported QUBO inputs to a binary polynomial. |
|
|
Convert a QUBO/HUBO to a cleaned Ising Hamiltonian. |
|
Convert supported QUBO inputs to a square matrix. |
|
Convert a QUBO/HUBO directly to its cost-Hamiltonian |
|
Return the standard QAOA X mixer |
|
Return the XY mixer |
Classes¶
|
Canonical internal representation for binary polynomial optimization problems. |
|
Protocol for pluggable binary-to-Ising converters. |
|
Exact Trotterization strategy. |
|
Result of converting a binary polynomial problem to an Ising Hamiltonian. |
|
Result of converting a QUBO/HUBO to a cleaned Ising Hamiltonian. |
|
Convert binary polynomials to Ising operators by exact substitution x=(1-Z)/2. |
|
|
|
Convert binary polynomials to Ising operators via quadratization to QUBO/BQM. |
|
Trotterization strategy protocol. |
Variables¶
Built-in immutable sequence. |
|
Represent a PEP 604 union type |
|
Built-in immutable sequence. |
|
Represent a PEP 604 union type |