Mutually unbiased bases (MUBs) are a crucial ingredient for many protocols in quantum information processing. Measurements performed in these bases are unbiased to the maximally possible extent, which is used to prove the randomness or secrecy of measurement results. In this work we show that certain properties of sets of MUBs crucially depend on their specific choice, including, somewhat surprisingly, measurement outcome labeling. If measurements are chosen in a coherent way, the secrecy of the result can be completely lost for specific sets of MUB measurements but partially retained for others. This could potentially impact a broad spectrum of applications where MUBs are utilized.
Quantum measurements based on mutually unbiased bases are commonly used in quantum information processing, as they are generally viewed as being maximally incompatible and complementary. Here we quantify precisely the degree of incompatibility of mutually unbiased bases (MUB) using the notion of noise robustness. Specifically, for sets of k MUB in dimension d, we provide upper and lower bounds on this quantity. Notably, we get a tight bound in several cases, in particular for complete sets of k=d+1 MUB (using the standard construction for d being a prime power). On the way, we also derive a general upper bound on the noise robustness for an arbitrary set of quantum measurements. Moreover, we prove the existence of sets of k MUB that are operationally inequivalent, as they feature different noise robustness, and we provide a lower bound on the number of such inequivalent sets up to dimension 32. Finally, we discuss applications of our results for Einstein-Podolsky-Rosen steering.
We show that the amount of complementarity that a quantum system can exhibit depends on which complementary properties one is considering. Consider a set of mutually unbiased bases (MUBs) which corresponds to the spectral decomposition of some maximally complementary properties: The perfect knowledge of one, i.e. the state of the system is one of the basis states, implies that all the others are completely unknown, namely the measurement of another property will find any of its possible outcomes with uniform probability. We show that, depending on which three of the MUBs we choose, a 5-dimensional system can have different degrees of complementarity, measured using the minimum over all the system states of the sum of the entropies and of the variances of the measurement outcomes related to the three chosen observables. This property was first found experimentally, and demonstrates that an experimental discovery can disclose quantum information effects.
Mutually unbiased bases (MUBs) are highly symmetric bases on complex Hilbert spaces, and the corresponding rank-1 projective measurements are ubiquitous in quantum information theory. In this work, we study a recently introduced generalisation of MUBs called mutually unbiased measurements (MUMs). These measurements inherit the essential property of complementarity from MUBs, but the Hilbert space dimension is no longer required to match the number of outcomes. This operational complementarity property renders MUMs highly useful for device-independent quantum information processing. It has been shown that MUMs are strictly more general than MUBs. In this work we provide a complete proof of the characterisation of MUMs that are direct sums of MUBs. We then construct new examples of MUMs that are not direct sums of MUBs. A crucial technical tool for this construction is a correspondence with quaternionic Hadamard matrices, which allows us to map known examples of such matrices to MUMs that are not direct sums of MUBs. Furthermore, we show that—in stark contrast with MUBs—the number of MUMs for a fixed outcome number is unbounded. Next, we focus on the use of MUMs in quantum communication. We demonstrate how any pair of MUMs with
doutcomes defines a
d-dimensional superdense coding protocol. Using MUMs that are not direct sums of MUBs, we disprove a recent conjecture due to Nayak and Yuen on the rigidity of superdense coding, for infinitely many dimensions. The superdense coding protocols arising in the refutation reveal how shared entanglement may be used in a manner heretofore unknown.
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.
In the framework of mutually unbiased bases (MUBs), a measurement in one basis gives no information about the outcomes of measurements in another basis. Here we relax the no-information condition by allowing the
d outcomes to be predicted according to a predefined probability distribution $q=({q}_{0},...,{q}_{d\ensuremath{-}1})$. The notion of mutual unbiasedness, however, is preserved by requiring that the extracted information is the same for any preparation and any measurement; regardless of which state from which basis is chosen to prepare the system, the outcomes of measuring the system with respect to the other basis generate the same probability distribution. In light of this, we define the notion of mutually equibiased bases (MEBs) such that within each basis the states are equibiased with respect to the states of the other basis and that the bases are mutually equibiased with respect to each other. For
d=2,3, we derive a set of
d+1 MEBs. The mutual equibiasedness imposes nontrivial constraints on the distribution
q, leading, for
d=3, to the restriction $1/3\ensuremath{\le}\ensuremath{\mu}\ensuremath{\le}1/2$, where $\ensuremath{\mu}={\ensuremath{\sum}}_{k=0}^{2}{q}_{k}^{2}$. To capture the incompatibility of the measurements in MEBs, we derive an inequality for the probabilities of projective measurements in a qudit system, which yields an associated entropic uncertainty inequality. Finally, we construct a class of positive maps and their associated entanglement witnesses based on MEBs. While an entanglement witness constructed from MUBs is generally finer than one based on MEBs when both use the same number of bases, for certain values of the index $\ensuremath{\mu}$, employing a larger set of MEBs can yield a finer witness. We illustrate this behavior using isotropic states of a $3\ifmmode\times\else\texttimes\fi{}3$ system. Our results reveal that not all bases in a set of
L MEBs can contribute to the entanglement detection. A constraint, dependent on the probability distribution
q, limits the number of MEBs that can be employed.