Related papers: Solution to the Mean King's problem with mutually …
We establish thresholds for the feasibility of random multi-graph alignment in two models. In the Gaussian model, we demonstrate an "all-or-nothing" phenomenon: above a critical threshold, exact alignment is achievable with high…
Suppose that for some unit vectors $b_1,\ldots b_n$ in $\mathbb C^d$ we have that for any $j\neq k$ $b_j$ is either orthogonal to $b_k$ or $|\langle b_j,b_k\rangle|^2 = 1/d$ (i.e. $b_j$ and $b_k$ are unbiased). We prove that if $n=d(d+1)$,…
The Quadratic Unconstrained Binary Optimization (QUBO) problems are NP hard; thus, so far, there are no algorithms to solve them efficiently. There are exact methods like the Branch-and-Bound algorithm for smaller problems, and for larger…
Mutually unbiased bases (MUBs) play a key role in many protocols in quantum science, such as quantum key distribution. However, defining MUBs for arbitrary high-dimensional systems is theoretically difficult, and measurements in such bases…
We derive a framework for quantifying entanglement in multipartite and high dimensional systems using only correlations in two unbiased bases. We furthermore develop such bounds in cases where the second basis is not characterized beyond…
Deciding which sets of quantum measurements allow a simultaneous readout is a central problem in quantum measurement theory. The problem is relevant not only from the foundational perspective but also has direct applications in quantum…
Klee's measure problem (computing the volume of the union of $n$ axis-parallel boxes in $\mathbb{R}^d$) is well known to have $n^{\frac{d}{2}\pm o(1)}$-time algorithms (Overmars, Yap, SICOMP'91; Chan FOCS'13). Only recently, a conditional…
Complete sets of mutually unbiased bases are only known to exist in prime-power dimensions. We will describe a few approaches to the problem proving the (non)-existence of four mutually unbiased bases in dimension 6. These will include the…
In this note we analyze two algorithms, one for producing a matching and one for an independent set, on $k$-uniform $d$-regular hypergraphs of large girth. As a result we obtain new lower bounds on the size of a maximum matching or…
We present a detailed computational and algebraic study of Mutually Unbiased Bases (MUBs) in finite-dimensional Hilbert spaces, with a particular focus on dimensions 2, 3, 4, and the challenging case of 6. Starting from the Hadamard-phase…
A lemma by Chen et al. [J. Phys. A: Math. Theor. 50, 475304 (2017)] provides a necessary condition on the structure of any complex Hadamard matrix in a set of four mutually unbiased bases in $\mathbb{C}^6$. The proof of the lemma is shown…
Robust methods, though ubiquitous in practice, are yet to be fully understood in the context of regularized estimation and high dimensions. Even simple questions become challenging very quickly. For example, classical statistical theory…
The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…
We establish a connection between the problem of constructing maximal collections of mutually unbiased bases (MUBs) and an open problem in the theory of Lie algebras. More precisely, we show that a collection of m MUBs in K^n gives rise to…
Unambiguous measurements play an important role in quantum information, with applications ranging from quantum key distribution to quantum state reconstruction. Recently, such measurements have also been used in quantum algorithms based on…
Independent set is a fundamental problem in combinatorial optimization. While in general graphs the problem is essentially inapproximable, for many important graph classes there are approximation algorithms known in the offline setting.…
We perform a duality transformation that allows one to express the partition function of the d-dimensional Ising model with random nearest neighbor coupling in terms of new spin variables defined on the square plaquettes of the lattice. The…
A bilateral (i.e., upper and lower) bound on the mean-square error under a general model mismatch is developed. The bound, which is derived from the variational representation of the chi-square divergence, is applicable in the Bayesian and…
An analytical method for getting new complex Hadamard matrices by using mutually unbiased bases and a nonlinear doubling formula is provided. The method is illustrated with the n=4 case that leads to a rich family of eight-dimensional…
We use difference sets to construct interesting sets of lines in complex space. Using (v,k,1)-difference sets, we obtain k^2-k+1 equiangular lines in C^k when k-1 is a prime power. Using semiregular relative difference sets with parameters…