Related papers: Reversible k-valued logic circuits are finitely ge…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

Our primary purpose is to isolate the abstract, mathematical properties of circuits -- both classical Boolean circuits and quantum circuits -- that are essential for their computational interpretation. A secondary purpose is to clarify the…

Let $G$ be a finitely generated abelian-by-finite group and $k$ a field of characteristic $p\ge 0$. The Euler class $[k_G]$ of $G$ over $k$ is the class of the trivial $kG$-module in the Grothendieck group $G_0(kG)$. We show that $[k_G]$…

Variational quantum algorithms dominate gate-based applications of modern quantum processors. The so called, {\it layer-wise trainability conjecture} appears in various works throughout the variational quantum computing literature. The…

In 1995, E. Jespers, G. Leal and C. Polcino Milies classified all finite ring alternative loops (RA loops for short) which are not direct products of proper subloops. In this paper we extend this result to finitely generated RA loops and…

It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions…

All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…

For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…

Let $k$ be a field and let $E$ be a finite quiver. We study the structure of the finitely presented modules of finite length over the Leavitt path algebra $L_k (E)$ and show its close relationship with the finite-dimensional representations…

This mostly expository paper centers on recently proved conjectures in two areas: A) A conjecture of A. Oppenheim on the values of real indefinite quadratic forms at integral points. B) Conjectures of Dani, Raghunathan, and Margulis on…

We give a procedure for "reverse engineering" a closed, simply connected, Riemannian manifold with bounded local geometry from a sparse chain complex over $\mathbb{Z}$. Applying this procedure to chain complexes obtained by "lifting"…

In this note, we consider the problem of generating $k$-factorable graphic sequences with connected (resp. no connected) $k$-factors.

In this paper, we study the K-theory on higher modules in spectral algebraic geometry. We relate the K-theory of an $\infty$-category of finitely generated projective modules on certain $\mathbb{E}_{\infty}$-rings with the K-theory of an…

Let $K$ be a finite extension of $\Q_p$, let $L/K$ be a finite abelian Galois extension of odd degree and let $\bo_L$ be the valuation ring of $L$. We define $A_{L/K}$ to be the unique fractional $\bo_L$-ideal with square equal to the…

Common quantum algorithms make heavy use of ancillae: scratch qubits that are initialized at some state and later returned to that state and discarded. Existing quantum circuit languages let programmers assert that a qubit has been returned…

Let $\mathbf{k}$ be a field of arbitrary characteristic, and let $\Lambda$ be a finite dimensional $\mathbf{k}$-algebra. In this short note we prove that if $V$ is a finitely generated strongly Gorenstein-projective left $\Lambda$-module…

Let $\mathbf{k}$ be an algebraically closed field, let $\Lambda$ be a finite dimensional $\mathbf{k}$-algebra, and let $\widehat{\Lambda}$ be the repetitive algebra of $\Lambda$. For the stable category of finitely generated left…

It has been experimentally proven that realizing universal quantum gates using higher-radices logic is practically and technologically possible. We developed a Parallel Genetic Algorithm that synthesizes Boolean reversible circuits realized…

The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…

The classical continuous finite element method with Lagrangian $Q^k$ basis reduces to a finite difference scheme when all the integrals are replaced by the $(k+1)\times (k+1)$ Gauss-Lobatto quadrature. We prove that this finite difference…