/
basic.py
137 lines (114 loc) · 5.32 KB
/
basic.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
# This code is part of Qiskit.
#
# (C) Copyright IBM 2019.
#
# This code is licensed under the Apache License, Version 2.0. You may
# obtain a copy of this license in the LICENSE.txt file in the root directory
# of this source tree or at http://www.apache.org/licenses/LICENSE-2.0.
#
# Any modifications or derivative works of this code must retain this
# copyright notice, and modified files need to carry a notice indicating
# that they have been altered from the originals.
"""
The most straightforward scheduling methods: scheduling **as early** or **as late** as possible.
"""
from collections import defaultdict
from typing import List, Optional, Union
from qiskit.circuit.quantumcircuit import QuantumCircuit
from qiskit.circuit.barrier import Barrier
from qiskit.pulse.schedule import Schedule
from qiskit.scheduler.config import ScheduleConfig
from qiskit.scheduler.lowering import lower_gates
from qiskit.providers import BackendV1, BackendV2
def as_soon_as_possible(
circuit: QuantumCircuit,
schedule_config: ScheduleConfig,
backend: Optional[Union[BackendV1, BackendV2]] = None,
) -> Schedule:
"""
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.
"""
qubit_time_available = defaultdict(int)
def update_times(inst_qubits: List[int], time: int = 0) -> None:
"""Update the time tracker for all inst_qubits to the given time."""
for q in inst_qubits:
qubit_time_available[q] = time
start_times = []
circ_pulse_defs = lower_gates(circuit, schedule_config, backend)
for circ_pulse_def in circ_pulse_defs:
start_time = max(qubit_time_available[q] for q in circ_pulse_def.qubits)
stop_time = start_time
if not isinstance(circ_pulse_def.schedule, Barrier):
stop_time += circ_pulse_def.schedule.duration
start_times.append(start_time)
update_times(circ_pulse_def.qubits, stop_time)
timed_schedules = [
(time, cpd.schedule)
for time, cpd in zip(start_times, circ_pulse_defs)
if not isinstance(cpd.schedule, Barrier)
]
schedule = Schedule.initialize_from(circuit)
for time, inst in timed_schedules:
schedule.insert(time, inst, inplace=True)
return schedule
def as_late_as_possible(
circuit: QuantumCircuit,
schedule_config: ScheduleConfig,
backend: Optional[Union[BackendV1, BackendV2]] = None,
) -> Schedule:
"""
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.
"""
qubit_time_available = defaultdict(int)
def update_times(inst_qubits: List[int], time: int = 0) -> None:
"""Update the time tracker for all inst_qubits to the given time."""
for q in inst_qubits:
qubit_time_available[q] = time
rev_stop_times = []
circ_pulse_defs = lower_gates(circuit, schedule_config, backend)
for circ_pulse_def in reversed(circ_pulse_defs):
start_time = max(qubit_time_available[q] for q in circ_pulse_def.qubits)
stop_time = start_time
if not isinstance(circ_pulse_def.schedule, Barrier):
stop_time += circ_pulse_def.schedule.duration
rev_stop_times.append(stop_time)
update_times(circ_pulse_def.qubits, stop_time)
last_stop = max(t for t in qubit_time_available.values()) if qubit_time_available else 0
start_times = [last_stop - t for t in reversed(rev_stop_times)]
timed_schedules = [
(time, cpd.schedule)
for time, cpd in zip(start_times, circ_pulse_defs)
if not isinstance(cpd.schedule, Barrier)
]
schedule = Schedule.initialize_from(circuit)
for time, inst in timed_schedules:
schedule.insert(time, inst, inplace=True)
return schedule