A collection of pairwise mutually unbiased bases (in short: MUB) in d > 1 d>1 dimensions may consist of at most d + 1 d+1 bases. Such “complete” collections are known to exist in C d \mathbb {C}^d when d d is a power of a prime. However, in general, little is known about the maximum number N ( d ) N(d) of bases that a collection of MUB in C d \mathbb {C}^d can have. In this work it is proved that a collection of d d MUB in C d \mathbb {C}^d can always be completed. Hence N ( d ) ≠ d N(d)\neq d , and when d > 1 d>1 we have a dichotomy: either N ( d ) = d + 1 N(d)=d+1 (so that there exists a complete collection of MUB) or N ( d ) ≤ d − 1 N(d)\leq d-1 . In the course of the proof an interesting new characterization is given for a linear subspace of
A collection of pairwise mutually unbiased bases (in short: MUB) in d > 1 d>1 dimensions may consist of at most d + 1 d+1 bases. Such “complete” collections are known to exist in C d \mathbb {C}^d when d d is a power of a prime. However, in general, little is known about the maximum number N ( d ) N(d) of bases that a collection of MUB in C d \mathbb {C}^d can have. In this work it is proved that a collection of d d MUB in C d \mathbb {C}^d can always be completed. Hence N ( d ) ≠ d N(d)\neq d , and when d > 1 d>1 we have a dichotomy: either N ( d ) = d + 1 N(d)=d+1 (so that there exists a complete collection of MUB) or N ( d ) ≤ d − 1 N(d)\leq d-1 . In the course of the proof an interesting new characterization is given for a linear subspace of
A collection of pairwise mutually unbiased bases (in short: MUB) in d>1 dimensions may consist of at most d+1 bases. Such "complete" collections are known to exists in C^d when d is a power of a prime. However, in general little is known about the maximal number N(d) of bases that a collection of MUBs in C^d can have. In this work it is proved that a collection of d MUBs in C^d can be always completed. Hence N(d) cannot be d and when d>1 we have a dichotomy: either N(d)=d+1 (so that there exists a complete collection of MUBs), or N(d)\leq d-1. In the course of the proof an interesting new characterization is given for a linear subspace of M_d(C) to be a subalgebra.
In this paper, we explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions d that are powers of prime numbers, there exists a set of up to d+1 bases that form an MUB set. However, the maximum number of MUBs in dimensions that are not powers of prime numbers is not known. To address this issue, we introduce three algorithms based on First-Order Logic that can determine the maximum number of bases in an MUB set without numerical approximation. Our algorithms can prove this result in finite time, although the required time is impractical. Additionally, we present a heuristic approach to solve the semi-decision problem of determining if there are k MUBs in a given dimension d. As a byproduct of our research, we demonstrate that the maximum number of MUBs in any dimension can be achieved with definable complex parameters, computable complex parameters, and other similar fields.
An infinite family of strongly unextendible mutually unbiased bases in C22h
A set of b mutually unbiased bases (MUBs) in Cd (for d>1) comprises bd vectors in Cd, partitioned into b orthogonal bases for Cd such that the pairwise angle between all vectors from distinct bases is arccos(1/d). The largest number μ(d) of MUBs that can exist in Cd is at most d+1, but constructions attaining this bound are known only when d is a prime power. A set of b MUBs in Cd that cannot be enlarged, even by the first vector of a potential (b+1)-th MUB, is called strongly unextendible. Until now, only one infinite family of dimensions d containing b(d) strongly unextendible MUBs in Cd satisfying b(d)<μ(d) was known, this family, due to Szántó, is asymptotically "large" in the sense that b(d)/μ(d)→1 as d→∞. However, the existence of 2m−1+1 strongly unextendible MUBs in C2m for each integer m>1 has been conjectured by Mandayam et al. We prove their conjecture for all even values of m, using only elementary linear algebra. The existence of this "small" new infinite family suggests, contrary to widespread belief, that μ(d) for non-prime-powers d might be significantly larger than the size of particular unextendible sets.
Mutually unbiased bases (MUBs) describe quantum measurements for which certainty in one basis gives uniform outcomes in the others. Their maximum number remains unknown in dimensions that are not powers of a prime. We introduce an ansatz that, in many dimensions, allows us to construct more MUBs than have previously been found. Each basis in the ansatz consists of a diagonal phase matrix applied to a fixed unitary, which is a tensor product of Fourier matrices and, optionally, any real Hadamard matrix. This construction yields five MUBs in dimension 12, six in dimensions 48, 96, and 192, seven in dimensions 36 and 108, and ten in dimension 648. These bases can then be extended to exceed the tensor product bound, asymptotically, in every eighteenth dimension. Moreover, we show that Paley's real Hadamard matrix can be used to construct q+1 bases in dimension d=q(q+1) for every prime power q≡3(mod4). This count grows as d and cannot be exceeded by tensor products of smaller sets.
Mutually Unbiased bases has various application in quantum information procession and coding theory. There can be maximum d + 1 MUBs in C^d and d/2 +1 MUBs in R^d. But , over R^d MUBs are known to be non existent when d is odd and for most of the other even d there are mostly 3 Real MUBs. In case of C^d the construction for complete set of MUBs are known for only Prime Power dimension. Thus in general large set of MUBs are not known, particularly for composite dimensions which are not of the form of prime powers. Because of this, there are many constructions of Approximate version of MUBs. In this paper we make an attempt to define certain measures to characterise the AMUBs. Our construction of measures derives its inspiration from the applications of MUBs, and based on them, we define certain quantifiable measures, which are can be computed and gives estimates of how close the Approximate MUBs are to the MUBs. We use geometric interpretation, projective design features of MUBs and applications like Optimal State determination and Entropic Uncertainty of MUBs. We show generic relationship between these measures and show that it can be evaluated for APMUBs without known the exact construction details, thereby showing that definition of APMUB is sufficient completely characterise it. We also evaluate these measure for an interesting class of AMUBs called Weak MUBs and certain AMUBs constructed using RBDs.