Unitary $t$-designs from $relaxed$ seeds

Abstract : In this work we reduce the requirements for generating $t$-designs, an important tool for randomisation with applications across quantum information and physics. We show that random quantum circuits with support over families of $relaxed$ finite sets of unitaries which are approximately universal in $U(4)$ (we call such sets $seeds$), converge towards approximate unitary $t$-designs efficiently in $poly(n,t)$ depth, where $n$ is the number of inputs of the random quantum circuit, and $t$ is the order of the design. We show this convergence for seeds which are relaxed in the sense that every unitary matrix in the seed need not have an inverse in the seed, nor be composed entirely of algebraic entries in general, two requirements which have restricited previous constructions. We suspect the result found here is not optimal, and can be improved. Particularly because the number of gates in the relaxed seeds introduced here grows with $n$ and $t$. We conjecture that constant sized seeds such as those in (Brand\~ao, Harrow, and Horodecki, Commun. Math. Phys. 2016) are sufficient.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02358598
Contributor : Rawad Mezher <>
Submitted on : Tuesday, November 12, 2019 - 8:26:44 AM
Last modification on : Wednesday, December 18, 2019 - 5:27:05 PM

Links full text

Identifiers

  • HAL Id : hal-02358598, version 1
  • ARXIV : 1911.03704

Citation

Rawad Mezher, Joe Ghalbouni, Joseph Dgheim, Damian Markham. Unitary $t$-designs from $relaxed$ seeds. 2019. ⟨hal-02358598⟩

Share

Metrics

Record views

18