z i$SrSSKJr SSKJr SSKrSSKJr SSKJ r SSK J r "SS \ 5r \"S S 55r g) zMCheck if the DAG has reached a relative semi-stable point over previous runs.)deepcopy) dataclassN)Tuple) DAGCircuit)TransformationPassc6^\rSrSrSrSU4SjjrSrSrU=r$) MinimumPointaCheck if the DAG has reached a relative semi-stable point over previous runs This pass is similar to the :class:`~.FixedPoint` transpiler pass and is intended primarily to be used to set a loop break condition in the property set. However, unlike the :class:`~.FixedPoint` class which only sets the condition if 2 consecutive runs have the same value property set value this pass is designed to find a local minimum and use that instead. This pass is designed for an optimization loop where a fixed point may never get reached (for example if synthesis is used and there are multiple equivalent outputs for some cases). This pass will track the state of fields in the property set over its past executions and set a boolean field when either a fixed point is reached over the backtracking depth or selecting the minimum value found if the backtracking depth is reached. To do this it stores a deep copy of the current minimum DAG in the property set and when ``backtrack_depth`` number of executions is reached since the last minimum the output dag is set to that copy of the earlier minimum. Fields used by this pass in the property set are (all relative to the ``prefix`` argument): * ``{prefix}_minimum_point_state`` - Used to track the state of the minimum point search * ``{prefix}_minimum_point`` - This value gets set to ``True`` when either a fixed point is reached over the ``backtrack_depth`` executions, or ``backtrack_depth`` was exceeded and an earlier minimum is restored. cb>[TU]5 XlUS3UlUS3UlX0lg)aInitialize an instance of this pass Args: property_set_list (list): A list of property set keys that will be used to evaluate the local minimum. The values of these property set keys will be used as a tuple for comparison prefix (str): The prefix to use for the property set key that is used for tracking previous evaluations backtrack_depth (int): The maximum number of entries to store. If this number is reached and the next iteration doesn't have a decrease in the number of values the minimum of the previous n will be set as the output dag and ``minimum_point`` will be set to ``True`` in the property set _minimum_point_state_minimum_pointN)super__init__property_set_listbacktrack_nameminimum_reachedbacktrack_depth)selfrprefixr __class__s f/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/transpiler/passes/utils/minimum_point.pyrMinimumPoint.__init__5s; !2!'(<="(8.c^[U4SjTR55nTRTRnUcI[ S[ R 4[TR5-SS9TRTR'U$X#R:anU=RS- sl URTR:Xa<STRTR'TRTRR$U$X#R:aSUl X#l[U5Ul U$X#R:XaSTRTR'U$U$)z#Run the MinimumPoint pass on `dag`.c3B># UHnTRUv M g7f)N) property_set).0xrs r #MinimumPoint.run..MsK4Jqd''*4JsNrdagscoresinceT)tuplerrr_MinimumPointStatemathinflenr#r$rrr"r)rr"r#states` rrunMinimumPoint.runKs7KD4J4JKK!!$"5"56 =5G c$2H2H.I IQR6D  d11 22 )[[ KK1 K{{d222:>!!$"6"67(()<)<=AAA3$ [[ EKK  EI kk !6:D  d22 3J r)rrrr)) __name__ __module__ __qualname____firstlineno____doc__rr,__static_attributes__ __classcell__)rs@rr r s8/,""rr cB\rSrSr%Sr\\S'\\S4\S'\ \S'Sr g) r'pr!r".r#r$N) r/r0r1r2 __slots__r__annotations__rfloatintr4r8rrr'r'ps )I O   Jrr')r3copyr dataclassesrr(typingrqiskit.dagcircuit.dagcircuitrqiskit.transpiler.basepassesrr r'r8rrrBsFT! 3;U%Up  r