Cargando…
Maximality of Reversible Gate Sets
We investigate collections of reversible gates closed under parallel and serial composition. In order to better understand the structure of these collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice, that is, collections that are not all...
Autor principal: | |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7345306/ http://dx.doi.org/10.1007/978-3-030-52482-1_12 |
_version_ | 1783556150445211648 |
---|---|
author | Boykett, Tim |
author_facet | Boykett, Tim |
author_sort | Boykett, Tim |
collection | PubMed |
description | We investigate collections of reversible gates closed under parallel and serial composition. In order to better understand the structure of these collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice, that is, collections that are not all gates, but the addition of a single new gate will allow us to construct all gates. We find the maximal closed sets over a finite alphabet. We then extend to ancilla and borrow closure for reversible gates. Here we find some structural results, including some examples. |
format | Online Article Text |
id | pubmed-7345306 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2020 |
record_format | MEDLINE/PubMed |
spelling | pubmed-73453062020-07-09 Maximality of Reversible Gate Sets Boykett, Tim Reversible Computation Article We investigate collections of reversible gates closed under parallel and serial composition. In order to better understand the structure of these collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice, that is, collections that are not all gates, but the addition of a single new gate will allow us to construct all gates. We find the maximal closed sets over a finite alphabet. We then extend to ancilla and borrow closure for reversible gates. Here we find some structural results, including some examples. 2020-06-17 /pmc/articles/PMC7345306/ http://dx.doi.org/10.1007/978-3-030-52482-1_12 Text en © Springer Nature Switzerland AG 2020 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic. |
spellingShingle | Article Boykett, Tim Maximality of Reversible Gate Sets |
title | Maximality of Reversible Gate Sets |
title_full | Maximality of Reversible Gate Sets |
title_fullStr | Maximality of Reversible Gate Sets |
title_full_unstemmed | Maximality of Reversible Gate Sets |
title_short | Maximality of Reversible Gate Sets |
title_sort | maximality of reversible gate sets |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7345306/ http://dx.doi.org/10.1007/978-3-030-52482-1_12 |
work_keys_str_mv | AT boyketttim maximalityofreversiblegatesets |