Unitary designs and codes

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.

25 pages, no figures

References in corpus (12)

• Black holes as mirrors: quantum information in random subsystems
• Symmetric Informationally Complete Quantum Measurements
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Evenly distributed unitaries: on the structure of unitary designs
• Random Quantum Circuits are Approximate 2-designs
• Optimizing quantum process tomography with unitary 2-designs
• Reexamination of optimal quantum state estimation of pure states
• Unconditionally Secure Key Distribution In Higher Dimensions By Depolarization
• Linear programming bounds for codes in Grassmannian spaces
• Efficient Simulation of Random Quantum States and Operators
• Efficient Quantum Tensor Product Expanders and k-designs

Cited by in corpus (69)

• Chaos and complexity by design
• Local random quantum circuits are approximate polynomial-designs
• Rényi Entropies from Random Quenches in Atomic Hubbard and Spin Models
• Multiqubit Clifford groups are unitary 3-designs
• Statistical correlations between locally randomized measurements: a toolbox for probing entanglement in many-body quantum states
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• Unitary $n$-designs via random quenches in atomic Hubbard and Spin models: Application to the measurement of Rényi entropies
• Computational advantage from quantum superposition of multiple temporal orders of photonic gates
• Efficient unitary designs with nearly time-independent Hamiltonian dynamics
• Principles of Quantum Communication Theory: A Modern Approach
• Relative Entropy Bounds on Quantum, Private and Repeater Capacities
• Scrambling and Complexity in Phase Space
• Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics
• The Clifford group fails gracefully to be a unitary 4-design
• Entanglement, quantum randomness, and complexity beyond scrambling
• Universally Fisher-Symmetric Informationally Complete Measurements
• Quantum circuits for exact unitary $t$-designs and applications to higher-order randomized benchmarking
• Positivity of linear maps under tensor powers
• Random unitary maps for quantum state reconstruction
• Rolling quantum dice with a superconducting qubit
• Invariant semidefinite programs
• Analysing quantum systems with randomised measurements
• Entropic uncertainty relations from quantum designs
• Ensembles of physical states and random quantum circuits on graphs
• Iso-entangled mutually unbiased bases, symmetric quantum measurements and mixed-state designs
• Doubly optimal parallel wire cutting without ancilla qubits
• Local random quantum circuits are approximate polynomial-designs - numerical results
• Multiphoton Tomography with Linear Optics and Photon Counting
• Semidefinite programming, harmonic analysis and coding theory
• On squares of representations of compact Lie algebras
• Qubit flip game on a Heisenberg spin chain
• Testing symmetry on quantum computers
• Derandomizing quantum circuits with measurement based unitary designs
• Efficient simulation of random states and random unitaries
• Controlled quantum operations and combs, and their applications to universal controllization of divisible unitary operations
• Rényi formulation of uncertainty relations for POVMs assigned to a quantum design
• Experimental Implementation of Efficient Quantum Pseudorandomness on a 12-spin System
• Identification of a reversible quantum gate: assessing the resources
• Avoiding Barren Plateaus with Entanglement
• How to check universality of quantum gates?
• On the explicit constructions of certain unitary $t$-designs
• Quantum Codes from Twisted Unitary $t$-groups
• Kerdock Codes Determine Unitary 2-Designs
• Complexity is not Enough for Randomness
• Scalable evaluation of quantum-circuit error loss using Clifford sampling
• Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks
• Quantum Penny Flip game with unawareness
• Unitary $t$-designs from $relaxed$ seeds
• Fundamental limits on quantum cloning from the no-signalling principle
• Efficient approximate unitary designs from random Pauli rotations
• Quantum Polarization of Qudit Channels
• Twirling channels have minimal mixed-unitary rank
• On construction of finite averaging sets for $SL(2,\mathbb{C})$ via its Cartan decomposition
• Multipartite maximally entangled states in symmetric scenarios
• Randomized measurements for multi-parameter quantum metrology
• Fault tolerant quantum data locking
• Complementarity relations for design-structured POVMs in terms of generalized entropies of order $\alpha \in (0,2)$
• Bath Dynamical Decoupling with a Quantum Channel
• Advancing Quantum Networking: Some Tools and Protocols for Ideal and Noisy Photonic Systems
• Benchmarking the performance of a high-Q cavity qudit using random unitaries
• Generalized group designs: constructing novel unitary 2-, 3- and 4-designs
• Certification of a functionality in a quantum network stage
• Fundamental solutions of heat equation on unitary groups establish an improved relation between $\epsilon$-nets and approximate unitary $t$-designs
• Quantum Codes and Irreducible Products of Characters
• Complex spherical designs and codes
• On a Matrix Ensemble for Arbitrary Complex Quantum Systems
• Quantum Private Broadcasting
• More global randomness from less-random local gates
• Realizing Unitary $k$-designs with a Single Quench