Matrix concentration inequalities and efficiency of random universal sets of quantum gates

DOI10.22331/Q-2023-04-20-983MaRDI QIDQ6390787zbMATH OpenFDO

Authors Piotr Dulian, A. Sawicki

Publication date 10 February 2022

Full work available at URL https://doi.org/10.22331/Q-2023-04-20-983

Abstract: For a random set $mathcalSsubsetU(d)$ of quantum gates we provide bounds on the probability that $mathcalS$ forms a $delta$-approximate $t$-design. In particular we have found that for $mathcalS$ drawn from an exact $t$-design the probability that it forms a $delta$-approximate $t$-design satisfies the inequality $mathbbPleft(deltageqxight)leq2D_t,frac{e}^{-|mathcalS|x,mathrmarctanh(x)}(1-x^2{)}^{|mathcalS|/2}=Oleft(2D_{t}left(frac{e}^{-x^2}sqrt1-x^{2}ight{)}^{|mathcalS|}ight)$, where $D_t$ is a sum over dimensions of unique irreducible representations appearing in the decomposition of $$. We use our results to show that to obtain a $delta$-approximate $t$-design with probability $P$ one needs $O(delt{a}^{-2}(tlog(d)-log(1-P)))$ many random gates. We also analyze how $delta$ concentrates around its expected value $mathbbEdelta$ for random $mathcalS$. Our results are valid for both symmetric and non-symmetric sets of gates.

This page was built for publication: Matrix concentration inequalities and efficiency of random universal sets of quantum gates

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