Construction of $\varepsilon_{d}$-ASIC-POVMs via $2$-to-$1$ PN functions and the Li bound
Meng Cao, Xiantao Deng

TL;DR
This paper constructs approximate symmetric informationally complete POVMs (ASIC-POVMs) in prime power dimensions using special functions and bounds, advancing quantum measurement design.
Contribution
It introduces new methods to construct $oldsymbol{ ext{}oldsymbol{ ext{ASIC-POVMs}}}$ in dimensions $q$ and $q+1$ using $2$-to-$1$ PN functions and the Li bound, respectively.
Findings
Constructed $oldsymbol{ ext{}}oldsymbol{ ext{ASIC-POVMs}}$ in prime power dimensions.
Set of vectors forms biangular frames and asymptotically optimal codebooks.
Characterized how close these ASIC-POVMs are to SIC-POVMs.
Abstract
Symmetric informationally complete positive operator-valued measures (SIC-POVMs) in finite dimension are a particularly attractive case of informationally complete POVMs (IC-POVMs), which consist of subnormalized projectors with equal pairwise fidelity. However, it is difficult to construct SIC-POVMs, and it is not even clear whether there exists an infinite family of SIC-POVMs. To realize some possible applications in quantum information processing, Klappenecker et al. [37] introduced an approximate version of SIC-POVMs called approximately symmetric informationally complete POVMs (ASIC-POVMs). In this paper, we construct a class of -ASIC-POVMs in dimension and a class of -ASIC-POVMs in dimension , respectively, where is a prime power. We prove that all -to- perfect nonlinear (PN) functions can be used for…
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
TopicsCoding theory and cryptography · Mathematical Analysis and Transform Methods · graph theory and CDMA systems
