§ º³Ùg‰;ãó¢—dZddlZddlmZmZmZmZddlmZddl m Z m Z m Z ddl mZddlmZddlmZdd lmZdd lmZGd „d e¦«ZdS) zBase circuit scheduling pass.éN)ÚDelayÚGateÚMeasureÚReset)ÚParameterExpression)Ú DAGOpNodeÚ DAGCircuitÚ DAGOutNode)ÚTransformationPass)ÚTranspilerError)ÚInstructionDurations)ÚTimeUnitConversion)ÚTargetc 󆇗eZdZdZeefZ ddededede fˆfd„ Z e d e d e d efd „¦«Zd ed efd„Zd e fd„ZˆxZS)ÚBaseSchedulerTransformu1'Base scheduler pass. .. warning:: This base class is not part of the public interface for this module it should not be used to develop new scheduling passes as the passes which are using this are pending a future deprecation and subsequent removal. If you are developing new scheduling passes look at the ``BaseScheduler`` class instead which is used in the new scheduling pass workflow. Policy of topological node ordering in scheduling The DAG representation of ``QuantumCircuit`` respects the node ordering also in the classical register wires, though theoretically two conditional instructions conditioned on the same register are commute, i.e. read-access to the classical register doesn't change its state. .. code-block:: text qc = QuantumCircuit(2, 1) qc.delay(100, 0) qc.x(0).c_if(0, True) qc.x(1).c_if(0, True) The scheduler SHOULD comply with above topological ordering policy of the DAG circuit. Accordingly, the `asap`-scheduled circuit will become .. code-block:: text ┌────────────────┠┌───┠q_0: ┤ Delay(100[dt]) ├───┤ X ├────────────── ├────────────────┤ └─╥─┘ ┌───┠q_1: ┤ Delay(100[dt]) ├─────╫────────┤ X ├─── └────────────────┘ â•‘ └─╥─┘ ┌────╨────â”┌────╨────┠c: 1/â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•¡ c_0=0x1 â•žâ•¡ c_0=0x1 â•ž └─────────┘└─────────┘ Note that this scheduling might be inefficient in some cases, because the second conditional operation can start without waiting the delay of 100 dt. However, such optimization should be done by another pass, otherwise scheduling may break topological ordering of the original circuit. Realistic control flow scheduling respecting for microarchitecture In the dispersive QND readout scheme, qubit is measured with microwave stimulus to qubit (Q) followed by resonator ring-down (depopulation). This microwave signal is recorded in the buffer memory (B) with hardware kernel, then a discriminated (D) binary value is moved to the classical register (C). The sequence from t0 to t1 of the measure instruction interval might be modeled as follows: .. code-block:: text Q â–‘â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–‘ B â–‘â–‘â–’â–’â–’â–’â–’â–’â–’â–’â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘ D â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–’â–’â–’â–’â–’â–’â–‘â–‘â–‘ C â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–’â–’â–‘ However, ``QuantumCircuit`` representation is not enough accurate to represent this model. In the circuit representation, thus ``Qubit`` is occupied by the stimulus microwave signal during the first half of the interval, and ``Clbit`` is only occupied at the very end of the interval. This precise model may induce weird edge case. .. code-block:: text ┌───┠q_0: ───┤ X ├────── └─╥─┘ ┌─┠q_1: ─────╫─────┤M├ ┌────╨────â”└╥┘ c: 1/â•¡ c_0=0x1 â•žâ•â•©â• └─────────┘ 0 In this example, user may intend to measure the state of ``q_1``, after ``XGate`` is applied to the ``q_0``. This is correct interpretation from viewpoint of the topological node ordering, i.e. x gate node come in front of the measure node. However, according to the measurement model above, the data in the register is unchanged during the stimulus, thus two nodes are simultaneously operated. If one `alap`-schedule this circuit, it may return following circuit. .. code-block:: text ┌────────────────┠┌───┠q_0: ┤ Delay(500[dt]) ├───┤ X ├────── └────────────────┘ └─╥─┘ ┌─┠q_1: ───────────────────────╫─────┤M├ ┌────╨────â”└╥┘ c: 1/â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•¡ c_0=0x1 â•žâ•â•©â• └─────────┘ 0 Note that there is no delay on ``q_1`` wire, and the measure instruction immediately start after t=0, while the conditional gate starts after the delay. It looks like the topological ordering between the nodes are flipped in the scheduled view. This behavior can be understood by considering the control flow model described above, .. code-block:: text : Quantum Circuit, first-measure 0 â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–’â–’â–’â–’â–’â–’â–‘ 1 â–‘â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–‘ : In wire q0 Q â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–’â–’â–’â–‘ C â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–’â–’â–‘â–‘â–‘â–‘â–‘ : In wire q1 Q â–‘â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–‘ B â–‘â–‘â–’â–’â–’â–’â–’â–’â–’â–’â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘ D â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–’â–’â–’â–’â–’â–’â–‘â–‘â–‘ C â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–’â–’â–‘ Since there is no qubit register (Q0, Q1) overlap, the node ordering is determined by the shared classical register C. As you can see, the execution order is still preserved on C, i.e. read C then apply ``XGate``, finally store the measured outcome in C. Because ``DAGOpNode`` cannot define different durations for associated registers, the time ordering of two nodes is inverted anyways. This behavior can be controlled by ``clbit_write_latency`` and ``conditional_latency``. The former parameter determines the delay of the register write-access from the beginning of the measure instruction t0, and another parameter determines the delay of conditional gate operation from t0 which comes from the register read-access. Since we usually expect topological ordering and time ordering are identical without the context of microarchitecture, both latencies are set to zero by default. In this case, ``Measure`` instruction immediately locks the register C. Under this configuration, the `alap`-scheduled circuit of above example may become .. code-block:: text ┌───┠q_0: ───┤ X ├────── └─╥─┘ ┌─┠q_1: ─────╫─────┤M├ ┌────╨────â”└╥┘ c: 1/â•¡ c_0=0x1 â•žâ•â•©â• └─────────┘ 0 If the backend microarchitecture supports smart scheduling of the control flow, i.e. it may separately schedule qubit and classical register, insertion of the delay yields unnecessary longer total execution time. .. code-block:: text : Quantum Circuit, first-xgate 0 â–‘â–’â–’â–’â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘ 1 â–‘â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–‘ : In wire q0 Q â–‘â–’â–’â–’â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘ C â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘ (zero latency) : In wire q1 Q â–‘â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–‘ C â–‘â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–‘ (zero latency, scheduled after C0 read-access) However this result is much more intuitive in the topological ordering view. If finite conditional latency is provided, for example, 30 dt, the circuit is scheduled as follows. .. code-block:: text ┌───────────────┠┌───┠q_0: ┤ Delay(30[dt]) ├───┤ X ├────── ├───────────────┤ └─╥─┘ ┌─┠q_1: ┤ Delay(30[dt]) ├─────╫─────┤M├ └───────────────┘┌────╨────â”└╥┘ c: 1/â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•â•¡ c_0=0x1 â•žâ•â•©â• └─────────┘ 0 with the timing model: .. code-block:: text : Quantum Circuit, first-xgate 0 â–‘â–‘â–’â–’â–’â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘ 1 â–‘â–‘â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–‘ : In wire q0 Q â–‘â–‘â–’â–’â–’â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘ C â–‘â–’â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘â–‘ (30dt latency) : In wire q1 Q â–‘â–‘â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–‘ C â–‘â–‘â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–’â–‘ See https://arxiv.org/abs/2102.01682 for more details. NrÚ durationsÚclbit_write_latencyÚconditional_latencyÚtargetcó•—t¦« ¦«||_|| ¦«|_|j t |j¦«¦«||_||_||_dS)aóScheduler initializer. Args: durations: Durations of instructions to be used in scheduling clbit_write_latency: A control flow constraints. Because standard superconducting quantum processor implement dispersive QND readout, the actual data transfer to the clbit happens after the round-trip stimulus signal is buffered and discriminated into quantum state. The interval ``[t0, t0 + clbit_write_latency]`` is regarded as idle time for clbits associated with the measure instruction. This defaults to 0 dt which is identical to Qiskit Pulse scheduler. conditional_latency: A control flow constraints. This value represents a latency of reading a classical register for the conditional operation. The gate operation occurs after this latency. This appears as a delay in front of the DAGOpNode of the gate. This defaults to 0 dt. target: The :class:`~.Target` representing the target backend, if both ``durations`` and this are specified then this argument will take precedence and ``durations`` will be ignored. N) ÚsuperÚ__init__rÚrequiresÚappendrrrr)ÚselfrrrrÚ __class__s €úh/granary/edev/quantum/lib/python3.11/site-packages/qiskit/transpiler/passes/scheduling/base_scheduler.pyrzBaseSchedulerTransform.__init__Ýsyø€õ6 ‰Œ×ÒÑÔÐØ"ˆŒà Ð Ø#×-Ò-Ñ/Ô/ˆDŒNØ Œ ×ÒÕ/°´Ñ?Ô?Ñ@Ô@Ð@ð$7ˆÔ Ø#6ˆÔ àˆŒ ˆ ˆ óÚnodeÚdagÚreturnc ó懗ˆfd„|jD¦«}‰ |¦«rUt|¦«td„|jjD¦«¦«f}‰j|jj|j}n |jj}t|jt¦«rtj d¦«n]t|jt¦«rCtd„‰ |¦«D¦«¦« }|rtj d¦«t|t¦«r#t!d|›d|jj›d|›d ¦«‚|€ t!d |jj›d|›d ¦«‚|S) z9A helper method to get duration from node or calibration.cóD•—g|]}‰ |¦«j‘ŒS©)Úfind_bitÚindex)Ú.0Úqargr s €rú z=BaseSchedulerTransform._get_node_duration.. s(ø€ÐCÐCÐC°3—<’< Ñ%Ô%Ô+ÐCÐCÐCrc3ó4K—|]}t|¦«V—ŒdS©N)Úfloat)r'Úps rú z.s(èè€Ð+MÐ+M¸­E°!©H¬HÐ+MÐ+MÐ+MÐ+MÐ+MÐ+Mrz¿Qiskit scheduler assumes Reset works similarly to Measure instruction. Actual behavior depends on the control system of your quantum backend. Your backend may provide a plugin scheduler pass.c3ó@K—|]}t|t¦«V—ŒdSr+)Ú isinstancer )r'Úxs rr.z.s=èè€ð%ð%Ø./• ˜1jÑ)Ô)ð%ð%ð%ð%ð%ð%rz¯Qiskit scheduler assumes mid-circuit measurement works as a standard instruction. Actual backend may apply custom scheduling. Your backend may provide a plugin scheduler pass.zParameterized duration (z) of z on qubits z is not bounded.Nz Duration of z is not found.)ÚqargsÚ_has_calibration_forÚtupleÚopÚparamsÚ_calibrations_propÚnameÚdurationr0rÚwarningsÚwarnrÚanyÚquantum_successorsrr )rr ÚindicesÚcal_keyr9Úis_mid_circuits ` rÚ_get_node_durationz)BaseSchedulerTransform._get_node_durationsÈø€ð DÐCÐCÐC¸¼ ÐCÑCÔCˆà × #Ò # DÑ )Ô )ð (å˜G‘n”n¥eÐ+MÐ+M¸d¼g¼nÐ+MÑ+MÔ+MÑ&MÔ&MÐMˆGØÔ-¨d¬g¬lÔ;¸GÔDÔMˆHˆHà”wÔ'ˆHå d”guÑ %Ô %ð Ý ŒMðDñ ô ð ð õ ˜œ¥Ñ )Ô )ð Ý!$ð%ð%Ø36×3IÒ3IÈ$Ñ3OÔ3Oð%ñ%ô%ñ"ô"ðˆNðð Ý” ðHñôðõ hÕ 3Ñ 4Ô 4ð Ý!ðI¨8ðIðIØ”g”lðIðIØ/6ðIðIðIñôð ð Ð Ý!Ð"a°´´Ð"aÐ"aÈ'Ð"aÐ"aÐ"aÑbÔbÐ bàˆrr(cóR—|j|j d|f¬¦«rdSdS)z8Delay operation is supported on the qubit (qarg) or not.NÚdelay)r2TF)rÚinstruction_supported)rr(s rÚ_delay_supportedz'BaseSchedulerTransform._delay_supported/s2€à Œ;Ð  $¤+×"CÒ"CÀGÐTXÐSZÐ"CÑ"[Ô"[Ð Ø4؈urcó—t‚r+)ÚNotImplementedError)rr s rÚrunzBaseSchedulerTransform.run5s€Ý!Ð!r)NrrN)Ú__name__Ú __module__Ú __qualname__Ú__doc__rrÚCONDITIONAL_SUPPORTEDr ÚintrrÚ staticmethodrr rAÚboolrErHÚ __classcell__)rs@rrrsø€€€€€ð~ð~ð@" 5˜MÐð+/Ø#$Ø#$Øð &ð&à'ð&ð!ð&ð!ð &ð ð &ð&ð&ð&ð&ð&ðPð'Øð'à ð'ð ð'ð'ð'ñ„\ð'ðR Sð¨Tððððð "zð"ð"ð"ð"ð"ð"ð"ð"rr)rLr:Úqiskit.circuitrrrrÚ"qiskit.circuit.parameterexpressionrÚqiskit.dagcircuitrr r Úqiskit.transpiler.basepassesr Úqiskit.transpiler.exceptionsr Ú'qiskit.transpiler.instruction_durationsr Ú8qiskit.transpiler.passes.scheduling.time_unit_conversionrÚqiskit.transpiler.targetrrr$rrúrZsðð$Ð#Ø€€€à6Ð6Ð6Ð6Ð6Ð6Ð6Ð6Ð6Ð6Ð6Ð6ØBÐBÐBÐBÐBÐBØ?Ð?Ð?Ð?Ð?Ð?Ð?Ð?Ð?Ð?Ø;Ð;Ð;Ð;Ð;Ð;Ø8Ð8Ð8Ð8Ð8Ð8ØHÐHÐHÐHÐHÐHØWÐWÐWÐWÐWÐWØ+Ð+Ð+Ð+Ð+Ð+ð\"ð\"ð\"ð\"ð\"Ð/ñ\"ô\"ð\"ð\"ð\"r