Automorphisms of unitary block designs
نویسندگان
چکیده
منابع مشابه
Unitary t-designs
Unitary t-designs provide a method to simplify integrating polynomials of degree less than t over U(d). We prove a classic result the trace double sum inequality and use it to derive the fundamental symmetries of t-designs. As an alternate approach to deriving an asymptotically tight lower bound on the size of t-designs, we introduce a greedy algorithm for constructing designs. Unfortunately, w...
متن کاملUnitary designs and codes
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...
متن کاملAsymptotically Unitary Equivalence and Asymptotically Inner Automorphisms
Let C be a unital AH-algebra and let A be a unital separable simple C∗-algebra with tracial rank zero. Suppose that φ1, φ2 : C → A are two unital monomorphisms. We show that there is a continuous path of unitaries {ut : t ∈ [0,∞)} of A such that lim t→∞ u∗tφ1(a)ut = φ2(a) for all a ∈ C if and only if [φ1] = [φ2] in KK(C,A), τ ◦ φ1 = τ ◦ φ2 for all τ ∈ T (A) and the rotation map η̃φ1,φ2 associate...
متن کاملImplementing Unitary 2-Designs Using Random Diagonal-unitary Matrices
Unitary 2-designs are random unitary matrices which, in contrast to their Haar-distributed counterparts, have been shown to be efficiently realized by quantum circuits. Most notably, unitary 2-designs are known to achieve decoupling, a fundamental primitive of paramount importance in quantum Shannon theory. Here we prove that unitary 2-designs can be implemented approximately using random diago...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1972
ISSN: 0021-8693
DOI: 10.1016/0021-8693(72)90070-1