Unitary designs and codes

DOI10.1007/S10623-009-9290-2MaRDI QIDQ1035804zbMATH OpenOpenAlexFDO

Authors Aidan Roy, A. J. Scott

Publication date 4 November 2009

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0809.3813

zbMATH Keywords

unitary groupzonal polynomialspherical designDelsarte boundspherical codelinear programming boundquantum process tomographyrank boundunitary codeunitary design

Mathematics Subject Classification ID

Approximate quadratures (41A55) Other designs, configurations (05B30) Quantum measurement theory, state operations, state preparations (81P15) Sampling theory in information and communication theory (94A20)

Abstract: 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 the trace inner product of any pair of matrices is restricted to only a small number of distinct values - and give an upper bound for the size of a code of degree s in U(d) for any d and s. These bounds can be strengthened when the particular inner product values that occur in the code or design are known. Finally, we describe some constructions of designs: we give an upper bound on the size of the smallest weighted unitary t-design in U(d), and we catalogue some t-designs that arise from finite groups.

Recommendations

• On the explicit constructions of certain unitaryt-designs
• Evenly distributed unitaries: On the structure of unitary designs
• Explicit construction of exact unitary designs
• Spherical 5-designs obtained from finite unitary groups.
• Approximate unitary 3-designs from transvection Markov chains

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 4158955 (Why is no real title available?)
• scientific article; zbMATH DE number 15438 (Why is no real title available?)
• scientific article; zbMATH DE number 3503264 (Why is no real title available?)
• scientific article; zbMATH DE number 1890851 (Why is no real title available?)
• scientific article; zbMATH DE number 2120949 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Averaging sets: A generalization of mean values and spherical designs
• Codes and designs in Grassmannian spaces.
• Cubature formulas, geometrical designs, reproducing kernels, and Markov operators
• Designs in Grassmannian spaces and lattices
• Efficient Quantum Tensor Product Expanders and k-Designs
• Evenly distributed unitaries: On the structure of unitary designs
• Increasing subsequences and the classical groups
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Linear programming bounds for codes in grassmannian spaces
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Nonmalleable encryption of quantum information
• On designs in compact metric spaces and a universal bound on their size
• On the Eigenvalues of Random Matrices
• Optimizing quantum process tomography with unitary2-designs
• Polynomial spaces
• Random quantum circuits are approximate 2-designs
• Rational tableaux and the tensor algebra of \(gl_ n\)
• Spherical codes and designs
• Symmetric informationally complete quantum measurements
• Tensor product representations of general linear groups and their connections with Brauer algebras
• Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization
• Unitary Error Bases: Constructions, Equivalence, and Applications

Cited in

(29)

• Rational designs
• Entanglement, quantum randomness, and complexity beyond scrambling
• Qubit flip game on a Heisenberg spin chain
• Invariant Semidefinite Programs
• Unitary \(t\)-groups
• On construction of finite averaging sets for SL(2,C) via its Cartan decomposition
• Pseudorandom (function-Like) quantum state generators: new definitions and applications
• Antipodal sets and designs on unitary groups
• On squares of representations of compact Lie algebras
• The complex conjugate invariants of Clifford groups
• Relative entropy bounds on quantum, private and repeater capacities
• Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions
• Explicit construction of exact unitary designs
• Great antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalities
• Spherical 5-designs obtained from finite unitary groups.
• Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
• Identification of a reversible quantum gate: assessing the resources
• Rényi formulation of uncertainty relations for POVMs assigned to a quantum design
• Twirling channels have minimal mixed-unitary rank
• Complex spherical designs and codes
• Positivity of linear maps under tensor powers
• On the explicit constructions of certain unitaryt-designs
• Evenly distributed unitaries: On the structure of unitary designs
• Efficient simulation of random states and random unitaries
• Duality of averaging of quantum states over arbitrary symmetry groups revealing Schur–Weyl duality
• Chaos and complexity by design
• Local random quantum circuits are approximate polynomial-designs
• Analysing quantum systems with randomised measurements
• Approximate unitary 3-designs from transvection Markov chains

This page was built for publication: Unitary designs and codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035804)