gZPdZddlZddlZddlmZddlZddlmZm Z ddl m Z m Z ddl mZddlmZddlmZdd lmZdd lmZdd lmZdd lmZdd lmZmZmZmZm Z m!Z!m"Z"ddl#m$Z%ddl#m&Z&ddl'm(Z(ddl)m*Z*ddl+m,Z,ej-e.Z/GddeZ0de!fdZ1dZ2dS)z;Map a DAGCircuit onto a ``coupling_map`` adding swap gates.N)inf)dag_to_circuitcircuit_to_dag)exprtypes)QuantumRegister)TransformationPass)TranspilerError) DAGCircuit)SwapGate)Layout)Target)ClbitIfElseOp WhileLoopOp ForLoopOp SwitchCaseOp ControlFlowOp CASE_DEFAULT)stochastic_swap)nlayout)disjoint_utils)deprecate_func)get_swap_map_dagcxeZdZdZeddddfd Zd Zd Zd Zdd Z dZ dZ dZ xZ S)StochasticSwapaMap a DAGCircuit onto a `coupling_map` adding swap gates. Uses a randomized algorithm. Notes: 1. Measurements may occur and be followed by swaps that result in repeated measurement of the same qubit. Near-term experiments cannot implement these circuits, so some care is required when using this mapper with experimental backend targets. 2. We do not use the fact that the input state is zero to simplify the circuit. z1.3zin the 2.0 releasezvThe StochasticSwap transpilation pass is a suboptimal routing algorithm and has been superseded by the SabreSwap pass.)sinceremoval_timelineadditional_msgNFc<tt|tr&||_|j|_nd|_||_||_||_d|_ ||_ d|_ ||_ d|_ dS)aYStochasticSwap initializer. The coupling map is a connected graph If these are not satisfied, the behavior is undefined. Args: coupling_map (Union[CouplingMap, Target]): Directed graph representing a coupling map. trials (int): maximum number of iterations to attempt seed (int): seed for random number generator fake_run (bool): if true, it will only pretend to do routing, i.e., no swap is effectively added. initial_layout (Layout): starting layout at beginning of pass. N)super__init__ isinstancertargetbuild_coupling_map coupling_maptrialsseedrngfake_runqregsinitial_layout _int_to_qubit)selfr(r)r*r,r. __class__s f/granary/edev/quantum/lib/python3.11/site-packages/qiskit/transpiler/passes/routing/stochastic_swap.pyr$zStochasticSwap.__init__?s,  lF + + -&DK $ > > @ @D  DK ,D      ,!c.|jtdt|jdks|jddtdt|jt|jjkrtdtj||j |jn|j tj |j |_|jd}|jt!j||_t%|j|_|j|_t(d|j |j|||j|j}|S) a8Run the StochasticSwap pass on `dag`. Args: dag (DAGCircuit): DAG to map. Returns: DAGCircuit: A mapped DAG. Raises: TranspilerError: if the coupling map or the layout are not compatible with the DAG, or if the coupling_map=None Nz0StochasticSwap cannot run with coupling_map=Nonerqz-StochasticSwap runs on physical circuits onlyz9The layout does not match the amount of qubits in the DAGz&StochasticSwap rng seeded with seed=%s)r))r(r lenr-getqubitsphysical_qubitsr$require_layout_isolated_to_componentr&nprandom default_rngr*r+r.r generate_trivial_layouttupler/loggerdebugcompute_distance_matrix_mapperr))r0dagcanonical_registernew_dags r2runzStochasticSwap.runes\   $!"TUU U sy>>Q  #)--T":":"B!"QRR R sz??S!2!BCC C C!"]^^ ^; dk&9""t{   9((33 Ys^   &"("@AS"T"TD #3:..Y  =tyIII 11333,,sD$5dk,JJr3c td|tdtd|td|tt d}g}|D]Y} t | dkrt dt | dkr"|t| Ztd|tfd |D} td | | t |krCtd t} | |d | d fSt } t} d}dd}j dz}tjfd|Dtjt |}tjfd|Dtjdt |z}fdD}t#j|| }t}|t+tjtj}j }t3j|| |||||||j \}}} |tddS|}t;t |dzD]X}|j|d|z}|j|d|zdz}|tA||fddY|td|!}tEfd|D}d | |fS)aFind a swap circuit that implements a permutation for this layer. The goal is to swap qubits such that qubits in the same two-qubit gates are adjacent. Based on S. Bravyi's algorithm. Args: layer_partition (list): The layer_partition is a list of (qu)bit lists and each qubit is a tuple (qreg, index). layout (Layout): The layout is a Layout object mapping virtual qubits in the input circuit to physical qubits in the coupling graph. It reflects the current positions of the data. qubit_subset (list): The qubit_subset is the set of qubits in the coupling graph that we have chosen to map into, as tuples (Register, index). coupling (CouplingMap): Directed graph representing a coupling map. This coupling map should be one that was provided to the stochastic mapper. trials (int): Number of attempts the randomized algorithm makes. Returns: Tuple: success_flag, best_circuit, best_depth, best_layout If success_flag is True, then best_circuit contains a DAGCircuit with the swap circuit, best_depth contains the depth of the swap circuit, and best_layout contains the new positions of the data qubits after the swap circuit has been applied. Raises: TranspilerError: if anything went wrong. z'layer_permutation: layer_partition = %szlayer_permutation: layout = %sz$layer_permutation: qubit_subset = %szlayer_permutation: trials = %sr5zLayer contains > 2-qubit gateszlayer_permutation: gates = %sc3zK|]5}jj|dj|dfV6dS)rrN) _dist_matrix_v2p).0gcouplinglayouts r2 z4StochasticSwap._layer_permutation..sG^^ST8(QqT):FK!.s2 = =S\\#   $ = = = = = =r3)dtypecountc3VK|]#}|D]}|jV$dSrSrT)rMgaterWrDs r2rQz4StochasticSwap._layer_permutation..s? G G$ G G3S\\#   $ G G G G G G Gr3cLi|] \}}|j|!SrT)rMkvrDs r2 z5StochasticSwap._layer_permutation..s,aaatq!#,,q///aaar3)rXr*zlayer_permutation: failed!)FNNNrr]Fcheckzlayer_permutation: success!c2i|]\}}j||Sr])r8)rMr^r_ best_circuits r2r`z5StochasticSwap._layer_permutation..s'RRR!Q<.q11RRRr3)#r@rAget_virtual_bitsrr6r appendr?sumr add_qregrrKr;fromiteruint32itemsrNLayoutsize add_qubitslistasarray get_edgesravelstochastic_swap_rs swap_trialsr*edgesranger/apply_operation_backr layout_mappingr )r0rDlayer_partitionrP qubit_subsetrOr)rEgates gate_argsdistcirc num_qubits best_depth best_edges best_layoutcdist2int_qubit_subset int_gatesry int_layout trial_circuitrvcdistidxswap_srcswap_tgtbest_layres ` ` ` @r2_layer_permutationz!StochasticSwap._layer_permutations+B  >PPP 5v7N7N7P7PQQQ ;\JJJ 5v>>>-S[[#>>( / /I9~~!!%&FGGG9~~"" U9--... 4e<<< ^^^^^X]^^^^^ 7>>> 3u::   LL; < < <<RRRSS\:x77r3ctd|td|j|dkrFtd|||t |jdntd||d||jdd S) aAdd swaps followed by the now mapped layer from the original circuit. Args: dag (DAGCircuit): The DAGCircuit object that the _mapper method is building layer (DAGCircuit): A DAGCircuit layer from the original circuit best_layout (Layout): layout returned from _layer_permutation best_depth (int): depth returned from _layer_permutation best_circuit (DAGCircuit): swap circuit returned from _layer_permutation zlayer_update: layout = %sz&layer_update: self.initial_layout = %srz5layer_update: there are swaps in this layer, depth %dTr8inline_capturesz.layer_update: there are no swaps in this layergraphN)r@rAr.composerpr8 reorder_bits)r0rDlayerrrres r2 _layer_updatezStochasticSwap._layer_updates  0+>>> =t?RSSS >> LLPR\ ] ] ] KK T,2E-F-FX\K ] ] ] ] LLI J J J 'N;#;#;CJ#G#GY]      r3c t|}tdt |D]'\}}td||d(|j}|j}d} |j s| } td|t |D]\}} | d ts| || d||||\} } } }td|td | t| | r#|}|j s|| | || | td |t | dD]\}}|d}| d }t#|jtr|| |||}Z| ||d||||\} } } }td ||td | t| | st)d|d||}|j s|| ||| | td|jtd||jd ||jd<n.||jd|j|jd<|j r|S| S)aMap a DAGCircuit onto a CouplingMap using swap gates. Args: circuit_graph (DAGCircuit): input DAG circuit coupling_graph (CouplingMap): coupling graph to map onto trials (int): number of trials. Returns: DAGCircuit: object containing a circuit equivalent to circuit_graph that respects couplings in coupling_graph Raises: TranspilerError: if there was any error during the mapping or with the parameters. z schedule:z %d: %s partitionNz layout = %sr)opzmapper: layer %dz%mapper: success_flag=%s,best_depth=%sz/mapper: failed, layer %d, retrying sequentiallyrzmapper: layer %d, sublayer %dz&mapper: success_flag=%s,best_depth=%s,zswap mapper failed: layer z , sublayer z mapper: self.initial_layout = %szmapper: layout = %s final_layout)rplayersr@rA enumerater.rfkeyscopyr,copy_empty_likeop_nodesrrstrr serial_layersr%r_controlflow_layer_updater property_setrr8)r0 circuit_graphcoupling_graphr) layerlistir_r{rPdagcircuit_outputr success_flagrerrj serial_layer layer_dagop_nodes r2rCzStochasticSwap._mappers"--//00  [!!!i(( : :DAq LLq!K. 9 9 9 9*;;==BBDD $))++!} @ - = = ? ?  ]F+++"),,; ; HAu>**m*<< FJF]F]!5#5v|^]cGGC lJ  /333 DlTWXbTcTcddd(F =**-uk:| LLJA N N N#,U7^-I-I-K-K#L#L% % <(1 #,,..q1gj-88!!;;)9fmFFMQLcLc%$[1$& MMI\<[LL!@!QGGGLL@,PST^P_P_ (^-.\1.\.\YZ.\.\]]])F=**-('&( ?% R  79LMMM *F333  ^ , 406D n - -06!.1=3G11D n - = !   r3c |d}t|jttt t fstd|g}g}|jjD]}| |} | | t|||| | j dt|jr't!t#||dd} n|} |jr| St'|j} t#||D]\} } t+||j| | |\}}|dr| ||d | t'| z} g}|D].} | j| | t9| /|j|}|dj}||||jd | S) a] Updates the new dagcircuit with a routed control flow operation. Args: dagcircuit_output (DAGCircuit): dagcircuit that is being built with routed operations. layer_dag (DAGCircuit): layer to route containing a single controlflow operation. current_layout (Layout): current layout coming into this layer. root_dag (DAGCircuit): root dag of pass Returns: Layout: updated layout after this layer has been routed. Raises: TranspilerError: if layer_dag does not contain a recognized ControlFlowOp. rz$unsupported control flow operation: rc:|ddS)NrTrecurse)depth)xs r2z:StochasticSwap._controlflow_layer_update..sadjjQUj>V>Vr3)keyraFrTrrb) rr%rrrrrr blocks_recursive_passrgrG_dag_from_blockrr_controlflow_exhaustive_acyclicmaxzipr,setr8rr( _new_seedrnr idle_wires remove_qubitsrreplace_blocksrxcargs)r0rrcurrent_layoutroot_dagnode block_dags block_layoutsblock inner_passr idle_qubitsrPupdated_dag_blockswap_dag swap_qubitsblock_circuitsnew_op new_qargss r2rz(StochasticSwap._controlflow_layer_updates"!!##A&$'Hil#STT Q!"O"O"OPP P  W^ Q QE--n==J   jnn_UD(-S-STT U U U  !8!H!M!M!O!O P P P P +47 3 3 *M:..4V4VLL*L =   (/** ),]J)G)G ? ? %F%$4$+V\HXHX%%% !Hk}}U}++ ^!))(;X\)]]] 30;;==>> >KK!+ E E  +  +[ 9 9  ! !.1B"C"C D D D D''77"1%, ..vy$*TY.ZZZr3c6|jdS)z"Get a seed for a new RNG instance.l)r+integers)r0s r2rzStochasticSwap._new_seedsx  !6777r3cx||j|j||j|S)zGet a new instance of this class to handle a recursive call for a control-flow block. Each pass starts with its own new seed, determined deterministically from our own.)r)r*r,r.)r1r(r)rr,)r0r.s r2rzStochasticSwap._recursive_passsA~~  ;!!])   r3)r!NFN)r!)__name__ __module__ __qualname____doc__rr$rGrrrCrrr __classcell__)r1s@r2rr0s  ^-K """""  "@'''Rt8t8t8l   0n!n!n!n!`AAAF888        r3r operationc4t|trt|jdkSt|tr|}t|jtjrS|jj }|j tj urd}nd|j tj ur d|jz}nFtd|dt|jt rdndt|jz}t"|vpt||kSdS)zReturn True if the entire control-flow operation represents a block that is guaranteed to be entered, and does not cycle back to the initial layout.rIrzunhandled target type: ''F)r%rr6rrcasesr&rExprtypekindrBoolUintwidth RuntimeErrorrr)rrtype_ max_matchess r2rrs )X&&*9#$$)))\** B!! i& 2 2 c$)EzUZ'' uz))5;. "#Fe#F#F#FGGG))*:EBBb!!SQZQaMbMbHbKu$AE k(AA 5r3c \t}|jD]}||||j|D]}|||D]}| || D]}| || ttjd|d|j|jd}t%t'jt+|j|jt+|j|j}||t3|||S)a Get a :class:`DAGCircuit` that represents the :class:`.QuantumCircuit` ``block`` embedded within the ``root_dag`` for full-width routing purposes. This means that all the qubits are in the output DAG, but only the necessary clbits and classical registers are.Tcaptures) vars_modeFrb)wires)r r-valuesri add_clbitsriter_input_vars add_input_variter_captured_varsadd_captured_variter_declared_varsadd_declared_varrxrrliftrqargsdict itertoolschainrr8clbitssubstitute_node_with_dagr)rrroutqregvardummywire_maps r2rrs ,,C%%'' T NN4:$$&& #''))"" S!!!!''))"" S!!!!  $ $4%"7"7*"7"M"MNN   %  E IOC dj$A$A3u|UYU_C`C`aabbH  u(=(=X NNN Jr3)3rrloggingmathrnumpyr;qiskit.convertersrrqiskit.circuit.classicalrrqiskit.circuit.quantumregisterrqiskit.transpiler.basepassesr qiskit.transpiler.exceptionsr qiskit.dagcircuitr %qiskit.circuit.library.standard_gatesr qiskit.transpiler.layoutr qiskit.transpiler.targetrqiskit.circuitrrrrrrrqiskit._acceleraterrtrqiskit.transpiler.passes.layoutr qiskit.utilsrutilsr getLoggerrr@rrrr]r3r2rs BA<<<<<<<<00000000::::::;;;;;;888888((((((::::::++++++++++++EDDDDD&&&&&&::::::''''''######  8 $ $p p p p p 'p p p f }*r3