Random Real Valued and Complex Valued States Cannot be Efficiently Distinguished
read the original abstract
In this short note we show that the ensemble $\{O \vert 0\rangle \langle 0 \vert O^\top \ \vert \ O \in \mathbb{O(d)}\}$, where $O$ is drawn from the Haar measure on $\mathbb{O}(d)$ cannot be distinguished from $t$ copies of a Haar random state unless $t = \Omega(\sqrt{d})$. Our proof has the benefit of exactly computing the trace distance, which scales as $\Theta(t^2/d)$ for $t = O(\sqrt{d})$, between the moments as well as being surprisingly short. Lastly, we show that twirling certain states with orthogonal matrices yields exact $t=3$ designs, yet the same cannot be true for $t>3$.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.