z ipSrSSKJr SSKJrJrJrJr SSKJ r SSK J r SSK J r SSKJr "SS 5rg ) zXCode from commutative_analysis pass that checks commutation relations between DAG nodes.) annotations)ListUnionSetOptional)Sequence) Operation)Qubit)CommutationCheckerc\rSrSrSrS SS.S SjjjrSSSjjrSSSjjrSrS r SS jr S r g)r aCheck commutations of two operations. Two unitaries :math:`A` and :math:`B` on :math:`n` qubits commute if .. math:: \frac{2^n F_{\text{process}}(AB, BA) + 1}{2^n + 1} > 1 - \varepsilon, where .. math:: F_{\text{process}}(U_1, U_2) = \left|\frac{\mathrm{Tr}(U_1 U_2^\dagger)}{2^n} \right|^2, and we set :math:`\varepsilon` to :math:`10^{-12}` to account for round-off errors on few-qubit systems. This metric is chosen for consistency with other closeness checks in Qiskit. When possible, commutation relations are queried from a lookup table. This is the case for standard gates without parameters (such as :class:`.XGate` or :class:`.HGate`) or gates with free parameters (such as :class:`.RXGate` with a :class:`.ParameterExpression` as angle). Otherwise, a matrix-based check is performed, where two operations are said to commute, if the average gate fidelity of performing the commutation is above a certain threshold (see ``approximation_degree``). The result of this commutation is then added to the cached lookup table. N)gatesc&[XU5Ulg)N) RustCheckercc)selfstandard_gate_commutationscache_max_entriesrs \/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/circuit/commutation_checker.py__init__CommutationChecker.__init__4s8USc:URRXX45$)z!Checks if two DAGOpNodes commute.)r commute_nodes)rop1op2max_num_qubitsapproximation_degrees rr CommutationChecker.commute_nodes=sww$$S~TTrc URRU[U5[U5U[U5[U5UU5$)ay Checks if two Operations commute. The return value of `True` means that the operations truly commute, and the return value of `False` means that either the operations do not commute or that the commutation check was skipped (for example, when the operations have conditions or have too many qubits). Args: op1: first operation. qargs1: first operation's qubits. cargs1: first operation's clbits. op2: second operation. qargs2: second operation's qubits. cargs2: second operation's clbits. max_num_qubits: the maximum number of qubits to consider, the check may be skipped if the number of qubits for either operation exceeds this amount. approximation_degree: If the average gate fidelity in between the two operations is above this number (up to ``1e-12``) they are assumed to commute. Returns: bool: whether two operations commute. )rcommutetuple) rrqargs1cargs1rqargs2cargs2rrs rr!CommutationChecker.commuteGsB@ww  &M &M  &M &M    rc6URR5$)z Returns number of cached entries)rnum_cached_entriesrs rr)%CommutationChecker.num_cached_entriesrsww))++rc8URR5 g)z1Clears the dictionary holding cached commutationsN)rclear_cached_commutationsr*s rr-,CommutationChecker.clear_cached_commutationsvs ))+rcNURRRXX45$)aReturns stored commutation relation if any Args: first_op: first operation. first_qargs: first operation's qubits. second_op: second operation. second_qargs: second operation's qubits. Return: bool: True if the gates commute and false if it is not the case. )rlibrarycheck_commutation_entries)rfirst_op first_qargs second_op second_qargss rr1,CommutationChecker.check_commutation_entrieszs$$ww88 9  r)r)Ni@B)rdictrintrzOptional[Set[str]])g?)rr8rfloatreturnbool)rr r#Sequence[Qubit | int]r$r=rr r%r=r&r=rr8rr:r;r<) r2r r3rr4r r5rr;zUnion[bool, None]) __name__ __module__ __qualname____firstlineno____doc__rrr!r)r-r1__static_attributes__rrr r s:,0!&T %) T$(TT " T &) U U $ U  U$ &)) ) &) & )  ) & ) &) ) $)  ) V,,         rr N)rB __future__rtypingrrrrcollections.abcrqiskit.circuit.operationr qiskit.circuitr &qiskit._accelerate.commutation_checkerr rrDrrrKs,_"--$. Tv v r