A random matrix model for random approximate t-designs

arXiv2210.07872MaRDI QIDQ6506799FDOQ6506799

Authors: Piotr Dulian, A. Sawicki 

Abstract: For a Haar random set $mathcalSsubsetU(d)$ of quantum gates we consider the uniform measure $u_{m}athcalS$ whose support is given by $mathcalS$. The measure $u_{m}athcalS$ can be regarded as a $delta(u_{m}athcalS,t)$-approximate $t$-design, $tinmathbb{Z}_{+}$. We propose a random matrix model that aims to describe the probability distribution of $delta(u_{m}athcalS,t)$ for any $t$. Our model is given by a block diagonal matrix whose blocks are independent, given by Gaussian or Ginibre ensembles, and their number, size and type is determined by $t$. We prove that, the operator norm of this matrix, $delta(t)$, is the random variable to which $sqrt|mathcalS|delta(u_{m}athcalS,t)$ converges in distribution when the number of elements in $mathcalS$ grows to infinity. Moreover, we characterize our model giving explicit bounds on the tail probabilities $mathbbP(delta(t)>2+epsilon)$, for any $epsilon>0$. We also show that our model satisfies the so-called spectral gap conjecture, i.e. we prove that with the probability $1$ there is $tinmathbb{Z}_{+}$ such that $su{p}_{kinmathbb{Z}_{+}}delta(k)=delta(t)$. Numerical simulations give convincing evidence that the proposed model is actually almost exact for any cardinality of $mathcalS$. The heuristic explanation of this phenomenon, that we provide, leads us to conjecture that the tail probabilities $mathbbP(sqrtmathcalSdelta(u_{m}athcalS,t)>2+epsilon)$ are bounded from above by the tail probabilities $mathbbP(delta(t)>2+epsilon)$ of our random matrix model. In particular our conjecture implies that a Haar random set $mathcalSsubsetU(d)$ satisfies the spectral gap conjecture with the probability $1$.

This page was built for publication: A random matrix model for random approximate $t$-designs

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