Related papers: Reversible k-valued logic circuits are finitely ge…
The existence of NAFIL loops of every odd order n => 5 is established by construction. These are non-associative finite invertible loops that are simple and power-associative and they form an infinite family. The first member of this family…
Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…
Deterministic one-way time-bounded multi-counter automata are studied with respect to their ability to perform reversible computations, which means that the automata are also backward deterministic and, thus, are able to uniquely step the…
For a finite valued field extension $(L/K,v)$ we describe the problem of find sets of generators for the corresponding extension $\mathcal O_L/\mathcal O_K$ of valuation rings. The main tool to obtain such sets are complete sets of (key)…
Order-$p$ parasupersymmetric and orthosupersymmetric quantum mechanics are shown to be fully reducible when they are realized in terms of the generators of a generalized deformed oscillator algebra and a ${\rm Z}_{p+1}$-grading structure is…
We introduce the first complete equational theory for quantum circuits. More precisely, we introduce a set of circuit equations that we prove to be sound and complete: two circuits represent the same unitary map if and only if they can be…
The space of n (ordered) points on the projective line, modulo automorphisms of the line, is one of the most important and classical examples of an invariant theory quotient, and is one of the first examples given in any course. Generators…
We show that an infinite residually finite boundedly generated group has an infinite chain of finite index subgroups with ranks uniformly bounded, and give (sublinear) upper bounds on the ranks of arbitrary finite index subgroups of…
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…
Fractional supersymmetric quantum mechanics of order $\lambda$ is realized in terms of the generators of a generalized deformed oscillator algebra and a Z$_{\lambda}$-grading structure is imposed on the Fock space of the latter. This…
We show that, for each real number $\alpha > 0$ and odd integer $k\ge 5$ there is an integer $c$ such that, if $M$ is a simple binary matroid with $|M| \ge \alpha 2^{r(M)}$ and with no $k$-element circuit, then $M$ has critical number at…
In this paper we discuss an efficient technique that can implement any given Boolean function as a quantum circuit. The method converts a truth table of a Boolean function to the corresponding quantum circuit using a minimal number of…
Implementing Boolean functions with circuits consisting of logic gates is fundamental in digital computer design. However, the implemented circuit must be exactly equivalent, which hinders generative neural approaches on this task due to…
A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…
We prove that, in a finite group, if every rational irreducible character has odd degree, then all rational elements are 2-elements, as it was originally conjectured by Tiep and Tong-Viet.
Let S be a set of n >= d points in general position in R^d. An oriented (d-1)-simplex spanned by d points from S is called a k-facet iff the positive side of its affine hull contains exactly k points from S. A (<=k)-facet is simply an…
Hazrat gave a K-theoretic invariant for Leavitt path algebras as graded algebras. Hazrat conjectured that this invariant classifies Leavitt path algebras up to graded isomorphism, and proved the conjecture in some cases. In this paper, we…
Starting with a $\mathbb{C}^*$-valued cocycle on the global quotient orbifold $X // G$, we apply transgression techniques for 2-gerbes, as developed by Lupercio and Uribe, to construct a gerbe on the orbifold loop space $\mathcal{L}(X//G)$.…
We propose an approach to optimally synthesize quantum circuits from non-permutative quantum gates such as Controlled-Square-Root-of-Not (i.e. Controlled-V). Our approach reduces the synthesis problem to multiple-valued optimization and…
This article presents a research work on the design and synthesis of sequential circuits and flip-flops that are available in digital arena; and describes a new synthesis design of reversible counter that is optimized in terms of quantum…