z i-SrSSKJr SSKJr SSKrSSKJrJrJ r SSK J r SSK J r Jr SSKJr SS KJr SS KJr SS KJr \R."\5r"S S \5rg)z$Padding pass to fill empty timeslot.) annotations)IterableN)QubitClbit Instruction)Delay) DAGCircuitDAGNode)TransformationPass)TranspilerError)Target)InstructionDurationsc^\rSrSrSrS S U4SjjjrSrS SjrSSjrS Sjr SSSjjr SS jr S r U=r $) BasePaddingaThe base class of padding pass. This pass requires one of scheduling passes to be executed before itself. Since there are multiple scheduling strategies, the selection of scheduling pass is left in the hands of the pass manager designer. Once a scheduling analysis pass is run, ``node_start_time`` is generated in the :attr:`property_set`. This information is represented by a python dictionary of the expected instruction execution times keyed on the node instances. Entries in the dictionary are only created for non-delay nodes. The padding pass expects all ``DAGOpNode`` in the circuit to be scheduled. This base class doesn't define any sequence to interleave, but it manages the location where the sequence is inserted, and provides a set of information necessary to construct the proper sequence. Thus, a subclass of this pass just needs to implement :meth:`_pad` method, in which the subclass constructs a circuit block to insert. This mechanism removes lots of boilerplate logic to manage whole DAG circuits. Note that padding pass subclasses should define interleaving sequences satisfying: - Interleaved sequence does not change start time of other nodes - Interleaved sequence should have total duration of the provided ``time_interval``. Any manipulation violating these constraints may prevent this base pass from correctly tracking the start time of each instruction, which may result in violation of hardware alignment constraints. c:>[TU]5 XlX lg)zBasePadding initializer. Args: target: The :class:`~.Target` representing the target backend. If it supplied and it does not support delay instruction on a qubit, padding passes do not pad any idle time of the qubit. N)super__init__target durations)selfrr __class__s r/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/transpiler/passes/scheduling/padding/base_padding.pyrBasePadding.__init__:s  "cURS:XaURR$URS:XagUR(dUR(dgUR Vs/sHo2R U5RPM nnUR(aURRUR5nU(dgUR[U55nU(dgURRc UR$URRUR5nU$URRURU5$s snf)z,Get duration of a given node in the circuit.delaybarrierrN) nameopdurationrrqargsfind_bitindexgettupledt seconds_to_dt)rnodedagqargindices props_dictpropsress r get_durationBasePadding.get_durationJs 99 77## # 99 !{{4>>8< C <<%++ C ;;3JNN5>2E{{~~%~~%kk//? ~~!!$))W55Ds)$Ec URU5 URSR5n[5nURR 5HnUR U5 M URR 5HnURU5 M URSR5 URUl URUl URSUl URUl URVs0sHofS_M nnSnUR5GH8n X;GaX)n UR!X5n X-n [#X5n[%U R&[(5(aUR+U 5 M`U R,H~nXU- S:alUR/UR1U5R25(a=[5UR7UR8U55n UR;UUXvU U U S9 XU'M UR=X:U R&U R,U R>5 GM#[AS[CU 5S35e URHnXU- S:dMUR/UR1U5R25(dMAUR8Un [5UR7U 55n UR;UUXvUU U S9 M Xl"U$s snf)aRun the padding pass on ``dag``. Args: dag: DAG to be checked. Returns: DAGCircuit: DAG with idle time filled with instructions. Raises: TranspilerError: When a particular node is not scheduled, likely some transform pass is inserted before this node is called. node_start_time time_unitr)r*qubitt_startt_end next_node prev_nodez Operation zb is likely added after the circuit is scheduled. Schedule the circuit again if you transformed it.)# _pre_runhook property_setcopyr qregsvaluesadd_qregcregsadd_cregclearrmetadata_unit global_phasequbitstopological_op_nodesr0max isinstancer rremove_op_noder"_BasePadding__delay_supportedr#r$next predecessors output_map_pad_apply_scheduled_opcargsr repr _duration)rr*r3new_dagqregcregbit idle_aftercircuit_durationr)t0durt1r9s rrunBasePadding.runcs #++,=>CCE,II$$&D   T "'II$$&D   T "' +,224xx <<))+6 "//(+ 3 1f 3 ,,.D&$*''2X#&'7#< dggu--&&t,::CsO+a/D4J4J3<P>PQT>U)V$W  '"%$.O"$&*&/ "')sO& ((dggtzz4::V% d -HHA/L>>CS/1A5$:P:P S!'';;))#. !5!5d!;<  &O*"'  "-}4s Lc`URb URRSU4S9(agg)z8Delay operation is supported on the qubit (qarg) or not.r)r"TF)rinstruction_supported)rr+s r__delay_supportedBasePadding.__delay_supporteds, ;; $++"C"CGTXSZ"C"[rcXSUR;a0[SURSURRS35eURSS:Xa [S5e[ UR 5H3up#URU5(aM[RSU5 M5 g ) zExtra routine inserted before running the padding pass. Args: dag: DAG circuit on which the sequence is applied. Raises: TranspilerError: If the whole circuit or instruction is not scheduled. r3zThe input circuit zD is not scheduled. Call one of scheduling passes before running the z pass.r4stretchz9Scheduling cannot run on circuits with stretch durations.z6No padding on qubit %d as delay is not supported on itN) r;r rr__name__ enumeraterFrKloggerdebug)rr*r+_s rr:BasePadding._pre_runhooks D$5$5 5!$SXXJ/&&*nn&=&=%>fF    [ )Y 6!"]^ ^ ,GD))$// L-rc[U[5(aU/n[U[5(aU/nURX4USS9nX RSU'g)aAdd new operation to DAG with scheduled information. This is identical to apply_operation_back + updating the node_start_time property. Args: dag: DAG circuit on which the sequence is applied. t_start: Start time of new node. oper: New operation that is added to the DAG circuit. qubits: The list of qubits that the operation acts on. clbits: The list of clbits that the operation acts on. F)r"rQcheckr3N)rIrrapply_operation_backr;)rr*r6operrFclbitsnew_nodes rrPBasePadding._apply_scheduled_opsX& fe $ $XF fe $ $XF++DfTY+Z9@+,X6rc[e)a5Interleave instruction sequence in between two nodes. .. note:: If a DAGOpNode is added here, it should update node_start_time property in the property set so that the added node is also scheduled. This is achieved by adding operation via :meth:`_apply_scheduled_op`. .. note:: This method doesn't check if the total duration of new DAGOpNode added here is identical to the interval (``t_end - t_start``). A developer of the pass must guarantee this is satisfied. If the duration is greater than the interval, your circuit may be compiled down to the target code with extra duration on the backend compiler, which is then played normally without error. However, the outcome of your circuit might be unexpected due to erroneous scheduling. Args: dag: DAG circuit that sequence is applied. qubit: The wire that the sequence is applied on. t_start: Absolute start time of this interval. t_end: Absolute end time of this interval. next_node: Node that follows the sequence. prev_node: Node ahead of the sequence. )NotImplementedError)rr*r5r6r7r8r9s rrOBasePadding._pads D"!r)rr)NN)rr rr)r*r )r+intreturnbool)) r*r r6rurnrrFzQubit | Iterable[Qubit]rozClbit | Iterable[Clbit]) r*r r5rr6rur7rur8r r9r )re __module__ __qualname____firstlineno____doc__rr0r]rKr:rPrO__static_attributes__ __classcell__)rs@rrrs:*.##(## 62_B <+- A AA A ( A ( A6"" """" ""  ""  """"""rr)r| __future__rcollections.abcrloggingqiskit.circuitrrrqiskit.circuit.delayrqiskit.dagcircuitr r qiskit.transpiler.basepassesr qiskit.transpiler.exceptionsr qiskit.transpiler.targetr 'qiskit.transpiler.instruction_durationsr getLoggerrergrrxrrrsJ+"$44&1;8+H   8 $A"$A"r