11,842 research outputs found
Tight t-Designs and Squarefree Integers
The authors prove, using a variety of number-theoretical methods, that tight t-designs in the projective spaces FPn of ‘lines’ through the origin in Fn+1 (F = ℂ, or the quarternions H) satisfy t ⩽ 5.Such a design is a generalisation of a combinatorial t-design. It is known that t ⩽ 5 in the cases F=ℝ,O (the octonions) and that t ⩽ 11 for tight spherical t-designs; hence the author's result essentially completes the classification of tight t-designs in compact connected symmetric spaces of rank 1
Multiqubit Clifford groups are unitary 3-designs
Unitary -designs are a ubiquitous tool in many research areas, including
randomized benchmarking, quantum process tomography, and scrambling. Despite
the intensive efforts of many researchers, little is known about unitary
-designs with in the literature. We show that the multiqubit
Clifford group in any even prime-power dimension is not only a unitary
2-design, but also a 3-design. Moreover, it is a minimal 3-design except for
dimension~4. As an immediate consequence, any orbit of pure states of the
multiqubit Clifford group forms a complex projective 3-design; in particular,
the set of stabilizer states forms a 3-design. In addition, our study is
helpful to studying higher moments of the Clifford group, which are useful in
many research areas ranging from quantum information science to signal
processing. Furthermore, we reveal a surprising connection between unitary
3-designs and the physics of discrete phase spaces and thereby offer a simple
explanation of why no discrete Wigner function is covariant with respect to the
multiqubit Clifford group, which is of intrinsic interest to studying quantum
computation.Comment: 7 pages, published in Phys. Rev.
Pooling spaces associated with finite geometry
AbstractMotivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing algorithms with applications to DNA library screening, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 55 (2000) 171–182], the notion of pooling spaces was introduced [T. Huang, C. Weng, Pooling spaces and non-adaptive pooling designs, Discrete Mathematics 282 (2004) 163–169] for a systematic way of constructing pooling designs; note that geometric lattices are among pooling spaces. This paper attempts to draw possible connections from finite geometry and distance regular graphs to pooling spaces: including the projective spaces, the affine spaces, the attenuated spaces, and a few families of geometric lattices associated with the orbits of subspaces under finite classical groups, and associated with d-bounded distance-regular graphs
- …