gCdZddlZddlmZmZmZmZmZddlm Z m Z ddl m Z m Z mZmZddlmZmZddlmZmZmZmZmZmZddlmZdd lmZdd lmZm Z dd l!m"Z"dd l#m$Z$Gd dZ%GddeZ&dZ'dS)z|jd|_|j||xjdz c_d}n:|j|jvr,|j||xjdz c_d}|S)z If node can be added to block while keeping the block star-shaped, and return True. Otherwise, does not add node to block and returns False. FTNr)lenqargsr"appendr setr! isinstance)r#nodeaddeds r$ append_nodezStarBlock.append_node0se  tz??a   J  d # # #EE [ dj//DK J  d # # # JJ!OJJEE  S ) ) z!} ++"jm  !!$''' a A$+--"jm  !!$''' a {dj(( !!$''' a  r&c|jS)zN Returns the number of two-qubit quantum gates in this block. )r!r)s r$sizezStarBlock.sizeSs zr&)NNr)__name__ __module__ __qualname____doc__r%r*r4r6r&r$rr$s\FF4444 !!!Fr&rc eZdZdZfdZdZdeeee ffdZ dZ dZ dZ d Z dd Zd Zd eeefdedeeeeeeee fffdZdZxZS)StarPreRoutingaRun star to linear pre-routing This pass is a logical optimization pass that rewrites any solely 2q gate star connectivity subcircuit as a linear connectivity equivalent with swaps. For example: .. plot:: :alt: Circuit diagram output by the previous code. :include-source: from qiskit.circuit import QuantumCircuit from qiskit.transpiler.passes import StarPreRouting qc = QuantumCircuit(10) qc.h(0) qc.cx(0, range(1, 5)) qc.h(9) qc.cx(9, range(8, 4, -1)) qc.measure_all() StarPreRouting()(qc).draw("mpl") This pass was inspired by a similar pass described in Section IV of: C. Campbell et al., "Superstaq: Deep Optimization of Quantum Programs," 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), Bellevue, WA, USA, 2023, pp. 1020-1032, doi: 10.1109/QCE57702.2023.00116. cdd|_d|_tdS)r=N)_pending_nodes _in_degreesuperr%)r# __class__s r$r%zStarPreRouting.__init__xs2MQMQ r&cg|_i|_||D]O}t|||}||j|<|dkr|j|PdS)a+For 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)r?r@ _op_nodesr- _direct_predsr/)r#dagr2degs r$_setup_in_degreesz StarPreRouting._setup_in_degreess!NN3'' 1 1Dd((d3344C$'DOD !axx#**4000  1 1r&returnc|t|ts|S|S)zReturns DAG nodes.)r1rop_nodesr*)r#rFs r$rDzStarPreRouting._op_nodess0#}-- #<<>> !==?? "r&cttsd|DSfd|jDS)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. c<g|]}t|t|Sr;r1r).0preds r$ z0StarPreRouting._direct_preds..s([[[Tz$PY?Z?Z[D[[[r&c:g|]}|Sr;get_node)rOpred_idrFs r$rQz0StarPreRouting._direct_preds..s%___gCLL))___r&)r1r predecessorsdirect_predecessorsnode_idr#rFr2s ` r$rEzStarPreRouting._direct_predssf #}-- `[[S%5%5d%;%;[[[ [____9P9PQUQ]9^9^___ _r&cttsd|DSfd|jDS)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. c<g|]}t|t|Sr;rN)rOsuccs r$rQz0StarPreRouting._direct_succs..s'YYYTZi=X=XYDYYYr&c:g|]}|Sr;rS)rOsucc_idrFs r$rQz0StarPreRouting._direct_succs..s%]]]gCLL))]]]r&)r1r successorsdirect_successorsrXrYs ` r$ _direct_succszStarPreRouting._direct_succssb #}-- ^YYS^^D%9%9YYY Y]]]]9N9Nt|9\9\]]] ]r&c2t|jdkS)z5Returns whether there are uncollected (pending) nodesr)r-r?r)s r$_have_uncollected_nodesz&StarPreRouting._have_uncollected_nodess4&''!++r&cz|j}g|_t}|rg}|D]}||o||}|rU|||D]=}|j|xxdzcc<|j|dkr||>y|j||}||S)aIteratively collects the largest block of input nodes (that is, nodes with ``_in_degree`` equal to 0) that match a given filtering function. Examples of this include collecting blocks of swap gates, blocks of linear gates (CXs and SWAPs), blocks of Clifford gates, blocks of single-qubit gates, blocks of two-qubit gates, etc. Here 'iteratively' means that once a node is collected, the ``_in_degree`` of each of its immediate successor is decreased by 1, allowing more nodes to become input and to be eligible for collecting into the current block. Returns the block of collected nodes. r,r)r?rr4rar@r/) r#rF filter_fnunprocessed_pending_nodes current_blocknew_pending_nodesr2r3sucs r$collect_matching_blockz%StarPreRouting.collect_matching_blocks%)$7! ! ( : " 1 5 5! $KM,E,Ed,K,K5#11#t<<::,,,1,,,?3/144-44S999: '..t4444(9 %( :r&cdfd}||g}g}|r|||||}||kr|||||d|D}||fS)a?Collects 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. The option ``min_block_size`` specifies the minimum number of gates in the block for the block to be collected. 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. ct|jdkoEt|jdko-t|ddduot |jt  S)z8Specifies which nodes can be collected into star blocks.rkr conditionN)r-r.cargsgetattrr1opr )r2s r$rez=StarPreRouting.collect_all_matching_blocks..filter_fns`DJ1$5 OOq(5D+t44<5#47G444  r&c| S)z"Returns the opposite of filter_fn.r;)r2res r$ not_filter_fnzAStarPreRouting.collect_all_matching_blocks..not_filter_fns y& &r&)rec&g|]}|jD]}|Sr;r()rOpns r$rQz>StarPreRouting.collect_all_matching_blocks..s'III!IIAAIIIIr&)rHrcrjr6r/)r#rFmin_block_sizersmatching_blocksprocessing_ordermatching_blockres @r$collect_all_matching_blocksz*StarPreRouting.collect_all_matching_blockss &    ' ' ' ' ' s###,.**,, 4  ' '} ' E E E!88 8RRN""$$66&&~666  # #N 3 3 3 **,, 4JI'7III 000r&cL|d\}}|sStd|DrS|||\}}dtjD}t ||jd<|jd ||jd<t fdt|D}|jdx}rB||jjj|jd<n ||jd<|S) Nrkrwc3FK|]}|dkVdS)N)r6)rObs r$ z%StarPreRouting.run.. s.11qvvxx!|111111r&ci|]\}}|| Sr;r;)rOindexqubits r$ z&StarPreRouting.run..sVVV uueVVVr&original_layoutoriginal_qubit_indicesc2i|]\}}j||Sr;)qubits)rOidxoutrFs r$rz&StarPreRouting.run..s%[[[hc3SZ_c[[[r&virtual_permutation_layout) determine_star_blocks_processingall star_preroute enumeraterr property_setcomposeinverse) r#rF star_blocksrynew_dag qubit_mappinginput_qubit_mapping new_layoutcurrent_layouts ` r$runzStarPreRouting.runs\(,(M(Mcbc(M(d(d% % J 11[111 1 1 J"&!3!3CFV!W!WWV #*@U@UVVV/56I/J/J+,  5 6 >:MD 6 7[[[[)MBZBZ[[[\\ !./KL L> I>H>P>P&&sz3:>> ??D : ; ;?ID : ;r&rFrwc>|||\}}||fS)aReturns star blocks in dag and the processing order of nodes within these star blocks Args: dag (DAGCircuit or DAGDependency): a dag on which star blocks should be determined. min_block_size (int): minimum number of two-qubit gates in a star block. Returns: List[StarBlock]: a list of star blocks in the given dag Union[List[DAGOpNode], List[DAGDepNode]]: a list of operations specifying processing order r})r{)r#rFrwblocksrys r$rz/StarPreRouting.determine_star_blocks_processing$s8$(#C#C $D$ $   '''r&ctj}jd}tj|}dt |Dfd|D}t|||}t|\} } fd|D} ttt|dzfdt |Dfd} t | } tj| | | ^}}t!||j| }||fS) a7Returns star blocks in dag and the processing order of nodes within these star blocks Args: dag (DAGCircuit or DAGDependency): a dag on which star prerouting should be performed. blocks (List[StarBlock]): a list of star blocks in the given dag. processing_order (Union[List[DAGOpNode], List[DAGDepNode]]): a list of operations specifying processing order Returns: new_dag: a dag specifying the pre-routed circuit qubit_mapping: the final qubit mapping after pre-routing qci|]\}}|| Sr;r;)rOrbits r$rz0StarPreRouting.star_preroute..EsPPPhc3cPPPr&c(i|]\}}||Sr;r;)rOkv qubit_indicess r$rz0StarPreRouting.star_preroute..Fs$ddd$!Q-*Adddr&cfg|]-}|jdut|f.Sr)r _extract_nodesr*)rOblockrFs r$rQz0StarPreRouting.star_preroute..KsF   SXU\ %~eoo6G6G'M'M N   r&r,c*i|]\}}|d|dS)a0r;)rOrr2 int_digitss r$rz0StarPreRouting.star_preroute..Qs@& & & 0;tD+e+j++++& & & r&c|d}||St|ttfrt |jSdfdtj|j |j DS)N,c3PK|] }|jdV!dS)04dNfind_bitr)rOrrFs r$rzHStarPreRouting.star_preroute..tie_breaker_key..[sG343<<??(..r&) getr1rrstrwirejoin itertoolschainr.ro)r2ryrFprocessing_order_index_maps r$tie_breaker_keyz5StarPreRouting.star_preroute..tie_breaker_keyUs9==dDII +''$J 788 &49~~%888A TXT^8_8_ r&)key)r-rqregsrgenerate_trivial_layoutrget_virtual_bitsitemsrrrr rtopological_op_nodesrrrcopy_empty_like)r#rFrry num_qubitscanonical_registerrlayout_mappinginitial_layout sabre_dagcircuit_to_dag_dict rust_blocksrrust_processing_order sabre_resultrres_dagrrrs ` @@@r$rzStarPreRouting.star_preroute5s__  Ys^78JKKPP).s(KKKue,,2KKKr&N _directiveF)r.r0rnupdaterrqclbitsr1r targetr addr rrpr/_node_id)r"rFextracted_node_infor2rclassical_bit_indicesswitch_case_target is_directives ` r$rrrsK   KKKK KKK # > % ! ( ()rsCB99999999999999JJJJJJJJJJJJJJJJJJJJ<;;;;;++++++]]]]]]]]............33333333lU&U&U&U&U&'U&U&U&p&&&&&r&