Maximal orthoplectic fusion frames from mutually unbiased bases and block designs
From MaRDI portal
Publication:4609843
DOI10.1090/proc/13956zbMath1385.42027arXiv1607.04546OpenAlexW2487188254MaRDI QIDQ4609843
Bernhard G. Bodmann, John I. Haas
Publication date: 26 March 2018
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.04546
Related Items (7)
Nilpotent bridging for unions of two bases ⋮ Optimal arrangements of classical and quantum states with limited purity ⋮ A short history of frames and quantum designs ⋮ Combinatorial constructions of packings in Grassmannian spaces ⋮ Constructions of biangular tight frames and their relationships with equiangular tight frames ⋮ An extension of Bravyi-Smolin's construction for UMEBs ⋮ A Notion of Optimal Packings of Subspaces with Mixed-Rank and Solutions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Achieving the orthoplex bound and constructing weighted complex projective 2-designs with Singer sets
- t-designs in projective spaces
- Equiangular lines in Euclidean spaces
- The structure of minimizers of the frame potential on fusion frames
- On the equivalence between real mutually unbiased bases and a certain class of association schemes
- On the existence of equiangular tight frames
- Designs as maximum codes in polynomial metric spaces
- A group-theoretic framework for the construction of packings in Grassmannian spaces
- A family of optimal packings in Grassmannian manifolds
- Codes and designs in Grassmannian spaces.
- Tight \(p\)-fusion frames
- Bounds for codes and designs in complex subspaces
- Graph representations, two-distance sets, and equiangular lines
- Robust dimension reduction, fusion frames, and Grassmannian packings
- Equiangular lines, mutually unbiased bases, and spin models
- Upper bounds for constant weight error correcting codes
- Equiangular lines
- QUANTUM DESIGNS: FOUNDATIONS OF A NONCOMMUTATIVE DESIGN THEORY
- UNITARY OPERATOR BASES
- Linear programming bounds for codes in grassmannian spaces
- Sphere-packing bounds in the Grassmann and Stiefel manifolds
- Achieving the Welch Bound With Difference Sets
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Upper bounds on the cardinality of a binary code with a given minimum distance
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- Bounds on packings of spheres in the Grassmann manifold
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Symmetric informationally complete positive-operator-valued measures: A new computer study
- The Closest Packing of Spherical Caps in n Dimensions
This page was built for publication: Maximal orthoplectic fusion frames from mutually unbiased bases and block designs
