pith. sign in

arxiv: 2410.17213 · v1 · pith:5RWM6JL3new · submitted 2024-10-22 · 🪐 quant-ph

Random Real Valued and Complex Valued States Cannot be Efficiently Distinguished

classification 🪐 quant-ph
keywords cannotvertdistinguishedhaarmathbbrandomshortsqrt
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups

    quant-ph 2025-09 unverdicted novelty 6.0

    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.