pennylane_calculquebec.utility.graph.find_best_wire

Contents

pennylane_calculquebec.utility.graph.find_best_wire#

pennylane_calculquebec.utility.graph.find_best_wire(graph: Graph, machine_name: str, excluded: list[int] = [], use_benchmark=True)#

find node with highest degree in graph

Parameters:

  • graph (Graph) – the graph from which we want to find the best wire

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

  • excluded (list[int]) – wires we want to skip

  • use_benchmark (bool) – should we use fidelities?

Returns:

the wire with best score

Return type:

int

Contents