Shallow quantum circuit for generating O(1)-entangled approximate state designs

Wonjun Lee, Minki Hhan, Gil Young Cho, Hyukjoon Kwon (Jul 25 2025).

Abstract: Random quantum states have various applications in quantum information science. In this work, we discover a new ensemble of quantum states that serve as an $\epsilon$-approximate state $t$-design while possessing extremely low entanglement, magic, and coherence. These resources can reach their theoretical lower bounds, $\Omega(\log (t/\epsilon))$, which are also proven in this work. This implies that for fixed $t$ and $\epsilon$, entanglement, magic, and coherence do not scale with the system size, i.e., $O(1)$ with respect to the total number of qubits $n$. Moreover, we explicitly construct an ancilla-free shallow quantum circuit for generating such states by transforming $k$-qubit approximate state designs into $n$-qubit ones without increasing the support size. The depth of such a quantum circuit, $O(t [\log t]^3 \log n \log(1/\epsilon))$, is the most efficient among existing algorithms without ancilla qubits. A class of quantum circuits proposed in our work offers reduced cost for classical simulation of random quantum states, leading to potential applications in quantum information processing. As a concrete example, we propose classical shadow tomography using an estimator with superpositions between only two states, which improves the runtime of a state certification task by requiring only $O(1)$ measurements and queries.

Arxiv: https://arxiv.org/abs/2507.17871