The synthesis of reversible circuits is a challenge on which many studies have been conducted. Different algorithms attempt to propose a more optimal implementation for each description of a reversible circuit, using reversible gates. In this paper, an algorithm is proposed which, by a heuristic method using a Simulated Annealing algorithm, tries to find a near-optimal circuit to the given truth table. Unlike previous methods, this method does not necessarily require a correct initial circuit to improve it. It can start from a correct circuit or a near-correct circuit or even from an empty circuit, and tries to get a circuit that is better than the initial circuit. It can also achieve different circuits in different runs that are better than the initial circuit. Finally, from the various circuits that this algorithm has produced in different runs, the best is selected as the final circuit. The proposed algorithm also tries to produce a circuit as simple as possible with respect to don’t-care combinations. Also, the current algorithm does not depend on the type of gates. Any library, including arbitrary reversible gates, can be used in this method.

可逆电路的合成是一项挑战，已经进行了许多研究。不同的算法尝试使用可逆门为可逆电路的每种描述提出更优化的实现。在本文中，提出了一种算法，该算法通过使用模拟退火算法的启发式方法，试图找到给定真值表的近似最优电路。与以前的方法不同，此方法不一定需要正确的初始电路来改善它。它可以从正确的电路或接近正确的电路甚至是空电路开始，并尝试获得比初始电路更好的电路。它还可以在不同的运行中获得比初始电路更好的不同电路。最后，从该算法在不同运行中产生的各种电路来看，选择最好的作为最终电路。对于无关组合，提出的算法还尝试生成尽可能简单的电路。同样，当前算法不取决于门的类型。此方法可以使用任何库，包括任意可逆门。