1 citations · 2 across the 7 of their papers we have counts for
11 papers
On the two-distance embedding in real Euclidean space of coherent configuration of type (2,2;3)
Eiichi Bannai, Etsuko Bannai, Chin-Yen Lee +2
Finding the maximum cardinality of a -distance set in Euclidean space is a classical problem in geometry. Lisoněk in 1997 constructed a maximum -distance set in …
Quantum state tomography via non-convex Riemannian gradient descent
Ming-Chien Hsu, En-Jui Kuo, Wei-Hsuan Yu +2
The recovery of an unknown density matrix of large size requires huge computational resources. The recent Factored Gradient Descent (FGD) algorithm and its variants achieved state-…
Semidefinite programming bounds for complex spherical codes
Wei-Jiun Kao, Sho Suda, Wei-Hsuan Yu
A complex spherical code is a finite subset on the unit sphere in . A fundamental problem on complex spherical codes is to find upper bounds for those with prescribed…
Four-point semidefinite bound for equiangular lines
Wei-Jiun Kao, Wei-Hsuan Yu
A set of lines in passing through the origin is called equiangular if any two lines in the set form the same angle. We proved an alternative version of the three-poi…
Improvement of generalization of Larman-Rogers-Seidel's theorem
Cheng-Jui Yeh, Wei-Hsuan Yu
A finite set in the -dimensional Euclidean space is called an -distance set if the set of distances between any two distinct points of has size . In 1977, Larman-R…
Bounds on antipodal spherical designs with few angles
Zhiqiang Xu, Zili Xu, Wei-Hsuan Yu
A finite subset on the unit sphere is called an -distance set with strength if its angle set $A(X):=\{\langle \mathbf{x},\mathbf{y}\rangle : \mathbf{x…