Suzuki¶
-
class
Suzuki
(reps=1, order=2)[source]¶ Bases:
qiskit.opflow.evolutions.trotterizations.trotterization_base.TrotterizationBase
Suzuki Trotter expansion, composing the evolution circuits of each Operator in the sum together by a recursive “bookends” strategy, repeating the whole composed circuit
reps
times.Detailed in https://arxiv.org/pdf/quant-ph/0508139.pdf.
- Parameters
reps (
int
) – The number of times to repeat the expansion circuit.order (
int
) – The order of the expansion to perform.
Methods Defined Here
Convert a
SummedOp
into aComposedOp
orCircuitOp
representing an approximation of e^-i*``op_sum``.Attributes
-
order
¶ returns order
- Return type
int
-
reps
¶ The number of repetitions to use in the Trotterization, improving the approximation accuracy.
- Return type
int