{"title":"由具有少量附加输入的NOT、CNOT和2-CNOT门组成的可逆电路的合成","authors":"D. Zakablukov","doi":"10.1515/dma-2022-0037","DOIUrl":null,"url":null,"abstract":"Abstract Reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs are considered. For such circuits implementing maps f : Z2n $\\begin{array}{} \\displaystyle \\mathbb Z_2^n \\end{array}$ → Z2n $\\begin{array}{} \\displaystyle \\mathbb Z_2^n \\end{array}$, we study the Shannon complexity function L(n, q) under the condition that the number of additional inputs is q = O(n2). For this range of q, it is shown that L(n, q) ≍ n2n / log2 n. The growth order L(n, q) ≍ n2n / log2 (n + q) for all q ≲ n2n−⌈n/ϕ(n)⌉, where ϕ(n) → ∞ and n / ϕ(n) − log2 n → ∞ as n → ∞, is evaluated.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs\",\"authors\":\"D. Zakablukov\",\"doi\":\"10.1515/dma-2022-0037\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs are considered. For such circuits implementing maps f : Z2n $\\\\begin{array}{} \\\\displaystyle \\\\mathbb Z_2^n \\\\end{array}$ → Z2n $\\\\begin{array}{} \\\\displaystyle \\\\mathbb Z_2^n \\\\end{array}$, we study the Shannon complexity function L(n, q) under the condition that the number of additional inputs is q = O(n2). For this range of q, it is shown that L(n, q) ≍ n2n / log2 n. The growth order L(n, q) ≍ n2n / log2 (n + q) for all q ≲ n2n−⌈n/ϕ(n)⌉, where ϕ(n) → ∞ and n / ϕ(n) − log2 n → ∞ as n → ∞, is evaluated.\",\"PeriodicalId\":11287,\"journal\":{\"name\":\"Discrete Mathematics and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/dma-2022-0037\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2022-0037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
Abstract Reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs are considered. For such circuits implementing maps f : Z2n $\begin{array}{} \displaystyle \mathbb Z_2^n \end{array}$ → Z2n $\begin{array}{} \displaystyle \mathbb Z_2^n \end{array}$, we study the Shannon complexity function L(n, q) under the condition that the number of additional inputs is q = O(n2). For this range of q, it is shown that L(n, q) ≍ n2n / log2 n. The growth order L(n, q) ≍ n2n / log2 (n + q) for all q ≲ n2n−⌈n/ϕ(n)⌉, where ϕ(n) → ∞ and n / ϕ(n) − log2 n → ∞ as n → ∞, is evaluated.
期刊介绍:
The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.