On the explicit constructions of certain unitary tt-designs

preprint2019arXivOpen access

Abstract

Unitary tt-designs are `good' finite subsets of the unitary group U(d)U(d) that approximate the whole unitary group U(d)U(d) well. Unitary tt-designs have been applied in randomized benchmarking, tomography, quantum cryptography and many other areas of quantum information science. If a unitary tt-design itself is a group then it is called a unitary tt-group. Although it is known that unitary tt-designs in U(d)U(d) exist for any tt and dd, the unitary tt-groups do not exist for t≥4t\geq 4 if d≥3d\geq 3, as it is shown by Guralnick-Tiep (2005) and Bannai-Navarro-Rizo-Tiep (BNRT, 2018). Explicit constructions of exact unitary tt-designs in U(d)U(d) are not easy in general. In particular, explicit constructions of unitary 44-designs in U(4)U(4) have been an open problem in quantum information theory. We prove that some exact unitary (t+1)(t+1)-designs in the unitary group U(d)U(d) are constructed from unitary tt-groups in U(d)U(d) that satisfy certain specific conditions. Based on this result, we specifically construct exact unitary 33-designs in U(3)U(3) from the unitary 22-group SL(3,2)SL(3,2) in U(3),U(3), and also unitary 44-designs in U(4)U(4) from the unitary 33-group Sp(4,3)Sp(4,3) in U(4)U(4) numerically. We also discuss some related problems.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.