Related papers: Evenly distributed unitaries: on the structure of …

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…

Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group…

This paper provides a survey of spherical designs and their applications, with a particular emphasis on the perspective of ``numerical analysis''. A set \(X_N\) of \(N\) points on the unit sphere \(\mathbb{S}^d\) is called a…

Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate…

Unitary $t$-designs are `good' finite subsets of the unitary group $U(d)$ that approximate the whole unitary group $U(d)$ well. Unitary $t$-designs have been applied in randomized benchmarking, tomography, quantum cryptography and many…

Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$ with the property that the average of certain (low-degree) polynomials in these points coincides with the global average of the polynomial on $\mathbb{S}^{d}$. They…

A unitary t-design is a set of unitaries that is "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. In various fields -- e.g. quantum information…

This paper examines the potential role of unit consistency as a system design principle. Unit-consistent generalized matrix inverses and unit-invariant matrix decompositions are derived in support of this principle. Applications of the…

A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…

We have established the method of characterizing the unitary design generated by a symmetric local random circuit. Concretely, we have shown that the necessary and sufficient condition for the circuit asymptotically forming a t-design is…

Spherical $t$-design is a finite subset on sphere such that, for any polynomial of degree at most $t$, the average value of the integral on sphere can be replaced by the average value at the finite subset. It is well-known that an…

Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization…

Rectangular designs are classified as regular, Latin regular, semiregular, Latin semiregular and singular designs. Some series of selfdual as well as alpharesolvable designs are obtained using matrix approaches which belong to the above…

A set ${X}_{N}=\{x_1,\ldots,x_N\}$ of $N$ points on the unit sphere $\mathbb{S}^d,\,d\geq 2$ is a spherical $t$-design if the average of any polynomial of degree at most $t$ over the sphere is equal to the average value of the polynomial…

Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…

Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…

Generalized $t$-designs, which form a common generalization of objects such as $t$-designs, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of $t$-designs, \emph{Discrete Math.}\ {\bf 309}…

The aim of this paper is to present a recursive construction of simple t-designs for arbitrary t. The construction is of purely combinatorial nature and it requires finding solutions for the indices of the ingredient designs that satisfy a…

For large classes of group testing problems, we derive lower bounds for the probability that all significant items are uniquely identified using specially constructed random designs. These bounds allow us to optimize parameters of the…

A spherical $t$-design is a finite subset $X$ of the unit sphere such that every polynomial of degree at most $t$ has the same average over $X$ as it does over the entire sphere. Determining the minimum possible size of spherical designs,…