Related papers: Mutually Unbiased Bases for Variational Quantum In…
We provide a partial solution to the problem of constructing mutually unbiased bases (MUBs) and symmetric informationally complete POVMs (SIC-POVMs) in non-prime-power dimensions. An algebraic description of a SIC-POVM in dimension six is…
In order to describe the right setting to handle Zauner's conjecture on mutually unbiased bases (MUBs) (saying that in $\mathbb{C}^d$, a set of MUBs of the theoretical maximal size $d + 1$ exists only if $d$ is a prime power), we pose some…
It is known that mutually unbiased bases, whenever they exist, are optimal in an information theoretic sense for the determination of unknown state of a quantum ensemble. These bases may not exist in most dimensions and some suboptimal…
We present a basis-set-free approach to the variational quantum eigensolver using an adaptive representation of the spatial part of molecular wavefunctions. Our approach directly determines system-specific representations of qubit…
Two equivalent ways of looking for mutually unbiased bases are discussed in this note. The passage from the search for d+1 mutually unbiased bases in C(d) to the search for d(d+1) vectors in C(d*d) satisfying constraint relations is…
There are fairly large families of unitarily inequivalent complete sets of N+1 mutually unbiased bases (MUBs) in C^N for various prime powers N. The number of such sets is not bounded above by any polynomial as a function of N. While it is…
We construct two mutually unbiased bases by maximally entangled states (MUMEB$s$) in $\mathbb{C}^{2}\otimes \mathbb{C}^{3}$. This is the first example of MUMEB$s$ in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ when $d\nmid d'$, namely $d'$ is…
There exist numerous problems in nature inherently described by finite $D$-dimensional states. Formulating these problems for execution on qubit-based quantum hardware requires mapping the qudit Hilbert space to that of multiqubit which may…
We study the connection between mutually unbiased bases and mutually orthogonal extraordinary supersquares, a wider class of squares which does not contain only the Latin squares. We show that there are four types of complete sets of…
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…
Mutually unbiased bases generalize the X, Y and Z qubit bases. They possess numerous applications in quantum information science. It is well-known that in prime power dimensions N=p^m (with p prime and m a positive integer) there exists a…
One way to construct a maximal set of mutually unbiased bases (MUBs) in a prime-power dimensional Hilbert space is by means of finite phase-space methods. MUBs obtained in this way are covariant with respect to some subgroup of the group of…
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…
In this paper, we consider the problem of Mutually Unbiased Bases in prime dimension $d$. It is known to provide exactly $d+1$ mutually unbiased bases. We revisit this problem using a class of circulant $d \times d$ matrices. The…
Recent studies suggest that gradient-based methods applied to relaxed box-constrained Quadratic Unconstrained Binary Optimization (QUBO) formulations can outperform classical heuristics in some large-scale regimes, often relying on heavy…
We report on a search for mutually unbiased bases (MUBs) in 6 dimensions. We find only triplets of MUBs, and thus do not come close to the theoretical upper bound 7. However, we point out that the natural habitat for sets of MUBs is the set…
Quadratic Unconstrained Binary Optimization (QUBO) is a standard NP-hard optimization problem. Recently, it has gained renewed interest through quantum computing, as QUBOs directly reduce to the Ising model, on which quantum annealing…
A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and…
In the search for quantum advantage in real--world problems, one promising avenue is to use a quantum algorithm to improve on the solution found using an efficient classical algorithm. The quantum approximate optimization algorithm (QAOA)…
Even though mutually unbiased bases and entropic uncertainty relations play an important role in quantum cryptographic protocols they remain ill understood. Here, we construct special sets of up to 2n+1 mutually unbiased bases (MUBs) in…