Nearly orthogonal vectors and small antipodal spherical codes
From MaRDI portal
Publication:2200040
Abstract: How can vectors in be arranged so that they are as close to orthogonal as possible? In particular, define where the minimum is taken over all collections of unit vectors . In this paper, we focus on the case where is fixed and . In establishing bounds on , we find an intimate connection to the existence of systems of equiangular lines in . Using this connection, we are able to pin down whenever and establish asymptotics for general . The main tool is an upper bound on whenever is an isotropic probability mass on , which may be of independent interest. Our results translate naturally to the analogous question in . In this case, the question relates to the existence of systems of equiangular lines in , also known as SIC-POVM in physics literature.
Recommendations
Cites work
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- An Introduction to Frames
- An introduction to frames and Riesz bases
- Codes on Euclidean spheres
- Equiangular lines
- Equiangular lines in Euclidean spaces
- scientific article; zbMATH DE number 1542664 (Why is no real title available?)
- scientific article; zbMATH DE number 3008747 (Why is no real title available?)
- scientific article; zbMATH DE number 3407684 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Lower bounds for the simplexity of the n-cube
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Measure of Asymmetry of Convex Curves
- New bounds for equiangular lines and spherical two-distance sets
- On Orthogonal Matrices
- Optimal simplices and codes in projective spaces
- Packings in real projective spaces
- Perturbed Identity Matrices Have High Rank: Proof and Applications
- Probabilistic frames: An overview
- Spherical codes and designs
- Steiner equiangular tight frames
- Symmetric informationally complete quantum measurements
- The difference between consecutive primes. II
- The Tietäväinen bound for spherical codes
- Thirty-three miniatures. Mathematical and algorithmic applications of linear algebra
- Three Ways to Look at Mutually Unbiased Bases
- Upper bounds for \(s\)-distance sets and equiangular lines
Cited in
(18)- Orthogonal vectors in the n-dimensional cube and codes with missing distances
- Universal optimal configurations for the \(p\)-frame potentials
- Smaller Gershgorin disks for multiple eigenvalues of complex matrices
- A simple proof of the Grünbaum conjecture
- Nearest neighbor algorithm for spherical codes from the Leech lattice
- Repeated minimizers of \(p\)-frame energies
- Globally optimizing small codes in real projective spaces
- The core of a Grassmannian frame
- scientific article; zbMATH DE number 7741911 (Why is no real title available?)
- LARGE SIGNED SUBSET SUMS
- Optimal Parseval frames: total coherence and total volume
- Small codes
- Phase transitions for the minimizers of the \(p\)-frame potentials in \(\mathbb{R}^2\)
- p-adic Welch bounds and p-adic Zauner conjecture
- The topology of projective codes and the distribution of zeros of odd maps
- Nearly orthogonal vectors and small antipodal spherical codes
- Discrete and continuous Welch bounds for Banach spaces with applications
- On minimal smallest singular value of subframes for signal recovery
This page was built for publication: Nearly orthogonal vectors and small antipodal spherical codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200040)