Some Results on Reversible Gate Classes Over Non-Binary Alphabets
Emerging Technologies
2016-06-03 v1 Quantum Physics
Abstract
We present a collection of results concerning the structure of reversible gate classes over non-binary alphabets, including (1) a reversible gate class over non-binary alphabets that is not finitely generated (2) an explicit set of generators for the class of all gates, the class of all conservative gates, and a class of generalizations of the two (3) an embedding of the poset of reversible gate classes over an alphabet of size into that of an alphabet of size (4) a classification of gate classes containing the class of -conservative gates, meaning gates that preserve the number of occurrences of a certain element in the alphabet.
Cite
@article{arxiv.1606.00804,
title = {Some Results on Reversible Gate Classes Over Non-Binary Alphabets},
author = {Yuzhou Gu},
journal= {arXiv preprint arXiv:1606.00804},
year = {2016}
}