Lehrende und MitarbeiterInnen

Boykett, Timothy wiss. Mitarb. Dr.

Titel
Maximality of reversible gate sets
Typ
Artikel
Schlagwörter
reversible computation, Algebra, mathematics
Texte
Abstract. In order to better understand the structure of closed collec- tions 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 alternat- ing 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.
Autor*innen
Timothy Boykett
Datum
2020-02-06
URL