Efficient quantum tomography II

Following [OW16], we continue our analysis of: (1) "Quantum tomography", i.e., learning a quantum state, i.e., the quantum generalization of learning a discrete probability distribution; (2) The distribution of Young diagrams output by the RSK algorithm on random words. Regarding (2), we introduce two powerful new tools: (i) A precise upper bound on the expected length of the longest union of k disjoint increasing subsequences in a random length-n word with letter distribution α1 ≥ α2 ≥ cdots ≥ αd; (ii) A new majorization property of the RSK algorithm that allows one to analyze the Young diagram formed by the lower rows λk, λk+1, dots of its output. These tools allow us to prove several new theorems concerning the distribution of random Young diagrams in the nonasymptotic regime, giving concrete error bounds that are optimal, or nearly so, in all parameters. As one example, we give a fundamentally new proof of the fact that the expected length of the longest increasing sequence in a random length-n permutation is bounded by 2√n. This is the k = 1, αi equiv frac1d, d → ∞ special case of a much more general result we prove: the expected length of the kth Young diagram row produced by an α-random word is αk n ± 2√αkd n. From our new analyses of random Young diagrams we derive several new results in quantum tomography, including: (i) Learning the eigenvalues of an unknown state to ε-accuracy in Hellinger-squared, chi-squared, or KL distance, using n = O(d2/ε) copies; (ii) Learning the optimal rank-k approximation of an unknown state to ε-fidelity (Hellinger-squared distance) using n = widetildeO(kd/ε) copies.