qiskit/transpiler/passes/collect_2q_blocks.py
def run(self, dag):
        """collect blocks of adjacent gates acting on a pair of "cx" qubits.

        The blocks contain "op" nodes in topological sort order
        such that all gates in a block act on the same pair of
        qubits and are adjacent in the circuit. the blocks are built
        by examining predecessors and successors of "cx" gates in
        the circuit. u1, u2, u3, cx, id gates will be included.

        Return a list of tuples of "op" node labels.
        """
        # Initiate the commutation set
        self.property_set['commutation_set'] = defaultdict(list)

        good_names = ["cx", "u1", "u2", "u3", "id"]
        block_list = []
        nodes = list(dag.topological_nodes())
        nodes_seen = dict(zip(nodes, [False] * len(nodes)))
        for nd in dag.topological_op_nodes():
            group = []
            # Explore predecessors and successors of cx gates
            if nd.name == "cx" and nd.condition is None and not nodes_seen[nd]:
                these_qubits = sorted(nd.qargs)
                # Explore predecessors of the "cx" node
                pred = list(dag.predecessors(nd))
                explore = True
                while explore:
                    pred_next = []
                    # If there is one predecessor, add it if it's on the right qubits
                    if len(pred) == 1 and not nodes_seen[pred[0]]:
                        pnd = pred[0]
                        if pnd.name in good_names:
                            if (pnd.name == "cx" and sorted(pnd.qargs) == these_qubits) or \
                                    pnd.name != "cx":
                                group.append(pnd)
                                nodes_seen[pnd] = True
                                pred_next.extend(dag.predecessors(pnd))
                    # If there are two, then we consider cases
                    elif len(pred) == 2:
                        # First, check if there is a relationship
                        if pred[0] in dag.predecessors(pred[1]):
                            sorted_pred = [pred[1]]   # was [pred[1], pred[0]]
                        elif pred[1] in dag.predecessors(pred[0]):
                            sorted_pred = [pred[0]]   # was [pred[0], pred[1]]
                        else:
                            # We need to avoid accidentally adding a cx on these_qubits
                            # since these must have a dependency through the other predecessor
                            # in this case
                            if pred[0].name == "cx" and sorted(pred[0].qargs) == these_qubits:
                                sorted_pred = [pred[1]]
                            elif pred[1].name == "cx" and sorted(pred[1].qargs) == these_qubits:
                                sorted_pred = [pred[0]]
                            else:
                                sorted_pred = pred
                        if len(sorted_pred) == 2 and sorted_pred[0].name == "cx" and \
                           sorted_pred[1].name == "cx":
                            break  # stop immediately if we hit a pair of cx
                        # Examine each predecessor
                        for pnd in sorted_pred:
                            if pnd.name not in good_names:
                                continue
                            # If a predecessor is a single qubit gate, add it
                            if pnd.name != "cx":
                                if not nodes_seen[pnd]:
                                    group.append(pnd)
                                    nodes_seen[pnd] = True
                                    pred_next.extend(dag.predecessors(pnd))
                            # If cx, check qubits
                            else:
                                pred_qubits = sorted(pnd.qargs)
                                if pred_qubits == these_qubits:
                                    # add if on same qubits
                                    if not nodes_seen[pnd]:
                                        group.append(pnd)
                                        nodes_seen[pnd] = True
                                        pred_next.extend(dag.predecessors(pnd))
                                else:
                                    # remove qubit from consideration if not
                                    these_qubits = list(set(these_qubits) -
                                                        set(pred_qubits))
                    # Update predecessors
                    # Stop if there aren't any more
                    pred = list(set(pred_next))
                    if not pred:
                        explore = False
                # Reverse the predecessor list and append the "cx" node
                group.reverse()
                group.append(nd)
                nodes_seen[nd] = True
                # Reset these_qubits
                these_qubits = sorted(nd.qargs)
                # Explore successors of the "cx" node
                succ = list(dag.successors(nd))
                explore = True
                while explore:
                    succ_next = []
                    # If there is one successor, add it if its on the right qubits
                    if len(succ) == 1 and not nodes_seen[succ[0]]:
                        snd = succ[0]
                        if snd.name in good_names:
                            if (snd.name == "cx" and sorted(snd.qargs) == these_qubits) or \
                                    snd.name != "cx":
                                group.append(snd)
                                nodes_seen[snd] = True
                                succ_next.extend(dag.successors(snd))
                    # If there are two, then we consider cases
                    elif len(succ) == 2:
                        # First, check if there is a relationship
                        if succ[0] in dag.successors(succ[1]):
                            sorted_succ = [succ[1]]  # was [succ[1], succ[0]]
                        elif succ[1] in dag.successors(succ[0]):
                            sorted_succ = [succ[0]]  # was [succ[0], succ[1]]
                        else:
                            # We need to avoid accidentally adding a cx on these_qubits
                            # since these must have a dependency through the other successor
                            # in this case
                            if succ[0].name == "cx" and sorted(succ[0].qargs) == these_qubits:
                                sorted_succ = [succ[1]]
                            elif succ[1].name == "cx" and sorted(succ[1].qargs) == these_qubits:
                                sorted_succ = [succ[0]]
                            else:
                                sorted_succ = succ
                        if len(sorted_succ) == 2 and \
                           sorted_succ[0].name == "cx" and \
                           sorted_succ[1].name == "cx":
                            break  # stop immediately if we hit a pair of cx
                        # Examine each successor
                        for snd in sorted_succ:
                            if snd.name not in good_names:
                                continue
                            # If a successor is a single qubit gate, add it
                            if snd.name != "cx":
                                if not nodes_seen[snd]:
                                    group.append(snd)
                                    nodes_seen[snd] = True
                                    succ_next.extend(dag.successors(snd))
                            else:
                                # If cx, check qubits
                                succ_qubits = sorted(snd.qargs)
                                if succ_qubits == these_qubits:
                                    # add if on same qubits
                                    if not nodes_seen[snd]:
                                        group.append(snd)
                                        nodes_seen[snd] = True
                                        succ_next.extend(dag.successors(snd))
                                else:
                                    # remove qubit from consideration if not
                                    these_qubits = list(set(these_qubits) -
                                                        set(succ_qubits))
                    # Update successors
                    # Stop if there aren't any more
                    succ = list(set(succ_next))
                    if not succ:
                        explore = False

                block_list.append(tuple(group))

        self.property_set['block_list'] = block_list

        return dag
