Related papers: Computing holes in semi-groups and its application…
The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy…
A zig-zag order is like a directed path, only with alternating directions. A generating set of minimal size for the semigroup of all full transformations on a finite set preserving the zig-zag order was determined by Fenandes et al. in…
A number of quantum algorithms have been performed on small quantum computers; these include Shor's prime factorization algorithm, error correction, Grover's search algorithm and a number of analog and digital quantum simulations. Because…
An infinite family of exactly-solvable and integrable potentials on a plane is introduced. It is shown that all already known rational potentials with the above properties allowing separation of variables in polar coordinates are particular…
We develop a theory based on quasi-geometric (QG) approach to transform a small number of qubits into a larger number of error-correcting qubits by considering four different cases. More precisely, we use the 2-dimensional quasi-orthogonal…
A semiclassical approach to the calculation of transport moments $M_m={\rm Tr}[(t^\dag t)^m]$, where $t$ is the transmission matrix, was developed in [M. Novaes, Europhys. Lett. 98, 20006 (2012)] for chaotic cavities with two leads and…
There is strong evidence for the belief that `almost all' finite semigroups, whether we consider multiplication operations on a fixed set or their isomorphism classes, are nilpotent of index 3 (3-nilpotent for short). The only known method…
One of the most important problems in hybrid systems is the {\em reachability problem}. The reachability problem has been shown to be undecidable even for a subclass of {\em linear} hybrid systems. In view of this, the main focus in the…
Recently, quantum computing has gained attention in urban studies as a tool for complex transport planning problems, but its role remains unclear. This paper reviews quantum computing research in urban transport planning and highlights…
The computational complexity of the circuit evaluation problem for finite semirings is considered, where semirings are not assumed to have an additive or multiplicative identity. The following dichotomy is shown: If a finite semiring is…
Let $S$ be a finite non-commutative semigroup. The commuting graph of $S$, denoted $\cg(S)$, is the graph whose vertices are the non-central elements of $S$ and whose edges are the sets $\{a,b\}$ of vertices such that $a\ne b$ and $ab=ba$.…
Let $\mathcal C \subset \mathbb N^p$ be a finitely generated integer cone and $S\subset \mathcal C$ be an affine semigroup such that the real cones generated by $\mathcal C$ and by $S$ are equal. The semigroup $S$ is called $\mathcal…
In this paper we present results illustrating the power and flexibility of one-bit teleportations in quantum bus computation. We first show a scheme to perform a universal set of gates on continuous variable modes, which we call a quantum…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…
A numerical semigroup is a co-finite submonoid of the monoid of non-negative integers under addition. Many properties of numerical semigroups rely on some fundamental invariants, such as, among others, the set of gaps (and its cardinality),…
Finding inclusion-minimal "hitting sets" for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Much of the algorithmic…
The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…
We introduce the Mixed-Integer Quadratically Constrained Quadratic Programming framework for the quantum compilation problem and apply it in the context of topological quantum computing. In this setting, quantum gates are realized by…
In this paper we introduce the notion of $n$-permutation numerical semigroup. While there are just three $2$-permutation numerical semigroups, there are infinitely many $n$-permutation numerical semigroups if $n > 2$. We construct $16$…