trotterize(first_pauli_term, second_pauli_term, trotter_order=1, trotter_steps=1)¶
Create a Quil program that approximates exp( (A + B)t) where A and B are PauliTerm operators.
PauliTerm) – PauliTerm denoted A
PauliTerm) – PauliTerm denoted B
int) – Optional argument indicating the Suzuki-Trotter approximation order–only accepts orders 1, 2, 3, 4.
int) – Optional argument indicating the number of products to decompose the exponential into.
- Return type