Figure illustrates our algorithm for enumerating all plausible, nonequivalent mappings of a chemical reaction. Through graph theoretical reduction, this algorithm transforms the AAM problem into a maximum clique problem, formulated as a quadratic unconstrained binary optimization (QUBO) problem, which is equivalent to an Ising model problem. The maximum clique enumeration problem is subsequently solved by the enumeration algorithm using Ising computing. In this study, we specifically employ simulated annealing (SA) for this purpose. Each maximum clique found corresponds to a set of chemical bonds that remain unchanged during the reaction. Based on these unchanged chemical bonds, subsets of reactant atoms are mapped to subsets of product atoms, which we refer to as partial mapping. Then, the algorithm permutes the residual atoms not included in each partial mapping to generate all plausible complete mappings. Finally, these complete mappings are clustered by the molecular symmetry to identify all possible nonequivalent mappings, which can result in distinguishable reaction mechanisms. Additionally, several optional filters may be applied to reduce the number of plausible nonequivalent mappings. In the following subsections, we will detail this procedure.