Related papers: Mutually unbiased bases as a commuting polynomial …
Quantum systems with variables in ${\mathbb Z}(d)$ are considered. The properties of lines in the ${\mathbb Z}(d)\times {\mathbb Z}(d)$ phase space of these systems, are studied. Weak mutually unbiased bases in these systems are defined as…
We construct two mutually unbiased bases by maximally entangled states (MUMEB$s$) in $\mathbb{C}^{2}\otimes \mathbb{C}^{3}$. This is the first example of MUMEB$s$ in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ when $d\nmid d'$, namely $d'$ is…
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
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 develop a new technique to construct mutually unbiased tripartite absolutely maximally entangled bases. We first explore the tripartite absolutely maximally entangled bases and mutually unbiased bases in $\mathbb{C}^{d} \otimes…
A set of $b$ mutually unbiased bases (MUBs) in $\mathbb{C}^d$ (for $d > 1$) comprises $bd$ vectors in $\mathbb{C}^d$, partitioned into $b$ orthogonal bases for $\mathbb{C}^d$ such that the pairwise angle between all vectors from distinct…
It is conjectured that the question of the existence of projective planes whose order is not a power of prime is intimately linked with the problem whether there exists a set of d+1 mutually unbiased bases in a d-dimensional Hilbert space…
A typical goal of research in combinatorial optimization is to come up with fast algorithms that find optimal solutions to a computational problem. The process that takes a real-world problem and extracts a clean mathematical abstraction of…
We provide a general methodology for unbiased estimation for intractable stochastic models. We consider situations where the target distribution can be written as an appropriate limit of distributions, and where conventional approaches…
The Mean King's problem with mutually unbiased bases is reconsidered for arbitrary d-level systems. Hayashi, Horibe and Hashimoto [Phys. Rev. A 71, 052331 (2005)] related the problem to the existence of a maximal set of d-1 mutually…
Constructing four six-dimensional mutually unbiased bases (MUBs) is an open problem in quantum physics and measurement. We investigate the existence of four MUBs including the identity, and a complex Hadamard matrix (CHM) of Schmidt rank…
We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form. We show that they essentially can be reduced to two computer…
We investigate the interplay between mutual unbiasedness and product bases for multiple qudits of possibly different dimensions. A product state of such a system is shown to be mutually unbiased to a product basis only if each of its…
We study the problem of minimizing a multivariate polynomial function over the unit hypercube. By representing the polynomial through a hypergraph and exploiting its sparsity structure, we establish a new sufficient condition under which…
We describe a particular class of pairs of quantum observables which are extremal in the convex set of all pairs of compatible quantum observables. The pairs in this class are constructed as uniformly noisy versions of two mutually unbiased…
We study a general class of convex submodular optimization problems with indicator variables. Many applications such as the problem of inferring Markov random fields (MRFs) with a sparsity or robustness prior can be naturally modeled in…
In our previous paper \cite{co1} we have shown that the theory of circulant matrices allows to recover the result that there exists $p+1$ Mutually Unbiased Bases in dimension $p$, $p$ being an arbitrary prime number. Two orthonormal bases…
To integer programming problems, computational algebraic approaches using Grobner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time…
We study a general class of convex submodular optimization problems with indicator variables. Many applications such as the problem of inferring Markov random fields (MRFs) with a sparsity or robustness prior can be naturally modeled in…
Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization techniques which is based on Mathematical Programming with…