Preprint
Sep 2026
Learning Sparse Quantum States
This work gives the first near optimal algorithm for learning $n$-qubit $k$-sparse pure quantum states, obtaining fidelity at least $1-\varepsilon$ with high probability using $\tilde{O}(k/\varepsilon)$ copies of the state and $\tilde{O}(kn/\varepsilon)$ time.
Aniruddha Sen
· 0 citations