One of the issues that arises today in the field of quantum circuits is how to synthesize a reversible circuit using the reversible gates. Due to the fact that the implementation of reversible circuits has high hardware costs, much effort has been made to find the circuit with the lowest cost. In this paper, we present a method that, by relying on the cycles in the truth table, produces a circuit in which these cycles are implemented, without changing in other combinations of the truth table. Therefore, for functions with low cycle sizes, they will generate much less expensive circuits than other methods. In addition, for functions with don’t care combinations or don’t care outputs, in this method, we have tried to reduce the number of cycles and their size, and hence the quantum cost of generated circuits, using these don’t cares. The proposed method of this article has improved the average costs between 27% and 40% in comparison with similar tasks in the case of circuits with a low cycle number and size.
