Mathematics – Combinatorics
Scientific paper
2008-09-22
Des. Codes Cryptogr. 53, 13-31 (2009)
Mathematics
Combinatorics
25 pages, no figures
Scientific paper
10.1007/s10623-009-9290-2
A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find a general lower bound on the size of a unitary t-design in U(d), for any d and t. We also introduce the notion of a unitary code - a subset of U(d) in which the trace inner product of any pair of matrices is restricted to only a small number of distinct values - and give an upper bound for the size of a code of degree s in U(d) for any d and s. These bounds can be strengthened when the particular inner product values that occur in the code or design are known. Finally, we describe some constructions of designs: we give an upper bound on the size of the smallest weighted unitary t-design in U(d), and we catalogue some t-designs that arise from finite groups.
Roy Aidan
Scott Andrew J.
No associations
LandOfFree
Unitary designs and codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Unitary designs and codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unitary designs and codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-326490