Core Concepts
Construction of Almost Perfect MUBs using Resolvable Block Designs.
Abstract
The content discusses the construction of Almost Perfect Mutually Unbiased Bases (APMUBs) by restricting the absolute value of inner products. It introduces the concept of APMUBs and their relation to Weighing matrices. The article explores connections between MUBs, Real MUBs, and various mathematical tools used for their construction. It highlights the challenges in constructing a large number of MUBs for composite dimensions and provides insights into Approximate MUBs. The analysis includes detailed explanations, definitions, and technical results related to Mutually Unbiased Bases and combinatorial designs.
Stats
Upper bound on the number of MUBs is d + 1.
Construction methods known for cases when d is a power of prime.
For d = pn1 pn2 ... pns, lower bound on the number of MUBs is pnr + 1.
Asymptotic bound for N(s) is given by N(s) → O(s^1/14.8).
Maximum number of codewords in binary constant weight codes with minimum distance 2(k - µ).
Quotes
"Various efforts have been made to explore connections between MUBs and geometrical objects such as polytopes and projective planes."
"Constructing a larger number of MUBs reaching the upper bound is elusive."
"Our techniques are based on combinatorial structures related to Resolvable Block Designs (RBDs)."