An Evolution algorithm replacing exponentiated sums of Paulis by changing them each to the Z basis, rotating with an rZ, changing back, and trotterizing.
More specifically, we compute basis change circuits for each Pauli into a single-qubit Z, evolve the Z by the desired evolution time with an rZ gate, and change the basis back using the adjoint of the original basis change circuit. For sums of Paulis, the individual Pauli evolution circuits are composed together by Trotterization scheme.
None]) – A string (“trotter”, “suzuki”, or “qdrift”) to pass to the TrotterizationFactory, or a TrotterizationBase, indicating how to combine individual Pauli evolution circuits to equal the exponentiation of the Pauli sum.
int]) – How many Trotterization repetitions to make, to improve the approximation accuracy.
TODO uncomment when we implement Abelian grouped evolution. (#) –
group_paulis (#) – Whether to group Pauli sums into Abelian
sub-groups (#) –
a single diagonalization circuit can be used for each group (so) –
rather than each Pauli. (#) –
Traverse the operator, replacing
CircuitOpscontaining trotterized evolutions equalling the exponentiation of -i * operator.
Evolution for abelian pauli sum
Compute evolution Operator for a single Pauli using a
TrotterizationBase used to evolve SummedOps.
- Type renvoyé