1 citations · 2 across the 4 of their papers we have counts for
5 papers
A Reduction Bound for Entanglement Detection by Positive Free Maps
Chin-Yen Lee
Collins, Hayden, and Nechita used free probability to construct families of -positive but not -positive maps and applied them to entanglement detection. We prove that pos…
On character table of Clifford groups
Chin-Yen Lee, Wei-Hsuan Yu, Yung-Ning Peng +1
Based on a presentation of and the help of [GAP], we construct the character table of the Clifford group for . As an application, we can ef…
Graphlet and Orbit Computation on Heterogeneous Graphs
Colin Cleveland, Chin-Yen Lee, Shen-Fu Tsai +2
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures…
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 …
The real equiangular tight frames obtained from rank graphs
Eiichi Bannai, Etsuko Bannai, Chin-Yen Lee +2
We present all nontrivial real equiangular tight frames in obtained as spherical embeddings of primitive rank graphs on vertices, and those…