Related papers: Mutually Unbiased Bases and Semi-definite Programm…
Analysis of state reconstruction both classical and quantum mechanical on equal footing is outlined. The meaning of "mutual unbiased bases" (MUB) of Hilbert spaces is explained in detail. An alternative quantum state reconstruction, that…
Three-point semidefinite programming bounds are one of the most powerful known tools for bounding the size of spherical codes. In this paper, we use them to prove lower bounds for the potential energy of particles interacting via a pair…
Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…
We reveal a complete set of constraints that need to be imposed on a set of 3-by-3 matrices to ensure that the matrices represent genuine homographies associated with multiple planes between two views. We also show how to exploit the…
A multi-convex optimization problem is one in which the variables can be partitioned into sets over which the problem is convex when the other variables are fixed. Multi-convex problems are generally solved approximately using variations on…
An uncertainty relation is introduced for a symmetric arrangement of three mutually unbiased bases in continuous variable phase space, and then used to derive a bipartite entanglement criterion based on the variance of global operators…
Mutually unbiased bases (MUBs) are a crucial ingredient for many protocols in quantum information processing. Measurements performed in these bases are unbiased to the maximally possible extent, which is used to prove randomness or secrecy…
We show that k=w+2 mutually unbiased bases can be constructed in any square dimension d=s^2 provided that there are w mutually orthogonal Latin squares of order s. The construction combines the design-theoretic objects (k,s)-nets (which can…
We begin by defining mutually unbiased (MU) observables on a finite dimensional Hilbert space. We also consider the more general concept of parts of MU observables. The relationships between MU observables, value-complementary observables…
Enumerating the extremal submodular functions defined on subsets of a fixed base set has only been done for base sets up to five elements. This paper reports the results of attempting to generate all such functions on a six-element base…
In this paper, we propose an iterative algorithm to address the nonconvex multi-group multicast beamforming problem with quality-of-service constraints and per-antenna power constraints. We formulate a convex relaxation of the problem as a…
We develope a local theory for frames on finite dimensional Hilbert spaces. In particular, a bounded frame on a finite dimensional Hilbert space contains a subset which is a good Riesz basis for a percentage (arbitrarily close to one) of…
The mean king's problem with maximal mutually unbiased bases (MUB's) in general dimension d is investigated. It is shown that a solution of the problem exists if and only if the maximal number (d+1) of orthogonal Latin squares exists. This…
In the present paper, a novel framework to detect genuine multipartite entanglement (GME) has been presented by computing correlations in mutually unbiased bases (MUBs). It has been shown that correlation obtained by measuring in MUBs of…
The squashed entanglement is a widely used entanglement measure that has many desirable properties. However, as it is based on an optimization over extensions of arbitrary dimension, one drawback of this measure is the lack of good…
We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial…
The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a…
In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
A novel formulation and training procedure for full Boltzmann machines in terms of a mixed binary quadratic feasibility problem is given. As a proof of concept, the theory is analytically and numerically tested on XOR patterns.