论文标题
可逆门集的最大性
Maximality of reversible gate sets
论文作者
论文摘要
为了更好地了解可逆门的封闭收集的结构，我们研究了封闭套件的晶格和该晶格的最大成员。在本说明中，我们发现有限字母上的最大闭合集。我们发现，对于奇数字母，有有限数量的最大闭合集，而对于偶数情况，我们具有可计数的无穷大，几乎所有这些都与交替的排列有关。然后，我们扩展到其他形式的关闭，以进行可逆大门，Ancilla和借用闭合。在这里，我们找到了一些结构性结果，包括一些最大闭合组的示例。
In order to better understand the structure of closed collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice. In this note, we find the maximal closed sets over a finite alphabet. We find that for odd sized alphabets, there are a finite number of maximal closed sets, while for the even case we have a countable infinity, almost all of which are related to an alternating permutations. We then extend to other forms of closure for reversible gates, ancilla and borrow closure. Here we find some structural results, including some examples of maximal closed sets.
