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.
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.
Construction of a large class of Mutually Unbiased Bases (MUBs) for non-prime power composite dimensions (d=k×s) is a long standing open problem, which leads to different construction methods for the class Approximate MUBs (AMUBs) by relaxing the criterion that the absolute value of the dot product between two vectors chosen from different bases should be ≤dβ. In this chapter, we consider a more general class of AMUBs (ARMUBs, considering the real ones too), compared to our earlier work in [Cryptography and Communications, 14(3): 527--549, 2022]. We note that the quality of AMUBs (ARMUBs) constructed using RBD(X,A) with ∣X∣=d, critically depends on the parameters, ∣s−k∣, μ (maximum number of elements common between any pair of blocks), and the set of block sizes. We present the construction of O(d) many β-AMUBs for composite d when ∣s−k∣<d, using RBDs having block sizes approximately d, such that ∣⟨ψil∣ψjm⟩∣≤dβ where β=1+2d∣s−k∣+O(d−1)≤2. Moreover, if real Hadamard matrix of order k or s exists, then one can construct at least N(k)+1 (or N(s)+1) many β-ARMUBs for dimension d, with β≤2−2d∣s−k∣+O(d−1)<2, where N(w) is the number of MOLS(w). This improves and generalizes some of our previous results for ARMUBs from two points, viz., the real cases are now extended to complex ones too. The earlier efforts use some existing RBDs, whereas here we consider new instances of RBDs that provide better results. Similar to the earlier cases, the AMUBs (ARMUBs) constructed using RBDs are in general very sparse, where the sparsity (ε) is 1−O(d−21).
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.
Mutually unbiased bases (MUB) have many applications in quantum information processing and quantum cryptography. Several complex MUB's in Cd for some dimension d and with larger size have been constructed. On the other hand, real MUB's with larger size are rare which lead to consider constructing approximate MUB (AMUB). In this paper we present a general and useful way to get real AMUB in R2d from any complex AMUB in Cd. From this method we present many new series of real AMUB's with parameters better than previous results.
Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of maximal sets of MUBs are well-known and standard construction relies on the Weyl-Heisenberg (WH) group and finite fields. In non-prime-power dimensions, on the other hand, the existence of such maximal sets remains an open question. We present a generalized numerical method of constructing MUBs without any reliance on \textit{a priori} group structure or specific algebraic frameworks. Formulating the problem at the level of Gram matrix, we reduce the search for complete sets of d+1 MUBs to a phase space optimisation problem. We use the fact that the MUB Gram matrix is a projection matrix, and the third- and fourth-order trace constraints are necessary and sufficient conditions for a projection matrix. We further develop a classification framework based on third-order Bargmann invariants and automorphism groups, allowing us to probe the underlying algebraic and geometric structure of the resulting configurations. Numerical applications of this method in dimensions 3, 4, and 5 demonstrate that all numerically constructed solutions are mutually isomorphic, are isolated points in phase space, and possess automorphism groups that coincide exactly with the Clifford group, the normalizer of the WH group. In the lowest non-prime-power dimension 6 where the existence of a complete set remains open, our numerical search yields no solution. However, for incomplete sets of solutions, our search finds no set of four MUBs, but it yields several inequivalent triples, which we classify and whose neighbourhood we then investigate.
Mutually unbiased bases (MUBs) are widely used in quantum information processing and play an important role in quantum cryptography, quantum state tomography and communications. It's difficult to construct MUBs and remains unknown whether complete MUBs exist for any non prime power. Therefore, researchers have proposed the solution to construct approximately mutually unbiased bases (AMUBs) by weakening the inner product conditions. This paper constructs q AMUBs of ℂq, (q+1) AMUBs of ℂq-1 and q AMUBs of ℂq-1 by using character sums over Galois rings and finite fields, where q is a power of a prime. The first construction of q AMUBs of ℂq is new which illustrates K AMUBs of ℂK can be achieved. The second and third constructions in this paper include the partial results about AMUBs constructed by W. Wang et al. in [9].
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.