Related papers: Mutually unbiased bases as a commuting polynomial …
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…
We prove the following two results relating real mutually unbiased bases and representations of finite groups of odd order. Let $q$ be a power of 2 and $r$ a positive integer. Then we can find a $q^{2r}\times q^{2r}$ real orthogonal matrix…
Quadratic Unconstrained Binary Optimization (QUBO) is recognized as a unifying framework for modeling a wide range of problems. Problems can be solved with commercial solvers customized for solving QUBO and since QUBO have degree two, it is…
Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Grobner bases algorithm is a well-known method to solve this problem. However, a serious drawback exists in the Grobner bases based…
In this paper, we propose novel algorithms for inferring the Maximum a Posteriori (MAP) solution of discrete pairwise random field models under multiple constraints. We show how this constrained discrete optimization problem can be…
The problem of minimizing a polynomial over a set of polynomial inequalities is an NP-hard non-convex problem. Thanks to powerful results from real algebraic geometry, one can convert this problem into a nested sequence of…
Mutually unbiased bases in Hilbert spaces of finite dimensions are closely related to the quantal notion of complementarity. An alternative proof of existence of a maximal collection of N+1 mutually unbiased bases in Hilbert spaces of prime…
In this paper, we consider algorithms to decide the existence of strategies in MDPs for Boolean combinations of objectives. These objectives are omega-regular properties that need to be enforced either surely, almost surely, existentially,…
We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…
Variational problems under uniform quasiconvex constraints on the gradient are studied. In particular, existence of solutions to such problems is proved as well as existence of lagrange multipliers associated to the uniform constraint. They…
This note is a short elaboration of the conjecture of Saniga et al (J. Opt. B: Quantum Semiclass. 6 (2004) L19-L20) by regarding a set of mutually unbiased bases (MUBs) in a d-dimensional Hilbert space, d being a power of a prime, as an…
Univariate polynomial root-finding is both classical and 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 polynomial…
Real-world problems typically require the simultaneous optimization of several, often conflicting objectives. Many of these multi-objective optimization problems are characterized by wide ranges of uncertainties in their decision variables…
Topology optimization problems often support multiple local minima due to a lack of convexity. Typically, gradient-based techniques combined with continuation in model parameters are used to promote convergence to more optimal solutions;…
Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…
We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…
Approximate vanishing ideal is a concept from computer algebra that studies the algebraic varieties behind perturbed data points. To capture the nonlinear structure of perturbed points, the introduction of approximation to exact vanishing…
Causal Bayesian networks are widely used tools for summarising the dependencies between variables and elucidating their putative causal relationships. By restricting the search to trees, for example, learning the optimum from data is…
We exhibit an infinite family of {\it triplets} of mutually unbiased bases (MUBs) in dimension 6. These triplets involve the Fourier family of Hadamard matrices, $F(a,b)$. However, in the main result of the paper we also prove that for any…
The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a variety of disciplines that face these problems. A new class…