Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom

TL;DR

The paper demonstrates that quantum states with low stabilizer complexity can be efficiently distinguished from Haar-random states, and establishes a lower bound on the T-gates needed for pseudorandom state generation.

Contribution

It provides an efficient algorithm to distinguish low stabilizer complexity states from Haar-random states and proves a new lower bound on T-gates for pseudorandom state preparation.

Findings

Efficient distinguishing algorithm for low stabilizer complexity states.

Lower bound of ( ext{log}(n)) T-gates for pseudorandom state generation.

Quantum states with low stabilizer fidelity are not pseudorandom.

Abstract

We show that quantum states with "low stabilizer complexity" can be efficiently distinguished from Haar-random. Specifically, given an $n$-qubit pure state $|\psi\rangle$, we give an efficient algorithm that distinguishes whether $|\psi\rangle$ is (i) Haar-random or (ii) a state with stabilizer fidelity at least $\frac{1}{k}$ (i.e., has fidelity at least $\frac{1}{k}$ with some stabilizer state), promised that one of these is the case. With black-box access to $|\psi\rangle$, our algorithm uses $O\!\left( k^{12} \log(1/\delta)\right)$ copies of $|\psi\rangle$ and $O\!\left(n k^{12} \log(1/\delta)\right)$ time to succeed with probability at least $1-\delta$, and, with access to a state preparation unitary for $|\psi\rangle$ (and its inverse), $O\!\left( k^{3} \log(1/\delta)\right)$ queries and $O\!\left(n k^{3} \log(1/\delta)\right)$ time suffice. As a corollary, we prove that $\omega(\log(n))$ $T$-gates are necessary for any Clifford+$T$ circuit to prepare computationally pseudorandom quantum states, a first-of-its-kind lower bound.