Related papers: An improvement on the Delsarte-type LP-bound with …
This article focuses on Lp-estimates for the square root of elliptic systems of second order in divergence form on a bounded domain. We treat complex bounded measurable coefficients and allow for mixed Dirichlet/Neumann boundary conditions…
We consider a rate-distortion problem with side information at multiple decoders. Several upper and lower bounds have been proposed for this general problem or special cases of it. We provide an upper bound for general instances of this…
Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois…
Let G be a locally compact group L^p(G) be the usual L^p-space for 1 =< p =< infty and A(G) be the Fourier algebra of G. Our goal is to study, in a new abstract context, the completely bounded multipliers of A(G), which we denote…
In this paper we establish the $L^p$-$L^q$ boundedness of Fourier multipliers on locally compact separable unimodular groups for the range of indices $1<p\leq 2 \leq q<\infty$. Our approach is based on the operator algebras techniques. The…
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definitions to tackle this famous open problem which has been open…
The main purpose of this article is to explore the possibility of extending the notion of peripheral Poisson boundary of unital completely positive (UCP) maps to contractive completely positive (CCP) maps and to unital and non-unital…
Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of…
This paper introduces a new global optimization algorithm for solving the generalized linear multiplicative problem (GLMP). The algorithm starts by introducing $\bar{p}$ new variables and applying a logarithmic transformation to convert the…
Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…
We extend the deformation theory algorithm of matrix factorizations to systems with more than one D-brane. The obstructions to the deformations are F-term equations which can be integrated to an effective superpotential. We demonstrate the…
To prove Fourier restriction estimate using polynomial partitioning, Guth introduced the concept of $k$-broad part of regular $L^p$ norm and obtained sharp $k$-broad restriction estimates. To go from $k$-broad estimates to regular $L^p$…
We provide an upper bound for the number of limit cycles that planar polynomial differential systems of a given degree may have. The bound turns out to be a polynomial of degree four in the degree of the system. The strategy brings together…
In quantum information, complementarity of quantum mechanical observables plays a key role. If a system resides in an eigenstate of an observable, the probability distribution for the values of a complementary observable is flat. The…
Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem. All lower bounds so far have made strong restrictions on the computational model.…
Finding four six-dimensional mutually unbiased bases (MUBs) containing the identity matrix is a long-standing open problem in quantum information. We show that if they exist, then the $H_2$-reducible matrix in the four MUBs has exactly nine…
We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees…
Suppose that f is a function from Z_p -> [0,1] (Z_p is my notation for the integers mod p, not the p-adics), and suppose that a_1,...,a_k are some places in Z_p. In some additive number theory applications it would be nice to perturb f…
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…
The linearization of complex ordinary differential equations is studied by extending Lie's criteria for linearizability to complex functions of complex variables. It is shown that the linearization of complex ordinary differential equations…