activity
20082026
most citedQuantum circuits for exact unitary -designs and applications to higher-order randomized benchmarking

41 citations · 113 across the 31 of their papers we have counts for

collaborators

34 papers

math.CO2026

-polynomial coherent configurations

Eiichi Bannai, Sho Suda, Yan Zhu

Suda introduced the notion of a -polynomial coherent configuration, which provides a natural and important concept. Subsequently, Lato introduced a notion of a -polynomial co…

math.CO2025

On the existence and non-existence of spherical -stiff configurations

Eiichi Bannai, Hirotake Kurihara, Hiroshi Nozaki

This paper investigates the existence of -stiff configurations in the unit sphere , which are spherical -designs that lie on parallel hyperplanes. We establ…

math.CO2024

Bivariate -polynomial structures for the nonbinary Johnson scheme and the association scheme obtained from attenuated spaces

Eiichi Bannai, Hirotake Kurihara, Da Zhao +1

The study of -polynomial association schemes (distance-regular graphs) and -polynomial association schemes, and in particular - and -polynomial association schemes, has…

math.CO2023

A note on the Assmus--Mattson theorem for some ternary codes (a resume)

Eiichi Bannai, Tsuyoshi Miezaki, Hiroyuki Nakasora

Let be a two and three-weight ternary code. Furthermore, we assume that are -designs for all by the Assmus--Mattson theorem. We show that . As a co…

math.CO2023★ 3 cited

Multivariate P- and/or Q-polynomial association schemes

Eiichi Bannai, Hirotake Kurihara, Da Zhao +1

The classification problem of - and -polynomial association schemes has been one of the central problems in algebraic combinatorics. Generalizing the concept of - and -…

math.CO2022★ 1 cited

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 …