z iCSrSSKJr SSKJrJr SSKJrJrJ r J r SSK J r SSK Jr SSKJr SSKJr SS KJr S S KJr "S S 5r"SS5rSSjr"SS5rg)zVarious ways to divide a DAG into blocks of nodes, to split blocks of nodes into smaller sub-blocks, and to consolidate blocks.) annotations)IterableCallable)QuantumCircuitCircuitInstructionClassicalRegisterBit)condition_resources) DAGCircuit) DAGDependency) DAGOpNode) DAGDepNode)DAGCircuitErrorcn\rSrSrSrS SjrSrSSjrSrSr Sr SS jr SS jr S r g )BlockCollectoraThis class implements various strategies of dividing a DAG (direct acyclic graph) into blocks of nodes that satisfy certain criteria. It works both with the :class:`~qiskit.dagcircuit.DAGCircuit` and :class:`~qiskit.dagcircuit.DAGDependency` representations of a DAG, where DagDependency takes into account commutativity between nodes. Collecting nodes from DAGDependency generally leads to more optimal results, but is slower, as it requires to construct a DAGDependency beforehand. Thus, DAGCircuit should be used with lower transpiler settings, and DAGDependency should be used with higher transpiler settings. In general, there are multiple ways to collect maximal blocks. The approaches used here are of the form 'starting from the input nodes of a DAG, greedily collect the largest block of nodes that match certain criteria'. For additional details, see https://github.com/Qiskit/qiskit-terra/issues/5775. cXlSUlSUlSUl[ U[ 5(aSUlg[ U[5(aSUlg[S5e) Args: dag (Union[DAGCircuit, DAGDependency]): The input DAG. Raises: DAGCircuitError: the input object is not a DAG. NFTz not a DAG.) dag_pending_nodes _in_degree_collect_from_back isinstancer is_dag_dependencyr rselfrs Z/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/dagcircuit/collect_blocks.py__init__BlockCollector.__init__/sWCGDH"' c: & &%*D " ] + +%)D "",/ /c/Ul0UlUR5HNn[UR U55nX RU'US:XdM3URR U5 MP g)aFor an efficient implementation, for every node we keep the number of its unprocessed immediate predecessors (called ``_in_degree``). This ``_in_degree`` is set up at the start and updated throughout the algorithm. A node is leaf (or input) node iff its ``_in_degree`` is 0. When a node is (marked as) collected, the ``_in_degree`` of each of its immediate successor is updated by subtracting 1. Additionally, ``_pending_nodes`` explicitly keeps the list of nodes whose ``_in_degree`` is 0. rN)rr _op_nodeslen _direct_predsappend)rnodedegs r_setup_in_degrees BlockCollector._setup_in_degreesFs`!NN$Dd((./C$'OOD !ax##**40 %r!cUR(dURR5$URR5$)zReturns DAG nodes.)rrop_nodes get_nodesrs rr#BlockCollector._op_nodesXs1%%88$$& &88%%' 'r!cUR(dUR(aCURRU5Vs/sHn[ U[ 5(dMUPM sn$URR U5Vs/sHn[ U[ 5(dMUPM sn$UR(aOURRUR5Vs/sHnURRU5PM sn$URRUR5Vs/sHnURRU5PM sn$s snfs snfs snfs snf)zReturns direct predecessors of a node. This function takes into account the direction of collecting blocks, that is node's predecessors when collecting backwards are the direct successors of a node in the DAG. ) rrr successorsrr predecessorsdirect_successorsnode_idget_nodedirect_predecessors)rr'predpred_ids rr%BlockCollector._direct_preds_s %%&&)-)<))>t)Dd)D SWYbHc)Ddd&&$(88#=#=dll#K#KHH%%g.#K$(88#?#? #M#MHH%%g.#Mcd $EEE E!%E"0%E'cUR(dUR(aCURRU5Vs/sHn[ U[ 5(dMUPM sn$URR U5Vs/sHn[ U[ 5(dMUPM sn$UR(aOURRUR5Vs/sHnURRU5PM sn$URRUR5Vs/sHnURRU5PM sn$s snfs snfs snfs snf)zReturns direct successors of a node. This function takes into account the direction of collecting blocks, that is node's successors when collecting backwards are the direct predecessors of a node in the DAG. ) rrrr2rr r1r6r4r5r3)rr'succsucc_ids r _direct_succsBlockCollector._direct_succsus %%&&)-)>)>t)Dd)D SWYbHc)Ddd)-)<)r) r filter_fnmax_block_width current_blockcurrent_block_qargsunprocessed_pending_nodesr' new_qargswidth_within_budgetsucs rcollect_matching_block%BlockCollector.collect_matching_blocks  !e$($7$7!  (,002D*/446   ,&))n&G#E &*##6$$T*&/# --d3COOC(A-(s+q0188=4 ##**40-('0r!Nc^U4SjnXPlUR5 /nUR5(aOURUSS9 URTUS9n U (aUR U 5 UR5(aMOU(a'/n UHn U R [ U 55 M U nU(a5/n UH+n U R [5RU 55 M- U nUR(aUSSS2V s/sH oSSS2PM nn UV s/sHn [U 5U:dMU PM nn U$s sn fs sn f)aoCollects all blocks that match a given filtering function filter_fn. This iteratively finds the largest block that does not match filter_fn, then the largest block that matches filter_fn, and so on, until no more uncollected nodes remain. Intuitively, finding larger blocks of non-matching nodes helps to find larger blocks of matching nodes later on. After the blocks are collected, they can be optionally refined. The option ``split_blocks`` allows to split collected blocks into sub-blocks over disjoint qubit subsets. The option ``split_layers`` allows to split collected blocks into layers of non-overlapping instructions. The option ``min_block_size`` specifies the minimum number of gates in the block for the block to be collected. The option ``max_block_width`` specificies the maximum number of qubits over which a block can be defined. By default, blocks are collected in the direction from the inputs towards the outputs of the circuit. The option ``collect_from_back`` allows to change this direction, that is collect blocks from the outputs towards the inputs of the circuit. Returns the list of matching blocks only. c>T"U5(+$)z"Returns the opposite of filter_fn.)r'rIs r not_filter_fnABlockCollector.collect_all_matching_blocks..not_filter_fns & &r!N)rJ) rr)rArQr&extendsplit_block_into_layers BlockSplitterrunr$) rrI split_blocksmin_block_size split_layerscollect_from_backrJrVmatching_blocksmatching_block tmp_blocksblocks ` rcollect_all_matching_blocks*BlockCollector.collect_all_matching_blockssB< ' #4  ?A**,,  ' ' t ' L!88Tc8dN&&~6 **,, J(!!"9%"@A)(O J(!!-/"5"5e"<=)(O  " "8G"8MN8MuTrT{8MON/>^oUU~A]5o^ O_s E E7E)rrrrr)rzDAGCircuit | DAGDependency)returnz Iterable[DAGOpNode | DAGDepNode])rIrrJz int | Nonerglist[DAGOpNode | DAGDepNode])TFFN)__name__ __module__ __qualname____firstlineno____doc__rr)r#r%r>rArQre__static_attributes__rUr!rrrsZ"0.1$(,,,-!-4>- %-dFr!rc0\rSrSrSrSrSrSrSrSr g) r[izSplits a block of nodes into sub-blocks over disjoint qubits. The implementation is based on the Disjoint Set Union data structure.c 0Ul0UlgN)leadergroupr.s rrBlockSplitter.__init__ s  r!cXR;aXRU'/URU'U$URUU:XaU$URURU5URU'URU$)z Find in DSU.)rsrt find_leader)rindexs rrwBlockSplitter.find_leadersr  #!&KK  "DJJu L ;;u  &L!--dkk%.@A E{{5!!r!chURU5nURU5nX4:Xag[URU5[URU5:aXCpCX0RU'URUR URU5 URUR 5 g)z Union in DSU.N)rwr$rtrsrYclear)rindex1index2leader1leader2s r union_leadersBlockSplitter.union_leaderss""6*""6*    tzz'" #c$**W*=&> >&W& G 7""4::g#67 7!!#r!ctUHgnURnU(dMUSnUSSHnURXE5 M URURU5R U5 Mi /nUR R 5H*upWXW:XdM UR URU5 M, U$)z;Splits block of nodes into sub-blocks over disjoint qubits.rrN)rHrrtrwr&rsitems)rrdr'indicesfirstrxblocksitems rr\BlockSplitter.run'sDjjGAJE ""50% JJt''. / 6 6t <;;,,.KE} djj/0/ r!)rtrsN) rjrkrlrmrnrrwrr\rorUr!rr[r[sM " $r!r[c^0m/nUHn[UR5nURUR5 [ UR SS5nUb$UR[ U5R5 [U4SjU55n[U5U::a"UR/5 [U5U::aM"UH nUS-TU'M XRU5 M U$)zwSplits a block of nodes into sub-blocks of non-overlapping instructions (or, in other words, into depth-1 sub-blocks). _conditionNc3H># UHnTRUS5v M g7f)rN)get).0bit bit_depthss r *split_block_into_layers..IsC(3 sA..(s"r) rDrHrGcargsgetattropr clbitsmaxr$r&)rdlayersr'cur_bitscond cur_depthrrs @rrZrZ:s"$J13Ftzz? #tww d3   OO/5<< =C(CC &kY& MM" &kY&C'!mJsO  & Mr!c$\rSrSrSrSrSrSrg)BlockCollapseriTzThis class implements various strategies of consolidating blocks of nodes in a DAG (direct acyclic graph). It works both with the :class:`~qiskit.dagcircuit.DAGCircuit` and :class:`~qiskit.dagcircuit.DAGDependency` DAG representations. cXlg)rNrrs rrBlockCollapser.__init__[s r!c ^[URR5VVs0sHup4XC_M snnmTR[URR5VVs0sHup4XC_M snn5 UGHn[ 5n[ 5n[ 5nUHn URU R 5 URU R5 [U RSS5n U cMUUR[U 5R5 [U S[5(dMURU S5 M [UU4SjS9n [UU4SjS9n [X5n UHnU R!U5 M [U 5VVs0sH unnUU_M nnnUR[U 5VVs0sH unnUU_M snn5 UH=n U R#[%U RU R U R55 M? U"U 5nURR'UUUSS9 GM UR$s snnfs snnfs snnfs snnf) zFor each block, constructs a quantum circuit containing instructions in the block, then uses collapse_fn to collapse this circuit into a single operation. rNrc>TU$rrrUxglobal_index_maps r6BlockCollapser.collapse_to_operation.. =Ma=Pr!)keyc>TU$rrrUrs rrrrr!F) cycle_check) enumeraterqubitsrGrrDrHrrrr rraddsortedr add_registerr&rreplace_block_with_op)rr collapse_fnidxwirerd cur_qubits cur_clbits cur_clregsr'r sorted_qubits sorted_clbitsqcregixqb wire_pos_maprrs @rcollapse_to_operation$BlockCollapser.collapse_to_operationfs8A7QR7Q)#DI7QRIdhhoorsQ7".UU:39/3'ggT00f4CCr!