gdZddlmZddlZddlZddlZddlmZddlm Z ddl Z ddl m Z ddlmZmZddlmZdd lmZd d lmZmZejrdd lmZGd deZdS)z QDrift Class) annotationsN)chain)Callable)QuantumCircuit) SparsePauliOpPauli) deprecate_arg) QiskitError)ProductFormulareorder_paulis)PauliEvolutionGatecjeZdZdZeddddd dd fd Zd!dZxZS)"QDriftayThe 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 `_ atomic_evolutionz1.4c^|duo)ttj|jdkS)N)leninspect signature parameters)callables W/granary/edev/quantum/lib/python3.11/site-packages/qiskit/synthesis/evolution/qdrift.pyzQDrift./s184#7$= !(++6 7 71 <zkThe 'Callable[[Pauli | SparsePauliOp, float], QuantumCircuit]' signature of the 'atomic_evolution' argumentzInstead you should update your 'atomic_evolution' function to be of the following type: 'Callable[[QuantumCircuit, Pauli | SparsePauliOp, float], None]'.)namesince predicatedeprecation_descriptionadditional_msgr FrNTrepsintinsert_barriersbool cx_structurestrCallable[[Pauli | SparsePauliOp, float], QuantumCircuit] | Callable[[QuantumCircuit, Pauli | SparsePauliOp, float], None] | Noneseed int | Nonewrappreserve_orderreturnNonec td||||||d|_tj||_dS)ak Args: reps: The number of times to repeat the Trotterization circuit. insert_barriers: Whether to insert barriers between the atomic evolutions. cx_structure: 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: A function to apply the evolution of a single :class:`.Pauli`, or :class:`.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: An optional seed for reproducibility of the random sampling process. wrap: Whether to wrap the atomic evolutions into custom gate objects. This only takes effect when ``atomic_evolution is None``. preserve_order: 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. r N)super__init__ sampled_opsnprandom default_rngrng) selfr!r#r%rr(r*r+ __class__s rr0zQDrift.__init__,sWf  t_l4DdN    9((..r evolutionr#list[tuple[str, tuple[int], float]]c |j}|j}t|tr,tt jd|D}n|} d|D}n"#t$r}td|d}~wwxYwtj |}tj |}tj d|dzz|dzz|jz} |jtj|t$| f||z } d|z| z |z fd| D} |jst)| } | S)Nc6g|]}|S)to_sparse_list).0ops r z!QDrift.expand..ls$.W.W.Wrr/@/@/B/B.W.W.WrcXg|]'\}}}ttj|(Sr<)floatr2 real_if_close)r>_coeffs rr@z!QDrift.expand..qs1OOOAueB,U3344OOOrz)QDrift requires bound, real coefficients.r)dtype)sizepc g|]@}|d|dtjtj|dzfAS)rr r)r2realsign)r>pauli rescaled_times rr@z!QDrift.expand..sR   QVU1XuQxq):):!;!;m!K L   r)operatortime isinstancelistr from_iterabler= TypeErrorr r2abssummathceilr!r5choicearrayobjectr+r ) r6r8 operatorsrOpauliscoeffsexcweightslambd num_gatessampledsampled_paulisrMs @rexpandz QDrift.expandes& ~ i & & 0%-.W.WY.W.W.WXXYYFF--//F TOOOOOFF T T TIJJPS S T&..wIa5!8na849DEE (// HV6 * * *)5"  E I-4     Za   " <+N;;Ns& A33 B=B  B)r FrNNFT)r!r"r#r$r%r&rr'r(r)r*r$r+r$r,r-)r8rr,r9)__name__ __module__ __qualname____doc__r r0rd __classcell__)r7s@rrr"s] == * V     %# #)/)/)/)/)/)/  )/V$$$$$$$$rr)rh __future__rrrVtyping itertoolsrcollections.abcrnumpyr2qiskit.circuit.quantumcircuitrqiskit.quantum_info.operatorsrrqiskit.utils.deprecationr qiskit.exceptionsr product_formular r TYPE_CHECKINGqiskit.circuit.libraryrrr<rrrvs+"""""" $$$$$$888888>>>>>>>>222222))))));;;;;;;; :999999ggggg^gggggr