CrosstalkAdaptiveSchedule¶

class
CrosstalkAdaptiveSchedule
(*args, **kwargs)[source]¶ Crosstalk mitigation through adaptive instruction scheduling.
CrosstalkAdaptiveSchedule initializer.
 Parameters
backend_prop (BackendProperties) – backend properties object
crosstalk_prop (dict) –
crosstalk properties object crosstalk_prop[g1][g2] specifies the conditional error rate of g1 when g1 and g2 are executed simultaneously. g1 should be a twoqubit tuple of the form (x,y) where x and y are physical qubit ids. g2 can be either twoqubit tuple (x,y) or singlequbit tuple (x). We currently ignore crosstalk between pairs of singlequbit gates. Gate pairs which are not specified are assumed to be crosstalk free.
Example:
crosstalk_prop = {(0, 1) : {(2, 3) : 0.2, (2) : 0.15}, (4, 5) : {(2, 3) : 0.1}, (2, 3) : {(0, 1) : 0.05, (4, 5): 0.05}}
The keys of the crosstalk_prop are tuples for ordered tuples for CX gates e.g., (0, 1) corresponding to CX 0, 1 in the hardware. Each key has an associated value dict which specifies the conditional error rates with nearby gates e.g.,
(0, 1) : {(2, 3) : 0.2, (2) : 0.15}
means that CNOT 0, 1 has an error rate of 0.2 when it is executed in parallel with CNOT 2,3 and an error rate of 0.15 when it is executed in parallel with a single qubit gate on qubit 2.weight_factor (float) – weight of gate error/crosstalk terms in the objective \(weight_factor*fidelities + (1weight_factor)*decoherence errors\). Weight can be varied from 0 to 1, with 0 meaning that only decoherence errors are optimized and 1 meaning that only crosstalk errors are optimized. weight_factor should be tuned per application to get the best results.
measured_qubits (list) – a list of qubits that will be measured in a particular circuit. This arg need not be specified for circuits which already include measure gates. The arg is useful when a subsequent module such as state_tomography_circuits inserts the measure gates. If CrosstalkAdaptiveSchedule is made aware of those measurements, it is included in the optimization.
 Raises
ImportError – if unable to import z3 solver
Attributes
Check if the pass is an analysis pass.
Check if the pass is a transformation pass.
Methods
ID for each gate
Basic variable bounds for optimization
gate2 is a DAG dependent of gate1 if it is a descendant of gate1
Check if two gates have a crosstalk dependency.
Set decoherence errors based on qubit lifetimes
Given a set of layers and barries, construct a new dag
Setup the variables required for Z3 optimization
Representation for twoqubit gate Note: current implementation assumes that the CX error rates and crosstalk behavior are independent of gate direction
Z3 outputs start times for each gate.
Extract the set of program gates which potentially have crosstalk noise
Gate A, B are overlapping if A is neither a descendant nor an ancestor of B.
Extract gate start and finish times from Z3 solution
Set gate fidelity based on gate overlap conditions
For a gate G and layer L, L is a candidate layer for G if no gate in L has a DAG dependency with G, and if Z3 allows gates in L and G to overlap.
CrosstalkAdaptiveSchedule.find_layer
(layers, …)Find the appropriate layer for a gate
Representation for gate
For each gate g, see if a barrier is required to serialize it with some previously processed gate
Given two conditional gate error rates check if there is high crosstalk by comparing with independent error rates.
Return the name of the pass.
Objective function is a weighted combination of gate errors and decoherence errors
This function assumes that gate durations and coherence times are in seconds in backend.properties() This function converts gate durations and coherence times to nanoseconds.
CrosstalkAdaptiveSchedule.powerset
(iterable)Finds the set of all subsets of the given iterable This function is used to generate constraints for the Z3 optimization
Convert Z3 Real to Python float
Reset variables
Main scheduling function
DAG scheduling constraints optimization Sets overlap indicator variables
Representation for singlequbit gate
Setup and solve a Z3 optimization for finding the best schedule