g :dZddlmZddlmZmZmZddlmZddl m Z ddl m Z ddl mZddlmZdd lmZmZdd lmZed  ddededeeeefde fdZed  ddededeeeefde fdZd S)zb The most straightforward scheduling methods: scheduling **as early** or **as late** as possible. ) defaultdict)ListOptionalUnion)QuantumCircuit)Barrier)Schedule)ScheduleConfig) lower_gates) BackendV1 BackendV2)deprecate_pulse_dependencyT)moving_to_dynamicsNcircuitschedule_configbackendreturnc" tt d dttdtddf fd }g}t|||}|D]s}t fd|jD}|}t |jts||jj z }| |||j|tdt||D} tj |} | D]\} } | | | d | S) a6 Return the pulse Schedule which implements the input circuit using an "as soon as possible" (asap) scheduling policy. Circuit instructions are first each mapped to equivalent pulse Schedules according to the command definition given by the schedule_config. Then, this circuit instruction-equivalent Schedule is appended at the earliest time at which all qubits involved in the instruction are available. Args: circuit: The quantum circuit to translate. schedule_config: Backend specific parameters used for building the Schedule. backend: A backend used to build the Schedule, the backend could be BackendV1 or BackendV2. Returns: A schedule corresponding to the input ``circuit`` with pulses occurring as early as possible. r inst_qubitstimerNc|D]}||<dSz>Update the time tracker for all inst_qubits to the given time.Nrrqqubit_time_availables T/granary/edev/quantum/lib/python3.11/site-packages/qiskit/scheduler/methods/basic.py update_timesz)as_soon_as_possible..update_times8* + +A&*  # # + +c3(K|] }|V dSNr.0rrs r z&as_soon_as_possible..@)PPQ-a0PPPPPPr cZg|](\}}t|jt||jf)Sr isinstanceschedulerr$rcpds r z'as_soon_as_possible..HE D##,00 s|r Tinplacer)rintrr maxqubitsr)r*rdurationappendzipr initialize_frominsert)rrrr start_timescirc_pulse_defscirc_pulse_def start_time stop_timetimed_schedulesr*rinstrs @ras_soon_as_possiblerAs^2's++++$s)+3+t++++++ K!'?GDDO)77PPPP.:OPPPPP  .17;; : 09 9I:&&& ^*I6666[/::O '00H%22 ddD1111 Or cttd dttdtddffd }g}t|||}t |D]s}t fd|jD}|}t|jts||jj z }| |||j|tr+t d Dndfd t |D} d t| |D} tj|} | D]\} } | | | d | S)a Return the pulse Schedule which implements the input circuit using an "as late as possible" (alap) scheduling policy. Circuit instructions are first each mapped to equivalent pulse Schedules according to the command definition given by the schedule_config. Then, this circuit instruction-equivalent Schedule is appended at the latest time that it can be without allowing unnecessary time between instructions or allowing instructions with common qubits to overlap. This method should improves the outcome fidelity over ASAP scheduling, because we may maximize the time that the qubit remains in the ground state. Args: circuit: The quantum circuit to translate. schedule_config: Backend specific parameters used for building the Schedule. backend: A backend used to build the Schedule, the backend could be BackendV1 or BackendV2. Returns: A schedule corresponding to the input ``circuit`` with pulses occurring as late as possible. rrrrNc|D]}||<dSrrrs rrz)as_late_as_possible..update_timesqrr c3(K|] }|V dSr"rr#s rr%z&as_late_as_possible..yr&r c3K|]}|VdSr"r)r$ts rr%z&as_late_as_possible..s"==!A======r cg|]}|z Srr)r$rF last_stops rr-z'as_late_as_possible..sCCCQ9q=CCCr cZg|](\}}t|jt||jf)Srr(r+s rr-z'as_late_as_possible..r.r Tr/r1)rr2rr reversedr3r4r)r*rr5r6valuesr7r r8r9)rrrrrev_stop_timesr;r<r=r>r:r?r*rr@rHrs @@ras_late_as_possiblerMSs8's++++$s)+3+t++++++ N!'?GDDO"?3377PPPP.:OPPPPP  .17;; : 09 9Ii((( ^*I6666AU\==3::<<======[\ICCCC(>*B*BCCCK[/::O '00H%22 ddD1111 Or r")__doc__ collectionsrtypingrrrqiskit.circuit.quantumcircuitrqiskit.circuit.barrierrqiskit.pulse.scheduler qiskit.scheduler.configr qiskit.scheduler.loweringr qiskit.providersr r qiskit.utils.deprecate_pulserrArMrr rrXs$#####((((((((((888888************22222211111111111111CCCCCCt4446:22 2#2eIy01 22 222542jt4446:88 8#8eIy01 28 88854888r