QDrift

class qiskit.synthesis.QDrift(reps=1, insert_barriers=False, cx_structure='chain', atomic_evolution=None, seed=None, wrap=False, preserve_order=True)

Bases: ProductFormula

The QDrift Trotterization method, which selects each each term in the Trotterization randomly, with a probability proportional to its weight. Based on the work of Earl Campbell in Ref. [1].

References

[1]: E. Campbell, “A random compiler for fast Hamiltonian simulation” (2018). arXiv:quant-ph/1811.08017

Parameters

• reps (int) – The number of times to repeat the Trotterization circuit.
• insert_barriers (bool) – Whether to insert barriers between the atomic evolutions.
• cx_structure (str) – How to arrange the CX gates for the Pauli evolutions, can be "chain", where next neighbor connections are used, or "fountain", where all qubits are connected to one. This only takes effect when atomic_evolution is None.
• atomic_evolution (Callable[[Pauli |SparsePauliOp, float], QuantumCircuit] | Callable[[QuantumCircuit, Pauli |SparsePauliOp, float], None] | None) – A function to apply the evolution of a single Pauli, or SparsePauliOp of only commuting terms, to a circuit. The function takes in three arguments: the circuit to append the evolution to, the Pauli operator to evolve, and the evolution time. By default, a single Pauli evolution is decomposed into a chain of CX gates and a single RZ gate. Alternatively, the function can also take Pauli operator and evolution time as inputs and returns the circuit that will be appended to the overall circuit being built.
• seed (int | None) – An optional seed for reproducibility of the random sampling process.
• wrap (bool) – Whether to wrap the atomic evolutions into custom gate objects. This only takes effect when atomic_evolution is None.
• preserve_order (bool) – If False, allows reordering the terms of the operator to potentially yield a shallower evolution circuit. Not relevant when synthesizing operator with a single term.

Attributes

settings

Methods

expand

synthesize