A note on tight projective 2-designs

被引:4
|
作者
Iverson, Joseph W. [1 ]
King, Emily J. [2 ]
Mixon, Dustin G. [3 ,4 ]
机构
[1] Iowa State Univ, Dept Math, Ames, IA USA
[2] Colorado State Univ, Dept Math, Ft Collins, CO 80523 USA
[3] Ohio State Univ, Dept Math, Columbus, OH 43210 USA
[4] Ohio State Univ, Translat Data Analyt Inst, Columbus, OH 43210 USA
基金
美国国家科学基金会;
关键词
projective; 2-designs;
D O I
10.1002/jcd.21804
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We study tight projective 2-designs in three different settings. In the complex setting, Zauner's conjecture predicts the existence of a tight projective 2-design in every dimension. Pandey, Paulsen, Prakash, and Rahaman recently proposed an approach to make quantitative progress on this conjecture in terms of the entanglement breaking rank of a certain quantum channel. We show that this quantity is equal to the size of the smallest weighted projective 2-design. Next, in the finite field setting, we introduce a notion of projective 2-designs, we characterize when such projective 2-designs are tight, and we provide a construction of such objects. Finally, in the quaternionic setting, we show that every tight projective 2-design for H d determines an equi-isoclinic tight fusion frame of d ( 2 d - 1 ) subspaces of R d ( 2 d + 1 ) of dimension 3.
引用
收藏
页码:809 / 832
页数:24
相关论文
共 50 条
  • [31] APPROACH TO 2-DESIGNS USING 1-DESIGNS
    DEHON, M
    BULLETIN DE LA CLASSE DES SCIENCES ACADEMIE ROYALE DE BELGIQUE, 1974, 60 (11): : 1486 - 1489
  • [32] A note on two families of 2-designs arose from Suzuki-Tits ovoid
    Alavi, S. H.
    ALGEBRA AND DISCRETE MATHEMATICS, 2022, 34 (02): : 169 - 175
  • [33] Additivity of symmetric and subspace 2-designs
    Buratti, Marco
    Nakic, Anamari
    DESIGNS CODES AND CRYPTOGRAPHY, 2024, 92 (11) : 3561 - 3572
  • [34] 2-DESIGNS OVER GF(Q)
    SUZUKI, H
    GRAPHS AND COMBINATORICS, 1992, 8 (04) : 381 - 389
  • [35] CONSTRUCTIONS OF SIMPLE CYCLIC 2-DESIGNS
    HAO, S
    HONG, W
    ARS COMBINATORIA, 1995, 39 : 231 - 239
  • [37] On Super-simple Cyclic 2-designs
    Chen, Kejun
    Wei, Ruizhong
    ARS COMBINATORIA, 2012, 103 : 257 - 277
  • [38] Linear Codes From Some 2-Designs
    Ding, Cunsheng
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (06) : 3265 - 3275
  • [39] Efficient 2-designs from bases exist
    Institute for Mathematical Sciences, Imperial College London, Prince's Gate, London, SW7 2BW, United Kingdom
    不详
    Quantum Inf. Comput., 2008, 8-9 (0734-0740):
  • [40] Morphophoric POVMs, generalised qplexes, and 2-designs
    Slomczynski, Wojciech
    Szymusiak, Anna
    QUANTUM, 2020, 4