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

41 citations · 58 across the 11 of their papers we have counts for

collaborators

12 papers

math.CO2026

On Neumaier Cayley graphs

Rhys J. Evans, Sergey Goryainov, Grigory Ryabov +1

In the present paper, we study Neumaier Cayley graphs. First, we give a criterion for a Cayley graph to be a Neumaier graph with a spread given by the cosets of a subgroup. Further…

math.CO2025

Generalized block diagonal Laplacian spectrum of graphs

Yanrui Xu, Da Zhao

We reduce the block all-one matrices in the generalized block Laplacian spectrum of graphs to block all-one matrices in the generalized block diagonal Lapalcian spectrum…

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★ 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 -…

quant-ph2021★ 41 cited

Quantum circuits for exact unitary -designs and applications to higher-order randomized benchmarking

Yoshifumi Nakata, Da Zhao, Takayuki Okuda +9

A unitary -design is a powerful tool in quantum information science and fundamental physics. Despite its usefulness, only approximate implementations were known for general .…

math.CO2020

Classification of partially metric Q-polynomial association schemes with

Da Zhao

We classify the Q-polynomial association schemes with which are partially metric with respect to the nearest neighbourhood relation. An association scheme is partially…

math.CO2020

Explicit construction of exact unitary designs

Eiichi Bannai, Yoshifumi Nakata, Takayuki Okuda +1

The purpose of this paper is to give explicit constructions of unitary -designs in the unitary group for all and . It seems that the explicit constructions were so…

math.CO2020

The complex conjugate invariants of Clifford groups

Eiichi Bannai, Manabu Oura, Da Zhao

Nebe, Rains and Sloane studied the polynomial invariants for real and complex Clifford groups and they relate the invariants to the space of complete weight enumerators of certain…

quant-ph2019★ 11 cited

On the explicit constructions of certain unitary -designs

Eiichi Bannai, Mikio Nakahara, Da Zhao +1

Unitary -designs are `good' finite subsets of the unitary group that approximate the whole unitary group well. Unitary -designs have been applied in randomized…

math.CO2019★ 3 cited

Integral graphs obtained by dual Seidel switching

Sergey Goryainov, Elena V. Konstantinova, Honghai Li +1

Dual Seidel switching is a graph operation introduced by W.~Haemers in 1984. This operation can change the graph, however it does not change its bipartite double, and because of th…

math.CO2017

Half of an antipodal spherical design

Eiichi Bannai, Da Zhao, Lin Zhu +2

We investigate several antipodal spherical designs on whether we can choose half of the points, one from each antipodal pair, such that they are balanced at the origin. In particul…

math.CO2017

Spherical embeddings of symmetric association schemes in 3-dimensional Euclidean space

Eiichi Bannai, Da Zhao

We classify the symmetric association schemes with faithful spherical embedding in 3-dimensional Euclidean space. Our result is based on previous research on primitive association…