z iHPSrSSKrSSKJr SSKrSSKJr SSKJ r "SS5r g)au Directed graph object for representing coupling between physical qubits. The nodes of the graph correspond to physical qubits (represented as integers) and the directed edges indicate which physical qubits are coupled and the permitted direction of CNOT gates. The object has a distance function that can be used to map quantum circuits onto a device with this coupling. N)List) graphviz_draw) CouplingErrorc|\rSrSrSrSrS$SjrSrSrSr S r S r \ S 5r S rS r\ S5rSrSrSr\ S5rSrSrS%Sjr\S%S&Sjj5r\S%S&Sjj5r\S%S&Sjj5r\S%S&Sjj5r\S%S&Sjj5r\S%S&Sjj5r\S%S&Sjj5rSr S\!S4Sjr"S r#S!r$S"r%S#r&g)' CouplingMapz Directed graph specifying fixed coupling. Nodes correspond to physical qubits (integers) and directed edges correspond to permitted CNOT gates, with source and destination corresponding to control and target qubits, respectively. ) descriptiongraph _dist_matrix _qubit_list_size _is_symmetricNcX l[R"5UlSUlSUlSUlSUlUb6URRUVs/sHn[U5PM sn5 ggs snf)a Create coupling graph. By default, the generated coupling has no nodes. Args: couplinglist (list or None): An initial coupling graph, specified as an adjacency list containing couplings, e.g. [[0,1], [0,2], [1,2]]. It is required that nodes are contiguously indexed starting at 0. Missed nodes will be added as isolated nodes in the coupling map. description (str): A string to describe the coupling map. N) r rx PyDiGraphr r r r rextend_from_edge_listtuple)self couplinglistr xs T/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/transpiler/coupling.py__init__CouplingMap.__init__1si'\\^   !  # JJ , , -M 1eAh -M N $-MsA7chURc[UR5UlUR$)z3Return the number of physical qubits in this graph.)r lenr rs rsizeCouplingMap.sizeJs% :: TZZDJzzc6URR5$)zu Gets the list of edges in the coupling graph. Returns: Tuple(int,int): Each edge is a pair of physical qubits. )r edge_listrs r get_edgesCouplingMap.get_edgesPszz##%%rcH[URR55$)N)iterr r!rs r__iter__CouplingMap.__iter__YsDJJ((*++rc[U[5(d [S5eXR;a[SUS35eURR U5 SUlSUlSUlg)zAdd a physical qubit to the coupling graph as a node. physical_qubit (int): An integer representing a physical qubit. Raises: CouplingError: if trying to add duplicate qubit z#Physical qubits should be integers.zThe physical qubit z! is already in the coupling graphN) isinstanceintrphysical_qubitsr add_noder r r rphysical_qubits radd_physical_qubitCouplingMap.add_physical_qubit\so.#.. EF F 11 1%n%55VW  N+  rcXR;aURU5 X R;aURU5 URRXS5 SUlSUlg)zn Add directed edge to coupling graph. src (int): source physical qubit dst (int): destination physical qubit N)r+r/r add_edger r)rsrcdsts rr2CouplingMap.add_edgeos\ ** *  # #C ( ** *  # #C ( Cd+ !rcrURcURR5UlUR$)z(Returns a sorted list of physical_qubits)r r node_indexesrs rr+CouplingMap.physical_qubits~s1    ##zz668D rcx[R"UR5$![Ra gf=f)zL Test if the graph is connected. Return True if connected, False otherwise F)ris_weakly_connectedr NullGraphrs r is_connectedCouplingMap.is_connecteds2  ))$**5 5||  s "99c8URRU5$)zReturn the nearest neighbors of a physical qubit. Directionality matters, i.e. a neighbor must be reachable by going one hop in the direction of an edge. )r neighborsr-s rr?CouplingMap.neighborss zz##N33rc:UR5 UR$)zReturn the distance matrix for the coupling map. For any qubits where there isn't a path available between them the value in this position of the distance matrix will be ``math.inf``. )compute_distance_matrixr rs rdistance_matrixCouplingMap.distance_matrixs $$&   rcURc4[R"URS[R S9Ulgg)aCompute the full distance matrix on pairs of nodes. The distance map self._dist_matrix is computed from the graph using all_pairs_shortest_path_length. This is normally handled internally by the :attr:`~qiskit.transpiler.CouplingMap.distance_matrix` attribute or the :meth:`~qiskit.transpiler.CouplingMap.distance` method but can be called if you're accessing the distance matrix outside of those or want to pre-generate it. NT) as_undirected null_value)r rdigraph_distance_matrixr mathinfrs rrB#CouplingMap.compute_distance_matrixs7    $ " : : $488!D  %rc&XR5:a[US35eX R5:a[US35eUR5 URX4nU[R :Xa[SUSU35e[ U5$)a'Returns the undirected distance between physical_qubit1 and physical_qubit2. Args: physical_qubit1 (int): A physical qubit physical_qubit2 (int): Another physical qubit Returns: int: The undirected distance Raises: CouplingError: if the qubits do not exist in the CouplingMap z not in coupling graphz No path from z to )rrrBr rIrJr*)rphysical_qubit1physical_qubit2ress rdistanceCouplingMap.distances iik )?"33I JK K iik )?"33I JK K $$& @A $((?-/@_DU VW W3xrc[R"URXSS9nU(d$[S[ U5S[ U5S35eX2$)aBReturns the shortest undirected path between physical_qubit1 and physical_qubit2. Args: physical_qubit1 (int): A physical qubit physical_qubit2 (int): Another physical qubit Returns: List: The shortest undirected path Raises: CouplingError: When there is no path between physical_qubit1, physical_qubit2. T)sourcetargetrFzNodes z and z are not connected)rdigraph_dijkstra_shortest_pathsr rstr)rrMrNpathss rshortest_undirected_path$CouplingMap.shortest_undirected_paths\22 JJVZ _-.eC4H3II[\ %%rc^URcUR5UlUR$)zL Test if the graph is symmetric. Return True if symmetric, False otherwise )r_check_symmetryrs r is_symmetricCouplingMap.is_symmetrics-    %!%!5!5!7D !!!rcUR5n[U5nUH*up4XC4U;dMURRXCS5 M, SUlSUlg)z4 Convert uni-directional edges into bi-directional. N)r"setr r2r r)redgesedge_setr3dests rmake_symmetricCouplingMap.make_symmetricsU  u:IC{(* ##Dt4!!rc6URR5$)zL Calculates symmetry Returns: Bool: True if symmetric, False otherwise )r r\rs rr[CouplingMap._check_symmetryszz&&((rc4S/[U5S--n[U5H upEXCU'M /nUR5H6nUSU;dMUSU;dMURX7SX7S/5 M8 [ 5n[ [ U55Hn URRU 5 M URRUV s/sHn [U 5PM sn 5 U(a UR5(d [S5eU$s sn f)aReturns a reduced coupling map that corresponds to the subgraph of qubits selected in the mapping. Args: mapping (list): A mapping of reduced qubits to device qubits. check_if_connected (bool): if True, checks that the reduced coupling map is connected. Returns: CouplingMap: A reduced coupling_map for the selected qubits. Raises: CouplingError: Reduced coupling map must be connected. Nrzcoupling_map must be connected.) max enumerater"appendrrangerr r,rrr<r) rmappingcheck_if_connectedinv_mapidxval reduced_cmapedgereduced_coupling_mapnoders rreduceCouplingMap.reduces$&CL1,-!'*HCCL+ NN$DAw'!d1g&8##W!W%5wAw7G$HI% +}#g,'D & & / / 5(""88L9YLq%(L9YZ &:&G&G&I&I AB B## :ZsDreturncU"SS9nU(a&[RRU5UlU$/n[ U5H'n[ U5HnUR Xe45 M M) URR U5 U$)z2Return a fully connected coupling map on n qubits.fullr )r generatorsdirected_mesh_graphr rlrkr)cls num_qubits bidirectionalcmapr!ijs r from_fullCouplingMap.from_full&s{v& :::FDJ I:&qA$$aV,"' JJ , ,Y 7 rcVU"SS9n[RRXS9UlU$)z6Return a coupling map of n qubits connected in a line.liner{r)rr|directed_path_graphr r~rrrs r from_lineCouplingMap.from_line4s,v&]]66z6_  rcVU"SS9n[RRXS9UlU$)zQReturn a coupling map of n qubits connected to each of their neighbors in a ring.ringr{r)rr|directed_cycle_graphr rs r from_ringCouplingMap.from_ring;s,v&]]77 7`  rcXU"SS9n[RRXUS9UlU$)zNReturn a coupling map of qubits connected on a grid of num_rows x num_columns.gridr{r)rr|directed_grid_graphr )r~num_rows num_columnsrrs r from_gridCouplingMap.from_gridBs5v&]]66 7   rcVU"SS9n[RRXS9UlU$)aReturn a heavy hexagon graph coupling map. A heavy hexagon graph is described in: https://journals.aps.org/prx/abstract/10.1103/PhysRevX.10.011022 Args: distance (int): The code distance for the generated heavy hex graph. The value for distance can be any odd positive integer. The distance relates to the number of qubits by: :math:`n = \frac{5d^2 - 2d - 1}{2}` where :math:`n` is the number of qubits and :math:`d` is the ``distance`` parameter. bidirectional (bool): Whether the edges in the output coupling graph are bidirectional or not. By default this is set to ``True`` Returns: CouplingMap: A heavy hex coupling graph z heavy-hexr{r)rr|directed_heavy_hex_graphr r~rPrrs rfrom_heavy_hexCouplingMap.from_heavy_hexKs,({+]];;H;b  rcVU"SS9n[RRXS9UlU$)aReturn a heavy square graph coupling map. A heavy square graph is described in: https://journals.aps.org/prx/abstract/10.1103/PhysRevX.10.011022 Args: distance (int): The code distance for the generated heavy square graph. The value for distance can be any odd positive integer. The distance relates to the number of qubits by: :math:`n = 3d^2 - 2d` where :math:`n` is the number of qubits and :math:`d` is the ``distance`` parameter. bidirectional (bool): Whether the edges in the output coupling graph are bidirectional or not. By default this is set to ``True`` Returns: CouplingMap: A heavy square coupling graph z heavy-squarer{r)rr|directed_heavy_square_graphr rs rfrom_heavy_squareCouplingMap.from_heavy_squarecs3(~.]]>> ?   rcXU"SS9n[RRXUS9UlU$)aReturn a hexagonal lattice graph coupling map. Args: rows (int): The number of rows to generate the graph with. cols (int): The number of columns to generate the graph with. bidirectional (bool): Whether the edges in the output coupling graph are bidirectional or not. By default this is set to ``True`` Returns: CouplingMap: A hexagonal lattice coupling graph zhexagonal-latticer{r)rr| directed_hexagonal_lattice_graphr )r~rowscolsrrs rfrom_hexagonal_lattice"CouplingMap.from_hexagonal_lattice}s723]]CC mD   rcZ[[R"UR5[S9$)z:Return a set of qubits in the largest connected component.)key)rirweakly_connected_componentsr rrs rlargest_connected_component'CouplingMap.largest_connected_components211$**=3GGrcBURR5HnXRU'M [R"UR5n/nUHGn[ 5nURR [ U55UlURU5 MI U$)a)Separate a :Class:`~.CouplingMap` into subgraph :class:`~.CouplingMap` for each connected component. The connected components of a :class:`~.CouplingMap` are the subgraphs that are not part of any larger subgraph. For example, if you had a coupling map that looked like:: 0 --> 1 4 --> 5 ---> 6 --> 7 | | | | V V 2 --> 3 then the connected components of that graph are the subgraphs:: 0 --> 1 | | | | V V 2 --> 3 and:: 4 --> 5 ---> 6 --> 7 For a connected :class:`~.CouplingMap` object there is only a single connected component, the entire :class:`~.CouplingMap`. This method will return a list of :class:`~.CouplingMap` objects, one for each connected component in this :class:`~.CouplingMap`. The data payload of each node in the :attr:`~.CouplingMap.graph` attribute will contain the qubit number in the original graph. This will enables mapping the qubit index in a component subgraph to the original qubit in the combined :class:`~.CouplingMap`. For example:: from qiskit.transpiler import CouplingMap cmap = CouplingMap([[0, 1], [1, 2], [2, 0], [3, 4], [4, 5], [5, 3]]) component_cmaps = cmap.connected_components() print(component_cmaps[1].graph[0]) will print ``3`` as index ``0`` in the second component is qubit 3 in the original cmap. Returns: list: A list of :class:`~.CouplingMap` objects for each connected components. The order of this list is deterministic but implementation specific and shouldn't be relied upon as part of the API. )r node_indicesrrrsubgraphsortedrk)rru components output_list componentnew_cmaps rconnected_components CouplingMap.connected_componentssdJJ++-D#JJt .33DJJ?  #I"}H!ZZ00 1BCHN   x ($rc SnUR5(aHUS- nUSRUR5VVs/sHup#SUSUS3PM snn5- nUS- nU$s snnf)z5Return a string representation of the coupling graph.[z, ])r"join)rstringr3r4s r__str__CouplingMap.__str__sm >>   cMF diiT^^EU VEUz1SEC5!2EU VW WF cMF !WsA" c[U[5(dg[URR 55[URR 55:H$)a.Check if the graph in ``other`` has the same node labels and edges as the graph in ``self``. This function assumes that the graphs in :class:`.CouplingMap` instances are connected. Args: other (CouplingMap): The other coupling map. Returns: bool: Whether or not other is isomorphic to self. F)r)rr_r r!)rothers r__eq__CouplingMap.__eq__sC%--4::'')*c%++2G2G2I.JJJrc*[URSS9$)zDraws the coupling map. This function calls the :func:`~rustworkx.visualization.graphviz_draw` function from the ``rustworkx`` package to draw the :class:`CouplingMap` object. Returns: PIL.Image: Drawn coupling map. neato)method)rr rs rdrawCouplingMap.drawsTZZ88r)r rr r r r )NN)T)rxr)'__name__ __module__ __qualname____firstlineno____doc__ __slots__rrr"r&r/r2propertyr+r<r?rCrBrPrXr\rcr[rv classmethodrrrrrrrrrrrrr__static_attributes__rrrrsFIO2 &,& "  4!! .&("" ")&$P    .2$H:d=&9:xK 9rr) rrItypingr rustworkxrrustworkx.visualizationrqiskit.transpiler.exceptionsrrrrrrs' 16U9U9r