Reversible adders are essential circuits in quantum computing systems. They are a fundamental part of the algorithms implemented for such systems, where Shor's celebrated factoring algorithm is one of the most prominent examples in which reversible arithmetic is needed. There is a wide variety of works in the existing literature which tackle the design of an adder for quantum systems, and today there is still a great interest in the creation of new designs and the perfection of the existing ones. Similar to how it happens in classical digital systems, there are different methodologies to approach the addition using reversible circuits. Some methodologies focus on minimizing the necessary resources, others on optimizing computing time, etc. In this work we analyze the reversible adders in the state-of-the-art for quantum computing, classifying them according to their type, and finally, comparing each other using referenced and validated metrics that allow highlighting the strengths and weaknesses of each adder.

可逆加法器是量子计算系统中必不可少的电路。它们是为此类系统实现的算法的基本部分，其中Shor著名的因式分解算法是需要可逆算术的最著名示例之一。现有文献中涉及到量子系统加法器设计的作品种类繁多，如今，人们对创建新设计和完善现有设计抱有浓厚兴趣。与经典数字系统中发生的情况类似，使用可逆电路可采用不同的方法进行加法运算。一些方法论着重于减少必要的资源，另一些方法论着优化计算时间，等等。在这项工作中，我们分析了最新的量子计算可逆加法器，