def run(self, dag):
        """collect blocks of adjacent gates acting on a pair of "cx" qubits.

        The blocks contain "op" nodes in topological sort order
        such that all gates in a block act on the same pair of
        qubits and are adjacent in the circuit. the blocks are built
        by examining predecessors and successors of "cx" gates in
        the circuit. u1, u2, u3, cx, id gates will be included.

        Return a list of tuples of "op" node labels.
        """
        # Initiate the commutation set
        self.property_set['commutation_set'] = defaultdict(list)

        good_names = ["cx", "u1", "u2", "u3", "id"]
        block_list = []
        nodes = list(dag.topological_nodes())
        nodes_seen = dict(zip(nodes, [False] * len(nodes)))
        for nd in dag.topological_op_nodes():
            group = []
            # Explore predecessors and successors of cx gates
            if nd.name == "cx" and nd.condition is None and not nodes_seen[nd]:
                these_qubits = sorted(nd.qargs)
                # Explore predecessors of the "cx" node
                pred = list(dag.predecessors(nd))
                explore = True
                while explore:
                    pred_next = []
                    # If there is one predecessor, add it if it's on the right qubits
                    if len(pred) == 1 and not nodes_seen[pred[0]]:
                        pnd = pred[0]
                        if pnd.name in good_names:
                            if (pnd.name == "cx" and sorted(pnd.qargs) == these_qubits) or \
                                    pnd.name != "cx":
                                group.append(pnd)
                                nodes_seen[pnd] = True
                                pred_next.extend(dag.predecessors(pnd))
                    # If there are two, then we consider cases
                    elif len(pred) == 2:
                        # First, check if there is a relationship
                        if pred[0] in dag.predecessors(pred[1]):
                            sorted_pred = [pred[1]]   # was [pred[1], pred[0]]
                        elif pred[1] in dag.predecessors(pred[0]):
                            sorted_pred = [pred[0]]   # was [pred[0], pred[1]]
                        else:
                            # We need to avoid accidentally adding a cx on these_qubits
                            # since these must have a dependency through the other predecessor
                            # in this case
                            if pred[0].name == "cx" and sorted(pred[0].qargs) == these_qubits:
                                sorted_pred = [pred[1]]
                            elif pred[1].name == "cx" and sorted(pred[1].qargs) == these_qubits:
                                sorted_pred = [pred[0]]
                            else:
                                sorted_pred = pred
                        if len(sorted_pred) == 2 and sorted_pred[0].name == "cx" and \
                           sorted_pred[1].name == "cx":
                            break  # stop immediately if we hit a pair of cx
                        # Examine each predecessor
                        for pnd in sorted_pred:
                            if pnd.name not in good_names:
                                continue
                            # If a predecessor is a single qubit gate, add it
                            if pnd.name != "cx":
                                if not nodes_seen[pnd]:
                                    group.append(pnd)
                                    nodes_seen[pnd] = True
                                    pred_next.extend(dag.predecessors(pnd))
                            # If cx, check qubits
                            else:
                                pred_qubits = sorted(pnd.qargs)
                                if pred_qubits == these_qubits:
                                    # add if on same qubits
                                    if not nodes_seen[pnd]:
                                        group.append(pnd)
                                        nodes_seen[pnd] = True
                                        pred_next.extend(dag.predecessors(pnd))
                                else:
                                    # remove qubit from consideration if not
                                    these_qubits = list(set(these_qubits) -
                                                        set(pred_qubits))
                    # Update predecessors
                    # Stop if there aren't any more
                    pred = list(set(pred_next))
                    if not pred:
                        explore = False
                # Reverse the predecessor list and append the "cx" node
                group.reverse()
                group.append(nd)
                nodes_seen[nd] = True
                # Reset these_qubits
                these_qubits = sorted(nd.qargs)
                # Explore successors of the "cx" node
                succ = list(dag.successors(nd))
                explore = True
                while explore:
                    succ_next = []
                    # If there is one successor, add it if its on the right qubits
                    if len(succ) == 1 and not nodes_seen[succ[0]]:
                        snd = succ[0]
                        if snd.name in good_names:
                            if (snd.name == "cx" and sorted(snd.qargs) == these_qubits) or \
                                    snd.name != "cx":
                                group.append(snd)
                                nodes_seen[snd] = True
                                succ_next.extend(dag.successors(snd))
                    # If there are two, then we consider cases
                    elif len(succ) == 2:
                        # First, check if there is a relationship
                        if succ[0] in dag.successors(succ[1]):
                            sorted_succ = [succ[1]]  # was [succ[1], succ[0]]
                        elif succ[1] in dag.successors(succ[0]):
                            sorted_succ = [succ[0]]  # was [succ[0], succ[1]]
                        else:
                            # We need to avoid accidentally adding a cx on these_qubits
                            # since these must have a dependency through the other successor
                            # in this case
                            if succ[0].name == "cx" and sorted(succ[0].qargs) == these_qubits:
                                sorted_succ = [succ[1]]
                            elif succ[1].name == "cx" and sorted(succ[1].qargs) == these_qubits:
                                sorted_succ = [succ[0]]
                            else:
                                sorted_succ = succ
                        if len(sorted_succ) == 2 and \
                           sorted_succ[0].name == "cx" and \
                           sorted_succ[1].name == "cx":
                            break  # stop immediately if we hit a pair of cx
                        # Examine each successor
                        for snd in sorted_succ:
                            if snd.name not in good_names:
                                continue
                            # If a successor is a single qubit gate, add it
                            if snd.name != "cx":
                                if not nodes_seen[snd]:
                                    group.append(snd)
                                    nodes_seen[snd] = True
                                    succ_next.extend(dag.successors(snd))
                            else:
                                # If cx, check qubits
                                succ_qubits = sorted(snd.qargs)
                                if succ_qubits == these_qubits:
                                    # add if on same qubits
                                    if not nodes_seen[snd]:
                                        group.append(snd)
                                        nodes_seen[snd] = True
                                        succ_next.extend(dag.successors(snd))
                                else:
                                    # remove qubit from consideration if not
                                    these_qubits = list(set(these_qubits) -
                                                        set(succ_qubits))
                    # Update successors
                    # Stop if there aren't any more
                    succ = list(set(succ_next))
                    if not succ:
                        explore = False

                block_list.append(tuple(group))

        self.property_set['block_list'] = block_list

        return dag
