Related papers: Mutually Unbiased Bases and Semi-definite Programm…
Mutually unbiased bases (MUB) are useful in a number of research areas. The symmetry of MUB is an elusive and interesting subject. A (complete set of) MUB in dimension $d$ is sharply covariant if it can be generated by a group of order…
We study mutually unbiased bases (MUBs) in which all the bases are unextendible maximally entangled ones. We first present a necessary and sufficient condition of constructing a pair of MUBs in $C^2 \otimes C^4$. Based on this condition, an…
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in…
Mutually unbiased bases, mutually unbiased measurements and general symmetric informationally complete measurements are three related concepts in quantum information theory. We investigate multipartite systems using these notions and…
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…
A spherical three-distance set is a finite collection $X$ of unit vectors in $\mathbb{R}^{n}$ such that for each pair of distinct vectors has three inner product values. We use the semidefinite programming method to improve the upper bounds…
Multiview geometry is the study of two-dimensional images of three-dimensional scenes, a foundational subject in computer vision. We determine a universal Groebner basis for the multiview ideal of n generic cameras. As the cameras move, the…
Mutually unbiased bases that can be cyclically generated by a single unitary operator are of special interest, since they can be readily implemented in practice. We show that, for a system of qubits, finding such a generator can be cast as…
This paper proposes a new approach to address the problem of unmeasured confounding in spatial designs. Spatial confounding occurs when some confounding variables are unobserved and not included in the model, leading to distorted…
We describe a simple method to derive high performance semidefinite programming relaxations for optimizations over complex and real operator algebras in finite dimensional Hilbert spaces. The method is very flexible, easy to program and…
We discuss how semidefinite programming can be used to determine the second-order density matrix directly through a variational optimization. We show how the problem of characterizing a physical or N -representable density matrix leads to…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of…
In the framework of mutually unbiased bases (MUBs), a measurement in one basis gives \emph{no information} about the outcomes of measurements in another basis. Here, we relax the no-information condition by allowing the $d$ outcomes to be…
We study unextendible maximally entangled basis in arbitrary bipartite spaces. A systematic way of constructing a set of $d^{2}$ orthonormal maximally entangled states in $\mathbb{C}^{d}\bigotimes\mathbb{C}^{d'}(\frac{d'}{2}<d<d')$ is…
Mutually unbiased bases generalize the X, Y and Z qubit bases. They possess numerous applications in quantum information science. It is well-known that in prime power dimensions N=p^m (with p prime and m a positive integer) there exists a…
Inspired by the many applications of mutually unbiased Hadamard matrices, we study mutually unbiased weighing matrices. These matrices are studied for small orders and weights in both the real and complex setting. Our results make use of…
Finite geometry is employed to underpin operators in finite, d, dimensional Hilbert space. The central role of mutual unbiased bases (MUB) states projectors is exhibited. Interrelation among operators in Hilbert space, revealed through…
In this paper, we consider the problem of Mutually Unbiased Bases in prime dimension $d$. It is known to provide exactly $d+1$ mutually unbiased bases. We revisit this problem using a class of circulant $d \times d$ matrices. The…
Dimensionality reduction can be applied to hyperspectral images so that the most useful data can be extracted and processed more quickly. This is critical in any situation in which data volume exceeds the capacity of the computational…