Available Algorithms

All available algorithms share a common interface. Each algorithm can be initialized with the desired number_trotter_steps, order (i.e. the order of the trotterization), and the decomposition_blocks boolean flag. When decomposition_blocks is set to True, the circuit resulting from each term in the Hamiltonian is wrapped with PragmaStartDecompositionBlock and PragmaStopDecompositionBlock operations, which are needed for noise mapping.

Once an instance of the desired algorithm is initialized, a circuit can be constructed with the create_circuit method, by passing as inputs the Hamiltonian for the time evolution, and the time parameter. See the Examples section for more details.

Every available algoritm is designed with a specific device connectivity in mind. In order to run a circuit on a device with a particular connectivity graph, additional routing or transpilation steps might be necessary.