def run ( self , dag ) : # Initiate the commutation set self . property_set [ 'commutation_set' ] = defaultdict ( list ) good_names = [ "cx" , "u1" , "u2" , "u3" , "id" ] block_list = [ ] nodes = list ( dag . topological_nodes ( ) ) nodes_seen = dict ( zip ( nodes , [ False ] * len ( nodes ) ) ) for nd in dag . topological_op_nodes ( ) : group = [ ] # Explore predecessors and successors of cx gates if nd . name == "cx" and nd . condition is None and not nodes_seen [ nd ] : these_qubits = sorted ( nd . qargs ) # Explore predecessors of the "cx" node pred = list ( dag . predecessors ( nd ) ) explore = True while explore : pred_next = [ ] # If there is one predecessor, add it if it's on the right qubits if len ( pred ) == 1 and not nodes_seen [ pred [ 0 ] ] : pnd = pred [ 0 ] if pnd . name in good_names : if ( pnd . name == "cx" and sorted ( pnd . qargs ) == these_qubits ) or pnd . name != "cx" : group . append ( pnd ) nodes_seen [ pnd ] = True pred_next . extend ( dag . predecessors ( pnd ) ) # If there are two, then we consider cases elif len ( pred ) == 2 : # First, check if there is a relationship if pred [ 0 ] in dag . predecessors ( pred [ 1 ] ) : sorted_pred = [ pred [ 1 ] ] # was [pred[1], pred[0]] elif pred [ 1 ] in dag . predecessors ( pred [ 0 ] ) : sorted_pred = [ pred [ 0 ] ] # was [pred[0], pred[1]] else : # We need to avoid accidentally adding a cx on these_qubits # since these must have a dependency through the other predecessor # in this case if pred [ 0 ] . name == "cx" and sorted ( pred [ 0 ] . qargs ) == these_qubits : sorted_pred = [ pred [ 1 ] ] elif pred [ 1 ] . name == "cx" and sorted ( pred [ 1 ] . qargs ) == these_qubits : sorted_pred = [ pred [ 0 ] ] else : sorted_pred = pred if len ( sorted_pred ) == 2 and sorted_pred [ 0 ] . name == "cx" and sorted_pred [ 1 ] . name == "cx" : break # stop immediately if we hit a pair of cx # Examine each predecessor for pnd in sorted_pred : if pnd . name not in good_names : continue # If a predecessor is a single qubit gate, add it if pnd . name != "cx" : if not nodes_seen [ pnd ] : group . append ( pnd ) nodes_seen [ pnd ] = True pred_next . extend ( dag . predecessors ( pnd ) ) # If cx, check qubits else : pred_qubits = sorted ( pnd . qargs ) if pred_qubits == these_qubits : # add if on same qubits if not nodes_seen [ pnd ] : group . append ( pnd ) nodes_seen [ pnd ] = True pred_next . extend ( dag . predecessors ( pnd ) ) else : # remove qubit from consideration if not these_qubits = list ( set ( these_qubits ) - set ( pred_qubits ) ) # Update predecessors # Stop if there aren't any more pred = list ( set ( pred_next ) ) if not pred : explore = False # Reverse the predecessor list and append the "cx" node group . reverse ( ) group . append ( nd ) nodes_seen [ nd ] = True # Reset these_qubits these_qubits = sorted ( nd . qargs ) # Explore successors of the "cx" node succ = list ( dag . successors ( nd ) ) explore = True while explore : succ_next = [ ] # If there is one successor, add it if its on the right qubits if len ( succ ) == 1 and not nodes_seen [ succ [ 0 ] ] : snd = succ [ 0 ] if snd . name in good_names : if ( snd . name == "cx" and sorted ( snd . qargs ) == these_qubits ) or snd . name != "cx" : group . append ( snd ) nodes_seen [ snd ] = True succ_next . extend ( dag . successors ( snd ) ) # If there are two, then we consider cases elif len ( succ ) == 2 : # First, check if there is a relationship if succ [ 0 ] in dag . successors ( succ [ 1 ] ) : sorted_succ = [ succ [ 1 ] ] # was [succ[1], succ[0]] elif succ [ 1 ] in dag . successors ( succ [ 0 ] ) : sorted_succ = [ succ [ 0 ] ] # was [succ[0], succ[1]] else : # We need to avoid accidentally adding a cx on these_qubits # since these must have a dependency through the other successor # in this case if succ [ 0 ] . name == "cx" and sorted ( succ [ 0 ] . qargs ) == these_qubits : sorted_succ = [ succ [ 1 ] ] elif succ [ 1 ] . name == "cx" and sorted ( succ [ 1 ] . qargs ) == these_qubits : sorted_succ = [ succ [ 0 ] ] else : sorted_succ = succ if len ( sorted_succ ) == 2 and sorted_succ [ 0 ] . name == "cx" and sorted_succ [ 1 ] . name == "cx" : break # stop immediately if we hit a pair of cx # Examine each successor for snd in sorted_succ : if snd . name not in good_names : continue # If a successor is a single qubit gate, add it if snd . name != "cx" : if not nodes_seen [ snd ] : group . append ( snd ) nodes_seen [ snd ] = True succ_next . extend ( dag . successors ( snd ) ) else : # If cx, check qubits succ_qubits = sorted ( snd . qargs ) if succ_qubits == these_qubits : # add if on same qubits if not nodes_seen [ snd ] : group . append ( snd ) nodes_seen [ snd ] = True succ_next . extend ( dag . successors ( snd ) ) else : # remove qubit from consideration if not these_qubits = list ( set ( these_qubits ) - set ( succ_qubits ) ) # Update successors # Stop if there aren't any more succ = list ( set ( succ_next ) ) if not succ : explore = False block_list . append ( tuple ( group ) ) self . property_set [ 'block_list' ] = block_list return dag
collect blocks of adjacent gates acting on a pair of "cx" qubits.

        The blocks contain "op" nodes in topological sort order
        such that all gates in a block act on the same pair of
        qubits and are adjacent in the circuit. the blocks are built
        by examining predecessors and successors of "cx" gates in
        the circuit. u1, u2, u3, cx, id gates will be included.

        Return a list of tuples of "op" node labels.
collect blocks of adjacent gates acting on a pair of cx qubits .