arXiv:2609.39992
Predicting properties of Scrooge ensembles with high accuracy and low sample complexity
Yue Wu, Yuzhi Tong, Helen Propson, Yihui Quek, Liang Mao
Abstract
The Scrooge ensemble associated with a density matrix $ρ$ is the maximally random ensemble whose average density matrix is $ρ$. It has attracted growing interest for its applications to quantum many-body dynamics and quantum information. The intrinsic statistical properties of the Scrooge ensembles are encoded in their higher-order moments, yet they are nontrivial to analyze and prepare for they feature a non-polynomial Haar integrand, blocking direct use of Haar integration machinery. Existing physical mechanisms to sample multiple copies of states from the Scrooge ensembles, meanwhile, typically require costly postselection, rendering them inefficient for large system size. In this work, we develop efficient and accurate methods for analyzing and implementing Scrooge moments. We first introduce a polynomial approximation to the Scrooge $k$-th moments whose error is tunable down to a threshold that improves from inverse polynomial to exponential in $1/||ρ||_\infty$ over previous results. Building on our approximation, we then give the first efficient quantum algorithm that estimates observable expectation values using $\widetilde{\mathcal{O}}(k^3/ε^5)$ copies of $ρ$ for any target error $ε$ above this threshold. We further provide a construction of a block encoding of the Scrooge $k$-th moment when the preparation circuit of $ρ$ is known. Of independent interest could be a key subroutine in our algorithms, which efficiently implements projection onto the $k$-fold symmetric subspace for $ρ^{\otimes k}$ using $\mathcal{O}(k^3/ε^2)$ samples of $ρ$, avoiding the naive $k!$ postselection cost of such a projection. These results provide new tools for both the theoretical analysis and practical prediction of properties of Scrooge ensembles, with potential applications to quantum many-body dynamics and quantum information processing.
AI Summary
Scrooge ensembles generalize Haar-random pure states while fixing their average density matrix to $\rho$. This paper addresses how to analyze their higher moments and estimate observables from copies of unknown $\rho$, without directly preparing repeated copies of a sampled ensemble state. The approach replaces the normalization denominator in the $k$th moment by a truncated geometric polynomial, expressing the approximation through higher Haar moments. This polynomial coincides with an existing polynomial-modulation technique; the paper develops accuracy guarantees and quantum implementations. Writing $M=\lfloor1/\|\rho\|_\infty\rfloor$, the certified additive error reaches $C_{\rm add}e^{-M/[24(k-1)^2]}$, while the relative operator-order error reaches $C_{\rm rel}e^{-M/[24k(k-1)^2]}$. Above these thresholds, expansion order $O(\log(1/\epsilon))$ suffices. The proofs use Haar moment bounds and concentration; numerical tests on 12-site Ising Gibbs states illustrate smaller errors than the bounds. A Schur-transform construction approximately prepares the normalized symmetric projection of $\rho^{\otimes k}$ using $O(k^3/\epsilon^2)$ input copies, uniformly over $\rho$, rather than relying on potentially factorial-cost postselection. It replaces the permutation register within each Schur sector and bounds the sector-weight mismatch. Sector-weighted estimators then estimate efficiently measurable bounded observables of Scrooge moments using $\widetilde O(k^3/\epsilon^5)$ copies and polynomial circuit complexity. Purification-circuit access additionally enables block encoding with normalization $O(\epsilon^{-2})$. The Scrooge guarantees require sufficiently mixed states and accuracy above the certified floor. Extending them to high-purity states, optimizing sample complexity, and establishing concrete benefits for applications such as shadow tomography remain open.
The authors also acknowledge the use of AI tools to improve the writing of the manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 50 pages, 2 figures