Towards Optimal Circuit Size for Sparse Quantum State Preparation

Abstract

Compared to general quantum states, the sparse states arise more frequently in the field of quantum computation. In this work, we consider the preparation for $n$-qubit sparse quantum states with $s$ non-zero amplitudes and propose two algorithms. The first algorithm uses $O(ns/\log n+n)$ gates, improving upon previous methods by $O(\log n)$. We further establish a matching lower bound for any algorithm which is not amplitude-aware and employs at most $\mathrm{poly}(n)$ ancillary qubits. The second algorithm is tailored for binary strings that exhibit a short Hamiltonian path. An application is the preparation of $U(1)$-invariant state with $k$ down-spins in a chain of length $n$, including Bethe states, for which our algorithm constructs a circuit of size $O\left(\left(\genfrac{}{}{0ex}{}{n}{k}\right)\log n\right)$. This surpasses previous results by $O(n/\log n)$ and is close to the lower bound $O\left(\left(\genfrac{}{}{0ex}{}{n}{k}\right)\right)$. Both the two algorithms shrink the existing gap theoretically and provide increasing advantages numerically.