Measures to characterise Approximate Mutually Unbiased Bases
Ajeet Kumar, Uditanshu Sadual

TL;DR
This paper introduces measures to quantify how close approximate mutually unbiased bases (AMUBs) are to ideal MUBs, especially in dimensions where exact constructions are unknown, aiding their characterization and application.
Contribution
It defines quantifiable measures for AMUBs based on geometric and design principles, enabling their evaluation without explicit constructions.
Findings
Measures can estimate proximity of AMUBs to true MUBs.
Measures are applicable to various AMUB classes like Weak MUBs.
Evaluation of measures is possible without exact AMUB construction details.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Coding theory and cryptography · Quantum Information and Cryptography
