On the explicit constructions of certain unitary $t$-designs
Abstract
Unitary -designs are `good' finite subsets of the unitary group that approximate the whole unitary group well. Unitary -designs have been applied in randomized benchmarking, tomography, quantum cryptography and many other areas of quantum information science. If a unitary -design itself is a group then it is called a unitary -group. Although it is known that unitary -designs in exist for any and , the unitary -groups do not exist for if , as it is shown by Guralnick-Tiep (2005) and Bannai-Navarro-Rizo-Tiep (BNRT, 2018). Explicit constructions of exact unitary -designs in are not easy in general. In particular, explicit constructions of unitary -designs in have been an open problem in quantum information theory. We prove that some exact unitary -designs in the unitary group are constructed from unitary -groups in that satisfy certain specific conditions. Based on this result, we specifically construct exact unitary -designs in from the unitary -group in and also unitary -designs in from the unitary -group in numerically. We also discuss some related problems.
Cite
@article{arxiv.1906.04583,
title = {On the explicit constructions of certain unitary $t$-designs},
author = {Eiichi Bannai and Mikio Nakahara and Da Zhao and Yan Zhu},
journal= {arXiv preprint arXiv:1906.04583},
year = {2020}
}
Comments
17 pages, 1 figure