Quasi-symmetric designs and equiangular tight frames

2015 ◽  
Author(s):  
Matthew Fickus ◽  
John Jasper ◽  
Dustin Mixon ◽  
Jesse Peterson
2012 ◽  
Vol 436 (5) ◽  
pp. 1014-1027 ◽  
Author(s):  
Matthew Fickus ◽  
Dustin G. Mixon ◽  
Janet C. Tremain

2009 ◽  
Vol 157 (6) ◽  
pp. 789-815 ◽  
Author(s):  
V. N. Malozemov ◽  
A. B. Pevnyi

2010 ◽  
Vol 432 (11) ◽  
pp. 2816-2823 ◽  
Author(s):  
David M. Duncan ◽  
Thomas R. Hoffman ◽  
James P. Solazzo

2016 ◽  
Vol 62 (9) ◽  
pp. 5225-5236 ◽  
Author(s):  
Matthew Fickus ◽  
Dustin G. Mixon ◽  
John Jasper

2018 ◽  
Vol 153 ◽  
pp. 54-66 ◽  
Author(s):  
Matthew Fickus ◽  
John Jasper ◽  
Dustin G. Mixon ◽  
Jesse Peterson

2007 ◽  
Vol 7 (3) ◽  
pp. 243-264
Author(s):  
A.J. Scott ◽  
J. Walgate ◽  
B.C. Sanders

Fingerprinting enables two parties to infer whether the messages they hold are the same or different when the cost of communication is high: each message is associated with a smaller fingerprint and comparisons between messages are made in terms of their fingerprints alone. In the simultaneous message passing model, it is known that fingerprints composed of quantum information can be made exponentially smaller than those composed of classical information. For small message lengths, we present constructions of optimal classical fingerprinting strategies with one-sided error, in both the one-way and simultaneous message passing models, and provide bounds on the worst-case error probability with the help of extremal set theory. The performance of these protocols is then compared to that for quantum fingerprinting strategies constructed from spherical codes, equiangular tight frames and mutually unbiased bases.


10.37236/9891 ◽  
2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Zhiqiang Xu ◽  
Zili Xu ◽  
Wei-Hsuan Yu

A finite subset $X$ on the unit sphere $\mathbb{S}^d$ is called an $s$-distance set with strength $t$ if its angle set $A(X):=\{\langle \mathbf{x},\mathbf{y}\rangle : \mathbf{x},\mathbf{y}\in X, \mathbf{x}\neq\mathbf{y} \}$ has size $s$, and $X$ is a spherical $t$-design but not a spherical $(t+1)$-design. In this paper, we consider to estimate the maximum size of such antipodal set $X$ for small $s$. Motivated by the method developed by Nozaki and Suda, for each even integer $s\in[\frac{t+5}{2}, t+1]$ with $t\geq 3$, we improve the best known upper bound of Delsarte, Goethals and Seidel. We next focus on two special cases: $s=3,\ t=3$ and $s=4,\ t=5$. Estimating the size of $X$ for these two cases is equivalent to estimating the size of real equiangular tight frames (ETFs) and Levenstein-equality packings, respectively. We improve the previous estimate on the size of real ETFs and Levenstein-equality packings. This in turn gives an upper bound on $|X|$ when $s=3,\ t=3$ and $s=4,\ t=5$, respectively.


Sign in / Sign up

Export Citation Format

Share Document