Related papers: A Note on Nonuniform versus Uniform ACC^k Circuits…
We investigate computing models that are presented as families of finite computing devices with a uniformity condition on the entire family. Examples of such models include Boolean circuits, membrane systems, DNA computers, chemical…
This paper talk about that NP is not AL and P, P is not NC, NC is not NL, and NL is not L. The point about this paper is the depend relation of the problem that need other problem's result to compute it. I show the structure of depend…
The past decade has seen a significant interest in learning tractable probabilistic representations. Arithmetic circuits (ACs) were among the first proposed tractable representations, with some subsequent representations being instances of…
We present a collection of results concerning the structure of reversible gate classes over non-binary alphabets, including (1) a reversible gate class over non-binary alphabets that is not finitely generated (2) an explicit set of…
A SONC polynomial is a sum of finitely many non-negative circuit polynomials, whereas a non-negative circuit polynomial is a non-negative polynomial whose support is a simplicial circuit. We show that there exist non-negative polynomials…
We collect some statements regarding equivalence of the parities of various class numbers and signature ranks of units in prime power cyclotomic fields. We correct some misstatements in the literature regarding these parities by providing…
We study Boolean circuits as a representation of Boolean functions and consider different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all…
Clifford circuits -- i.e. circuits composed of only CNOT, Hadamard, and $\pi/4$ phase gates -- play a central role in the study of quantum computation. However, their computational power is limited: a well-known result of Gottesman and…
We examine the circuit complexity of coherent states in a free scalar field theory, applying Nielsen's geometric approach as in [1]. The complexity of the coherent states have the same UV divergences as the vacuum state complexity and so we…
Let $K$ be a cyclic cubic field and $\mathcal{O}_K$ be its ring of integers. In this note we prove that all cyclic cubic number fields with conductors in the interval $ [73, 11971]$ and with class number one are Euclidean.
A nCk sequence is a sequence of n-bit numbers with k bits set. Given such a sequence C, the difference sequence D of C is subject to certain regularities that make it possible to generate D in 2|C| time, and, hence, to generate C in 3|C|…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
This work studies Temporally Non-Uniform Cellular Automata (t-NUCAs), a variant of non-uniform cellular automata, which temporally use two rules in a sequence during their evolution. The one-dimensional t-NUCAs, under finite as well as…
The complex ac-response of a quasi-one dimensional electron system in the one-band approximation with an interaction potential of finite range is investigated. It is shown that linear response is exact for this model. The influence of the…
We construct an example of a unit-regular ring which is not strongly clean, answering an open question of Nicholson. We also characterize clean matrices with a zero column, and this allows us to describe an interesting connection between…
We consider a class of discontinuous piecewise linear differential systems in $\mathbb{R}^3$ with two pieces separated by a plane. In this class we show that there exist differential systems having: a unique limit cycle, a unique…
We propose a theory of characterizing quantum circuits with qubit functional configurations. Any quantum circuit can be decomposed into alternating sequences of 1-qubit unitary gates and CNOT gates. Each CNOT sequence prepares the current…
Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not efficiently classically simulable in the weak…
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
In sequential circuits, the current output may depend on both past and current inputs. However, certain kinds of sequential circuits do not refer to all of the past inputs to generate the current output; they only refer to a subset of past…