Evenly distributed unitaries: on the structure of unitary designs
D. Gross, K. Audenaert, J. Eisert
Abstract
We clarify the mathematical structure underlying unitary t-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any t-th order polynomial over the design equals the average over the entire unitary group. We present a simple necessary and sufficient criterion for deciding if a set of matrices constitutes a design. Lower bounds for the number of elements of 2-designs are derived. We show how to turn mutually unbiased bases into approximate 2-designs whose cardinality is optimal in leading order. Designs of higher order are discussed and an example of a unitary 5-design is presented. We comment on the relation between unitary and spherical designs and outline methods for finding designs numerically or by searching character tables of finite groups. Further, we sketch connections to problems in linear optics and questions regarding typical entanglement.
Create a lesson
Related papers
Spectral Fingerprints of Gauge Theories on a Quantum Computer
Graham Van Goffrier, Debasish Banerjee, Bipasha Chakraborty et al.
Dynamics of local quantum information in random unitary circuits
Ratul Thakur, Sthitadhi Roy
Factorized Boolean representations for efficient quantum synthesis
Mehul Shah, Robert Fiszer, Marek Perkowski
Detuning- and Stark-robust Rydberg gates
Elie Bataille, Gyohei Nomura, Manuel Endres
Krylov Break Times from an Inhomogeneous Lieb--Robinson Light Cone
Shunji Matsuura, Yoji Kawamura, Joseph Salfi et al.
Stochastic transport of a Goldstone mode in a self-organized atomic crystal
Zhanhai Yu, Di Xiang, Xiaotian Zhang et al.