Maximality of reversible gate sets
From MaRDI portal
Publication:6334339
DOI10.1007/978-3-030-52482-1_12arXiv2002.02899MaRDI QIDQ6334339
Publication date: 6 February 2020
Abstract: 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.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)
This page was built for publication: Maximality of reversible gate sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6334339)
