Related papers: Mutually Unbiased Bases for Variational Quantum In…
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…
Given a parameterized quantum circuit such that a certain setting of these real-valued parameters corresponds to Grover's celebrated search algorithm, can a variational algorithm recover these settings and hence learn Grover's algorithm? We…
A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…
Adaptive radar waveform design grounded in information-theoretic principles is critical for advancing cognitive radar performance in complex environments. This paper investigates the optimization of phase-coded waveforms under constant…
We tabulate bounds on the optimal number of mutually unbiased bases in R^d. For most dimensions d, it can be shown with relatively simple methods that either there are no real orthonormal bases that are mutually unbiased or the optimal…
The prospect of quantum solutions for complicated optimization problems is contingent on mapping the original problem onto a tractable quantum energy landscape, e.g. an Ising-type Hamiltonian. Subsequently, techniques like adiabatic…
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 examine the problem of exhibiting Bell nonlocality for a two-qudit entangled pure state using a randomly chosen set of mutually unbiased bases (MUBs). Interestingly, even if we employ only two-setting Bell inequalities, we find a…
One of the important approaches to detect quantum entanglement is using linear entanglement witnesses EWs. In this paper, by determining the envelope of the boundary hyper-planes defined by a family of linear EWs, a set of powerful…
Optimizing Reconfigurable Intelligent Surfaces (RIS) is a high-dimensional combinatorial challenge. Current quantum algorithms often simplify this problem by ignoring physical constraints like mutual coupling, which significantly degrades…
We present a quantum feature-selection framework based on a higher-order unconstrained binary optimization (HUBO) formulation that explicitly incorporates multivariate dependencies beyond standard quadratic encodings. In contrast to…
We present ML-UCB, a generalized upper confidence bound algorithm that integrates arbitrary machine learning models into multi-armed bandit frameworks. A fundamental challenge in deploying sophisticated ML models for sequential…
The question of determining the maximal number of mutually unbiased bases in dimension six has received much attention since their introduction to quantum information theory, but a definitive answer has still not been found. In this paper…
This is a review of the problem of Mutually Unbiased Bases in finite dimensional Hilbert spaces, real and complex. Also a geometric measure of "mubness" is introduced, and applied to some recent calculations in six dimensions (partly done…
This paper presents key enhancements to our previous work~\cite{naghmouchi2024mixed} on a hybrid Benders decomposition (HBD) framework for solving mixed integer linear programs (MILPs). In our approach, the master problem is reformulated as…
Mutually unbiased bases of a Hilbert space can be constructed by partitioning a unitary error basis. We consider this construction when the unitary error basis is a nice error basis. We show that the number of resulting mutually unbiased…
Mutually unbiased bases encapsulate the concept of complementarity - the impossibility of simultaneous knowledge of certain observables - in the formalism of quantum theory. Although this concept is at the heart of quantum mechanics, the…
We generalize the Quantum Approximate Optimization Algorithm (QAOA) of Farhi et al. (2014) to allow for arbitrary separable initial states with corresponding mixers such that the starting state is the most excited state of the mixing…
We initiate a systematic study of triplets of mutually unbiased bases (MUBs). We show that in $\mathbb{C}^d$ each MUB-triplet is characterized by a $d\times d\times d$ object that we call a Hadamard cube. We describe the basic properties of…
Mutually unbiased bases (MUBs) and symmetric informationally complete (SIC) positive operator-valued measurements (POVMs) are two related topics in quantum information theory. They are generalized to mutually unbiased measurements (MUMs)…