Unitary designs and codes

DOI10.1007/S10623-009-9290-2zbMATH Open1172.05310arXiv0809.3813OpenAlexW2071880083MaRDI QIDQ1035804FDOQ1035804

Authors: Aidan Roy, A. J. Scott 

Publication date: 4 November 2009

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

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.

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

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

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)

Cites Work

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

Cited In (29)

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

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)