z i@ISrSSKJrJrJrJr SSKJr SSKJ r J r SSK J r J r SSKJrJrJrJrJrJr SSKJr SSKJr SS KJr SS KJr SS KJr "S S \5rg)z+Optimize annotated operations on a circuit.)OptionalListTupleUnion)CONTROL_FLOW_OP_NAMES)circuit_to_dagdag_to_circuit)AnnotatedOperation_canonicalize_modifiers)QuantumCircuit InstructionEquivalenceLibraryControlledGate Operation ControlFlowOp)TransformationPass) control_flow)Target) DAGCircuit)TranspilerErrorc F^\rSrSrSrSS\\S\\S\\\ S\ S\ 4 U4S jjjr S \ 4S jr S \\ \ 44S jrS \\ \ 44SjrS \ S \\\ \ \ 4S44SjrS\S\\ \ \ 4S \4SjrS \\ \ 44SjrS\S \ 4SjrS\S \ 4SjrS \\ \ 44SjrSrU=r$)OptimizeAnnotated#aOptimization pass on circuits with annotated operations. Implemented optimizations: * For each annotated operation, converting the list of its modifiers to a canonical form. For example, consecutively applying ``inverse()``, ``control(2)`` and ``inverse()`` is equivalent to applying ``control(2)``. * Removing annotations when possible. For example, ``AnnotatedOperation(SwapGate(), [InverseModifier(), InverseModifier()])`` is equivalent to ``SwapGate()``. * Recursively combining annotations. For example, if ``g1 = AnnotatedOperation(SwapGate(), InverseModifier())`` and ``g2 = AnnotatedOperation(g1, ControlModifier(2))``, then ``g2`` can be replaced with ``AnnotatedOperation(SwapGate(), [InverseModifier(), ControlModifier(2)])``. * Applies conjugate reduction to annotated operations. As an example, ``control - [P -- Q -- P^{-1}]`` can be rewritten as ``P -- control - [Q] -- P^{-1}``, that is, only the middle part needs to be controlled. This also works for inverse and power modifiers. Ntargetequivalence_library basis_gatesrecursedo_conjugate_reductionc@>[TU]5 XlX lX0lXPlU(+=(d# URSL=(a URSLUlUR (d0URc"1SknU[UR5-Ulggg)aa OptimizeAnnotated initializer. Args: target: Optional, the backend target to use for this pass. equivalence_library: The equivalence library used (instructions in this library will not be optimized by this pass). basis_gates: Optional, target basis names to unroll to, e.g. `['u3', 'cx']` (instructions in this list will not be optimized by this pass). Ignored if ``target`` is also specified. recurse: By default, when either ``target`` or ``basis_gates`` is specified, the pass recursively descends into gate definitions (and the recursion is not applied when neither is specified since such objects do not need to be synthesized). Setting this value to ``False`` precludes the recursion in every case. do_conjugate_reduction: controls whether conjugate reduction should be performed. N>delayresetstorebarriermeasuresnapshot) super__init___target _equiv_lib _basis_gates_do_conjugate_reduction_top_level_onlyset _device_insts)selfrrrrr basic_insts __class__s r/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/transpiler/passes/optimization/optimize_annotated.pyr'OptimizeAnnotated.__init__<s2  -''=$#*{bt/@/@D/H/aT\\]aMa## (<WK!,s43D3D/E!ED )=#dagc,URU5upU$)zRun the OptimizeAnnotated pass on `dag`. Args: dag: input dag. Returns: Output dag with higher-level operations optimized. Raises: TranspilerError: when something goes wrong. ) _run_inner)r/r5_s r2runOptimizeAnnotated.runbs% r4returnc|UR(a4URSS9nSU;a[R"U5(dUS4$UR 5H_n[ UR [5(dM$URU[R"URUR 55 Ma URU5upSnUR(dURU5upSnUR(d$UR(aURU5upX=(d U=(d U4$)z@ Optimizes annotated operations. Returns True if did something. F)r annotated)r, count_opsr intersectionop_nodes isinstanceoprsubstitute_noder map_blocksr9 _canonicalize_recurser+_conjugate_reduction)r/r5op_namesnodeopt1opt2opt3s r2r7OptimizeAnnotated._run_innerrs   }}U}3H(*3H3U3UV^3_3_Ez!LLND$''=11## ++DHHdgg>#&&s+ ## c*IC##(D(D11#6IC(D(D((r4cSnUR[S9Hn/nURn[U[5(a>UR UR 5 UR n[U[5(aM>[U5n[U5S:a!XSRlXcRlOURX55 SnM X4$)ze Combines recursive annotated operations and canonicalizes modifiers. Returns True if did something. FrBrT) r@r rBrAextend modifiersbase_opr lenrC)r/r5 did_somethingrIrQcurcanonical_modifierss r2rEOptimizeAnnotated._canonicalizes  LL$6L7DI''CS"455  /kkS"455#:)"D &'!+"%$7!##D. M8!!r4c/n/n0n0n0n0n[5n[5n [5n UR5Hn [URU 55n [ U 5XK'[ U 5S:Xa(U R Hn XU 'U R U 5 M [URU 55n[ U5X['[ U5S:XdMU R Hn XU 'U R U 5 M M [ U 5S:Ga,U R5nU R5 UGHn URU S5=ncMURU S5=ncM2UU;dUU;aM@UU:XaMHUU4U ;aMRUR UR :wdURUR:waMURURR5:XGa/UR Hn SXm'M UR Hn SX}'M URU5HHn X;dM XK==S-ss'XKS:XdM U R Hn XU 'U R U 5 M MJ URU5HHn X;dM X[==S-ss'X[S:XdM U R Hn XU 'U R U 5 M MJ URU5 URU5 UR U5 UR U5 GMU R UU45 GM [ U 5S:aGM,[ U5S:XagUR5nUR5nUR5nSUlSUlUH4n UR#U RU R U R5 M6 UH4n UR%U RU R U R5 M6 UR5H;n X;dM UR#U RU R U R5 M= UUU4$)z Decomposes a circuit ``A`` into 3 sub-circuits ``P``, ``Q``, ``R`` such that ``A = P -- Q -- R`` and ``R = P^{-1}``. This is accomplished by iteratively finding inverse nodes at the front and at the back of the circuit. rN)r-r@listop_predecessorsrSqargsadd op_successorscopycleargetcargsrBinverseappendcopy_empty_like global_phaseapply_operation_backapply_operation_front)r/r5 front_block back_block in_degree out_degreefront_node_for_qubitback_node_for_qubitprocessed_nodes active_qubitschecked_node_pairsrIpredsqsuccsto_check front_node back_node front_circuitmiddle_circuit back_circuits r2_conjugate_decomposition*OptimizeAnnotated._conjugate_decompositions     " % !ULLND,,T23E!%jIO5zQA.2+!%%a($**401E"5zJ 5zQA-1*!%%a($#- 1$$))+H    !"6":":1d"CCJL!4!8!8D!AAIJ0I4P* *.@@##y6*:J:Jioo:]==ILL$8$8$::'--26,/.&__15+.-!$ 1 1* =6%Oq0O(!3)-A>B$;$1$5$5a$8*4 !>!$ 3 3I >6&,1,)/14)-A=A$:$1$5$5a$8*4 !? &&z2%%i0#'' 3#'' 2'**J +BCu - 1$F { q ++- ,,.**, %& "$% !D  . .tww DJJ O D  . .tww DJJ OLLND*33DGGTZZT#nl::r4rBbase_decompositioncUup4n[SURRURR/S9n[ U5Ul[SURUR/S9nURURR- n[ URUR5n U Rn U R[ U5XURSS9 U R[XaRS9[UR55 U R[ U5XURSS9 XlU$)a& We are given an annotated-operation ``op = M [ B ]`` (where ``B`` is the base operation and ``M`` is the list of modifiers) and the "conjugate decomposition" of the definition of ``B``, i.e. ``B = P * Q * R``, with ``R = P^{-1}`` (with ``P``, ``Q`` and ``R`` represented as ``DAGCircuit`` objects). Let ``IQ`` denote a new custom instruction with definitions ``Q``. We return the operation ``op_new`` which a new custom instruction with definition ``P * A * R``, where ``A`` is a new annotated-operation with modifiers ``M`` and base gate ``IQ``. iq)name num_qubits num_clbitsparams optimized)rrrT)inplace)rRrQ) r rRrrr definitionr qubitscomposerdr rQrange) r/rBr}p_dagq_dagr_dagq_instrop_newnum_control_qubitscircrs r2_conjugate_reduce_op&OptimizeAnnotated._conjugate_reduce_opAs1e"**"7"7BJJDYDYbd ,E2 BMMbmmTV  ]]RZZ-B-BBbmmR]]; 5 !6r}}#MW[   w,, Gr}}I]  5 !6r}}#MW[  ! r4cNSnUR[S9HnURRnUR U5(aM1[ UR SS9nURU5nUcM[URURU5nURX75 SnM X4$)a Looks for annotated operations whose base operation has a nontrivial conjugate decomposition. In such cases, the modifiers of the annotated operation can be moved to the "middle" part of the decomposition. Returns the modified DAG and whether it did something. FrOcopy_operationsT) r@r rBrR_skip_definitionrrr{rrC)r/r5rTrIrRbase_dagr}new_ops r2rG&OptimizeAnnotated._conjugate_reductionjs LL$6L7DggooG((11)'*<*$B$Tr}}!(<<+ 22"''2JWW 2 22  $//"=$//B[B[\^B_B_r4c[U[5(aURUR5$UR U5(agUR nUc[SUS35e[USS9nURU5upEU(a[U5UlU$![ a!n[SURSU35UeSnAf[a SnNf=f)z Recursively applies optimizations to op's definition (or to op.base_op's definition if op is an annotated operation). Returns True if did something. Fz7OptimizeAnnotated was unable to extract definition for z: Nz)OptimizeAnnotated was unable to optimize .r) rAr _recursively_process_definitionsrRrr TypeErrorrrAttributeErrorrr7r )r/rBrerrdefinition_dagopts r2r2OptimizeAnnotated._recursively_process_definitionss b, - -88D D   $ $ J  !$MbTQR"ST T' EJ"oon= +>:BM ' !I"''RTUXTYZ  J s B C'CCCcSnUR5H)nURUR5nU=(d UnM+ X4$)zF Recursively handles gate definitions. Returns True if did something. F)r@rrB)r/r5rTrIrs r2rFOptimizeAnnotated._recursesB  LLND77@C)0SM#!!r4)r*r.r+r)r(r,)NNNTT)__name__ __module__ __qualname____firstlineno____doc__rrrrstrboolr'rr9rr7rErr{r rrrGrrrF__static_attributes__ __classcell__)r1s@r2rr#sZ4$(<@+/'+ $F $F&&89$Fd3i( $F  $F !% $F$FLz !)z4'7!8!)F"E*d*:$;"0R;R; uZZ78$> ?R;h'$':? JXb@b:c' 'R"5T1A+B"(9$$9$$L "uZ%56 " "r4rN) rtypingrrrrqiskit.circuit.controlflowrqiskit.convertersrr "qiskit.circuit.annotated_operationr r qiskit.circuitr r rrrrqiskit.transpiler.basepassesrqiskit.transpiler.passes.utilsrqiskit.transpiler.targetrqiskit.dagcircuitrqiskit.transpiler.exceptionsrrr4r2rsC2//<<Z<7+(8^"*^"r4