Related papers: Linear Programming Bounds on $k$-Uniform States
We are considering RAMs $N_{n}$, with wordlength $n=2^{d}$, whose arithmetic instructions are the arithmetic operations multiplication and addition modulo $2^{n}$, the unary function $ \min\lbrace 2^{x}, 2^{n}-1\rbrace$, the binary…
We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. In the first, both states are unknown. One copy of each of the unknown states is provided as input, or program, for the two…
We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory…
We prove under the Bombieri-Lang conjecture for surfaces that there is an absolute bound on the length of sequences of integer squares with constant second differences, for sequences which are not formed by the squares of integers in…
We elaborate the idea of quantum computation through measuring the correlation of a gapped ground state, while the bulk Hamiltonian is utilized to stabilize the resource. A simple computational primitive, by pulling out a single spin…
In [2], Bowen showed that for an expansive system (X, T) with specification and a potential with the Bowen property, the equilibrium state is unique and fully supported. We generalize that result by showing that the same conclusion holds…
The minimal evolution time between two distinguishable states is of fundamental interest in quantum physics. Very recently Mirkin et al. argue that some most common quantum-speed-limit (QSL) bounds which depend on the actual evolution time…
This thesis focuses on three main questions in the continuous variable and optical settings: where does a quantum advantage, that is, the ability of quantum machines to outperform classical machines, come from? How to ensure the proper…
We establish a sharp quantum advantage in determining the parity (even/odd) of an unknown permutation applied to any number $n \ge 3$ of particles. Classically, this is impossible with fewer than $n$ labels, being that the success is…
An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection. The quotient complexity of L, which…
The are substantial studies on distinguishabilities, especially local distinguishability, of quantum states. It is shown that a necessary condition of a local distinguishable state set is the total Schmidt rank not larger than the system…
We prove that for every odd $q\geq 3$, any $q$-query binary, possibly non-linear locally decodable code ($q$-LDC) $E:\{\pm1\}^k \rightarrow \{\pm1\}^n$ must satisfy $k \leq \tilde{O}(n^{1-2/q})$. For even $q$, this bound was established in…
We use elementary arguments to prove results on the order of magnitude of certain sums concerning the gcd's and lcm's of $k$ positive integers, where $k\ge 2$ is fixed. We refine and generalize an asymptotic formula of Bordell\`{e}s (2007),…
This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…
Let $k\leq n$ be two positive integers and $q$ a prime power. The basic question in minimal linear codes is to determine if there exists an $[n,k]_q$ minimal linear code. The first objective of this paper is to present a new sufficient and…
Mutually unbiased bases encapsulate the concept of complementarity - the impossibility of simultaneous knowledge of certain observables - in the formalism of quantum theory. Although this concept is at the heart of quantum mechanics, the…
In this paper, the connections between model theory and the theory of infinite permutation groups are used to study the n-existence and the n-uniqueness for n-amalgamation problems of stable theories. We show that, for any n>1, there exists…
We design Latvian quantum finite state automata (LQFAs for short) recognizing unary regular languages with isolated cut point 1/2. From an architectural point of view, we combine two LQFAs recognizing with isolated cut point, respectively,…
A $t$-intersecting constant dimension subspace code $C$ is a set of $k$-dimensional subspaces in a projective space PG(n,q), where distinct subspaces intersect in a $t$-dimensional subspace. A classical example of such a code is the…
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical ``black box'' function drawn from some set of such black box functions, we investigate a more general quantum query model…