pennylane_calculquebec.utility.graph.find_best_neighbour

pennylane_calculquebec.utility.graph.find_best_neighbour(wire, topology: Graph, machine_name: str, use_benchmark=True)

Finds the neighbour to a node which has the highest mean fidelity

Parameters:

• wire (int) – the node for which we want to find the neighbour

• topology (Graph) – the graph on which we are searching for neighbours

• machine_name (str) – the quantum machine’s name

• use_benchmark (bool) – should we use fidelities?

Returns:

the neighbour with best score

Return type:

int