REVIEW 3 cited by
Evenly distributed unitaries: on the structure of unitary designs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 3 Pith papers
-
Randomized Benchmarking in the Analogue Setting
Analogue randomized benchmarking (ARB) measures the average error rate per time evolution for a family of Hamiltonians on an analogue quantum simulator, demonstrated in classical simulations of XY spin chains.
-
Symmetries and overparametrization properties of Hamiltonian variational ansatzes for the $(1+1)$d $\mathbb{Z}_2$ lattice gauge theory
Numerical study of five symmetry-preserving HVAs for Z2 gauge theory finds overparametrization eliminates local minima and loss decay rate scales linearly with number of parameters.
-
Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity
Random circuits satisfy an ergodicity condition for positive-coefficient polynomials, and its deviation can benchmark quantum chip fidelity, recovering and generalizing linear cross-entropy benchmarking.
Discussion (0). Continue with ORCID to comment.