Related papers: Mutually unbiased bases as a commuting polynomial …
We consider questions posed in a recent paper of Mandayam, Bandyopadhyay, Grassl and Wootters [10] on the nature of "unextendible mutually unbiased bases." We describe a conceptual framework to study these questions, using a connection…
We describe sets of mutually unbiased bases (MUBs) for quantum states defined over the p-adic numbers Q_p, i.e. the states that can be described as elements of the (rigged) Hilbert space L2(Q_p). We find that for every prime p>2 there are…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
The construction of optimal line packings in real or complex Euclidean spaces has shown to be a tantalizingly difficult task, because it includes the problem of finding maximal sets of equiangular lines. In the regime where equiangular…
We introduce the notion of the unextendible maximally entangled basis (UMEB), a set of orthonormal maximally entangled states in d \times d consisting of fewer that d^2 vectors which have no additional maximally entangled vectors orthogonal…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
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…
The notation of mutually unbiased bases(MUB) was first introduced by Ivanovic to reconstruct density matrixes\cite{Ivanovic}. The subject about how to use MUB to analyze, process, and utilize the information of the second moments between…
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…
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…
Generally, multi-objective optimisation problems are solved exactly or approximated by solving a series of scalarisations, for example by dichotomic search. In this paper, we take a different approach and attempt to compute the set of all…
Mutually unbiased bases (MUBs), which are such that the inner product between two vectors in different orthogonal bases is constant equal to the inverse $1/\sqrt{d}$, with $d$ the dimension of the finite Hilbert space, are becoming more and…
We show that a complete set of seven mutually unbiased bases in dimension six, if it exists, cannot contain more than one product basis.
For a system of N qubits, spanning a Hilbert space of dimension d=2^N, it is known that there exists d+1 mutually unbiased bases. Different construction algorithms exist, and it is remarkable that different methods lead to sets of bases…
We give a synthetic construction of a complete system of mutually unbiased bases in $\mathbb{C}^3$.
We study the minimum weight basis problem on matroid when elements' weights are uncertain. For each element we only know a set of possible values (an uncertainty area) that contains its real weight. In some cases there exist bases that are…
Global polynomial optimization methods typically rely on compactness of the feasible region in order to find solutions. These methods can incur considerable computational expense and most commercially available solvers do not verify the…
We use combinatorial and Fourier analytic arguments to prove various non-existence results on systems of real and complex unbiased Hadamard matrices. In particular, we prove that a complete system of complex mutually unbiased Hadamard…
In the Inverse Matroid problem, we are given a matroid, a fixed basis $B$, and an initial weight function, and the goal is to minimally modify the weights -- measured by some function -- so that $B$ becomes a maximum-weight basis. The…
We show that if a set of four mutually unbiased bases (MUBs) in $\mathbb{C}^6$ exists and contains the identity, then any other basis in the set contains at most two product states and at the same time has Schmidt rank at least three. Here…